%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL143-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:05:46 PM UTC 2026
% Result : Unsatisfiable 2.06s 1.29s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 25 unt; 4 def)
% Number of atoms : 72 ( 35 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 32 ( 19 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 38 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : implies(truth,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
fof(f2,axiom,
! [X2,X0,X1] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
fof(f3,plain,
! [X2,X0,X1] : truth = implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),
inference(reorient_equations,[],[f2]) ).
fof(f10,axiom,
! [X0,X1] :
( implies(X0,X1) = truth
| ~ ordered(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-1.ax',partial_order_definition1) ).
fof(f11,plain,
! [X0,X1] :
( truth = implies(X0,X1)
| ~ ordered(X0,X1) ),
inference(reorient_equations,[],[f10]) ).
fof(f12,axiom,
! [X0,X1] :
( ordered(X0,X1)
| implies(X0,X1) != truth ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-1.ax',partial_order_definition2) ).
fof(f13,plain,
! [X0,X1] :
( ordered(X0,X1)
| truth != implies(X0,X1) ),
inference(reorient_equations,[],[f12]) ).
fof(f14,negated_conjecture,
ordered(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antecedent) ).
fof(f15,negated_conjecture,
~ ordered(implies(z,x),implies(z,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_theorem) ).
tcf(c_59,plain,
! [X0: $i] : implies(truth,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
inference(cnf_transformation,[],[f3]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ( implies(X0,X1) = truth )
| ~ ordered(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( ordered(X0,X1)
| ( implies(X0,X1) != truth ) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_65,negated_conjecture,
ordered(x,y),
inference(cnf_transformation,[],[f14]) ).
tcf(c_66,negated_conjecture,
~ ordered(implies(z,x),implies(z,y)),
inference(cnf_transformation,[],[f15]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( ( implies(X0,X1) != truth )
| ordered(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_64]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( ordered(X0,X1)
| ( implies(X0,X1) != truth ) ),
inference(renaming,[status(thm)],[c_72]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( ( implies(X0,X1) = truth )
| ~ ordered(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
tcf(c_128,plain,
! [X0: $i,X1: $i] :
( ( implies(X0,X1) = truth )
| ( X1 != y )
| ( X0 != x ) ),
inference(resolution_lifted,[status(thm)],[c_65,c_74]) ).
tcf(c_129,plain,
implies(x,y) = truth,
inference(unflattening,[status(thm)],[c_128]) ).
tcf(c_133,plain,
! [X0: $i,X1: $i] :
( ( implies(z,y) != X1 )
| ( implies(z,x) != X0 )
| ( implies(X0,X1) != truth ) ),
inference(resolution_lifted,[status(thm)],[c_66,c_73]) ).
tcf(c_134,plain,
implies(implies(z,x),implies(z,y)) != truth,
inference(unflattening,[status(thm)],[c_133]) ).
tcf(c_163,definition,
iPr_def_10 = implies(z,x),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_164,definition,
iPr_def_11 = implies(z,y),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_165,definition,
iPr_def_12 = implies(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_166,definition,
iPr_def_13 = implies(x,y),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_167,plain,
iPr_def_12 != truth,
inference(demodulation,[status(thm)],[c_134,c_164,c_163,c_165]) ).
tcf(c_168,plain,
iPr_def_13 = truth,
inference(demodulation,[status(thm)],[c_129,c_166]) ).
tcf(c_213,plain,
iPr_def_12 != iPr_def_13,
inference(light_normalisation,[status(thm)],[c_167,c_168]) ).
tcf(c_216,plain,
! [X0: $i] : implies(iPr_def_13,X0) = X0,
inference(light_normalisation,[status(thm)],[c_59,c_168]) ).
tcf(c_217,plain,
! [X0: $i,X1: $i,X2: $i] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_60,c_168]) ).
tcf(c_218,plain,
! [X0: $i] : implies(iPr_def_10,implies(implies(x,X0),implies(z,X0))) = iPr_def_13,
inference(superposition,[status(thm)],[c_163,c_217]) ).
tcf(c_600,plain,
implies(iPr_def_10,implies(implies(x,y),iPr_def_11)) = iPr_def_13,
inference(superposition,[status(thm)],[c_164,c_218]) ).
tcf(c_610,plain,
implies(iPr_def_10,implies(iPr_def_13,iPr_def_11)) = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_600,c_166]) ).
tcf(c_758,plain,
iPr_def_12 = iPr_def_13,
inference(demodulation,[status(thm)],[c_610,c_165,c_216]) ).
tcf(c_759,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_758,c_213]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL143-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n020.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Wed Sep 23 22:05:33 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 2.06/1.29 % SZS status Started for theBenchmark.p
% 2.06/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.06/1.29
% 2.06/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.06/1.29
% 2.06/1.29 % ------ iProver source info
% 2.06/1.29
% 2.06/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.06/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.06/1.29 % git: non_committed_changes: false
% 2.06/1.29
% 2.06/1.29 % ------ Parsing...% successful
% 2.06/1.29
% 2.06/1.29
% 2.06/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.06/1.29
% 2.06/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 2.06/1.29
% 2.06/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.06/1.29
% 2.06/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.06/1.29 % ------ Proving...
% 2.06/1.29 % ------ Problem Properties
% 2.06/1.29
% 2.06/1.29 %
% 2.06/1.29 % clauses 11
% 2.06/1.29 % conjectures 0
% 2.06/1.29 % EPR 3
% 2.06/1.29 % Horn 11
% 2.06/1.29 % unary 10
% 2.06/1.29 % binary 1
% 2.06/1.29 % lits 12
% 2.06/1.29 % lits eq 12
% 2.06/1.29 % fd_pure 0
% 2.06/1.29 % fd_pseudo 0
% 2.06/1.29 % fd_cond 0
% 2.06/1.29 % fd_pseudo_cond 0
% 2.06/1.29 % AC symbols 0
% 2.06/1.29
% 2.06/1.29 % ------ Schedule dynamic 5 is on
% 2.06/1.29
% 2.06/1.29 % ------ no conjectures: strip conj schedule
% 2.06/1.29
% 2.06/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.06/1.29
% 2.06/1.29
% 2.06/1.29 % ------
% 2.06/1.29 % Current options:
% 2.06/1.29 % ------
% 2.06/1.29
% 2.06/1.29
% 2.06/1.29 %
% 2.06/1.29
% 2.06/1.29 % ------ Proving...
% 2.06/1.29 %
% 2.06/1.29
% 2.06/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.06/1.29
% 2.06/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.06/1.30
% 2.06/1.30
%------------------------------------------------------------------------------