%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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:47 PM UTC 2026
% Result : Unsatisfiable 1.63s 1.21s
% Output : CNFRefutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 57 unt; 0 def)
% Number of atoms : 57 ( 56 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 62 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : implies(truth,X0) = X0,
file('/export/starexec/sandbox/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/sandbox/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(f4,axiom,
! [X0,X1] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
fof(f5,axiom,
! [X0,X1] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
fof(f6,plain,
! [X0,X1] : truth = implies(implies(not(X0),not(X1)),implies(X1,X0)),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_definition) ).
fof(f9,axiom,
! [X0,X1] : or(X0,X1) = or(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
fof(f10,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_definition) ).
fof(f13,axiom,
! [X0,X1] : xor(X0,X1) = or(and(X0,not(X1)),and(not(X0),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
fof(f19,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).
fof(f20,negated_conjecture,
xor(x,falsehood) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
fof(f21,plain,
x != xor(x,falsehood),
inference(reorient_equations,[],[f20]) ).
fof(f22,plain,
! [X0,X1] : and(X0,X1) = not(implies(not(not(X0)),not(X1))),
inference(definition_unfolding,[],[f10,f7]) ).
fof(f23,plain,
! [X0,X1] : xor(X0,X1) = implies(not(not(implies(not(not(X0)),not(not(X1))))),not(implies(not(not(not(X0))),not(X1)))),
inference(definition_unfolding,[],[f13,f7,f22,f22]) ).
fof(f26,plain,
! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
inference(definition_unfolding,[],[f9,f7,f7]) ).
fof(f32,plain,
x != implies(not(not(implies(not(not(x)),not(not(falsehood))))),not(implies(not(not(not(x))),not(falsehood)))),
inference(definition_unfolding,[],[f21,f23]) ).
tcf(c_66,plain,
! [X0: $i] : implies(truth,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_67,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_68,plain,
! [X0: $i,X1: $i] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
inference(cnf_transformation,[],[f4]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
inference(cnf_transformation,[],[f6]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : implies(not(X0),X1) = implies(not(X1),X0),
inference(cnf_transformation,[],[f26]) ).
tcf(c_77,plain,
not(truth) = falsehood,
inference(cnf_transformation,[],[f19]) ).
tcf(c_78,negated_conjecture,
implies(not(not(implies(not(not(x)),not(not(falsehood))))),not(implies(not(not(not(x))),not(falsehood)))) != x,
inference(cnf_transformation,[],[f32]) ).
tcf(c_110,plain,
implies(not(not(implies(not(not(x)),not(not(falsehood))))),not(implies(not(not(falsehood)),not(not(x))))) != x,
inference(demodulation,[status(thm)],[c_78,c_71]) ).
tcf(c_184,plain,
! [X0: $i] : implies(not(X0),truth) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_77,c_71]) ).
tcf(c_196,plain,
! [X0: $i] : implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_66,c_68]) ).
tcf(c_197,plain,
! [X0: $i,X1: $i] : implies(implies(X0,not(X1)),not(X1)) = implies(implies(not(X0),X1),X0),
inference(superposition,[status(thm)],[c_71,c_68]) ).
tcf(c_206,plain,
! [X0: $i] : implies(not(X0),not(X0)) = implies(implies(falsehood,X0),truth),
inference(superposition,[status(thm)],[c_184,c_196]) ).
tcf(c_222,plain,
! [X0: $i] : implies(implies(not(X0),not(truth)),X0) = truth,
inference(superposition,[status(thm)],[c_66,c_69]) ).
tcf(c_231,plain,
! [X0: $i] : implies(implies(not(X0),falsehood),X0) = truth,
inference(light_normalisation,[status(thm)],[c_222,c_77]) ).
tcf(c_299,plain,
! [X0: $i,X1: $i] : implies(implies(truth,X0),implies(implies(X0,X1),X1)) = truth,
inference(superposition,[status(thm)],[c_66,c_67]) ).
tcf(c_317,plain,
! [X0: $i,X1: $i] : implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(light_normalisation,[status(thm)],[c_299,c_66]) ).
tcf(c_697,plain,
! [X0: $i] : implies(implies(not(falsehood),X0),X0) = truth,
inference(superposition,[status(thm)],[c_71,c_231]) ).
tcf(c_698,plain,
implies(implies(falsehood,falsehood),truth) = truth,
inference(superposition,[status(thm)],[c_77,c_231]) ).
tcf(c_786,plain,
implies(not(falsehood),not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_698,c_206]) ).
tcf(c_814,plain,
implies(truth,not(falsehood)) = truth,
inference(superposition,[status(thm)],[c_786,c_697]) ).
tcf(c_839,plain,
not(falsehood) = truth,
inference(demodulation,[status(thm)],[c_814,c_66]) ).
tcf(c_840,plain,
! [X0: $i] : implies(implies(truth,X0),X0) = truth,
inference(demodulation,[status(thm)],[c_697,c_839]) ).
tcf(c_842,plain,
implies(not(not(implies(not(not(x)),not(truth)))),not(implies(not(truth),not(not(x))))) != x,
inference(demodulation,[status(thm)],[c_110,c_839]) ).
tcf(c_843,plain,
! [X0: $i] : implies(X0,X0) = truth,
inference(light_normalisation,[status(thm)],[c_840,c_66]) ).
tcf(c_844,plain,
implies(not(not(implies(not(not(x)),falsehood))),not(implies(falsehood,not(not(x))))) != x,
inference(light_normalisation,[status(thm)],[c_842,c_77]) ).
tcf(c_845,plain,
! [X0: $i] : implies(implies(X0,truth),truth) = truth,
inference(demodulation,[status(thm)],[c_196,c_843]) ).
tcf(c_860,plain,
! [X0: $i] : implies(not(X0),falsehood) = implies(truth,X0),
inference(superposition,[status(thm)],[c_839,c_71]) ).
tcf(c_862,plain,
! [X0: $i] : implies(not(X0),falsehood) = X0,
inference(light_normalisation,[status(thm)],[c_860,c_66]) ).
tcf(c_891,plain,
implies(not(not(not(x))),not(implies(falsehood,not(not(x))))) != x,
inference(demodulation,[status(thm)],[c_844,c_71,c_862]) ).
tcf(c_987,plain,
! [X0: $i] : implies(implies(falsehood,X0),truth) = truth,
inference(superposition,[status(thm)],[c_184,c_845]) ).
tcf(c_1067,plain,
! [X0: $i] : implies(X0,truth) = truth,
inference(superposition,[status(thm)],[c_845,c_317]) ).
tcf(c_1079,plain,
! [X0: $i] : implies(not(X0),implies(implies(falsehood,X0),truth)) = truth,
inference(superposition,[status(thm)],[c_184,c_317]) ).
tcf(c_1101,plain,
! [X0: $i] : implies(falsehood,X0) = truth,
inference(light_normalisation,[status(thm)],[c_1079,c_184,c_987]) ).
tcf(c_1105,plain,
implies(not(not(not(x))),not(truth)) != x,
inference(demodulation,[status(thm)],[c_891,c_1101]) ).
tcf(c_1106,plain,
implies(not(not(not(x))),falsehood) != x,
inference(light_normalisation,[status(thm)],[c_1105,c_77]) ).
tcf(c_1198,plain,
! [X0: $i] : implies(implies(X0,not(truth)),not(truth)) = implies(truth,X0),
inference(superposition,[status(thm)],[c_1067,c_197]) ).
tcf(c_1216,plain,
! [X0: $i] : implies(implies(X0,falsehood),falsehood) = X0,
inference(light_normalisation,[status(thm)],[c_1198,c_77,c_66]) ).
tcf(c_1255,plain,
! [X0: $i] : implies(X0,falsehood) = not(X0),
inference(superposition,[status(thm)],[c_862,c_1216]) ).
tcf(c_1270,plain,
! [X0: $i] : not(not(X0)) = X0,
inference(demodulation,[status(thm)],[c_862,c_1255]) ).
tcf(c_1288,plain,
$false,
inference(ground_joinability,[status(thm)],[c_1106,c_1255,c_1270]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 22:06:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.43 Running UEQ theorem proving
% 0.15/0.43 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.44
% 0.15/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.44
% 0.15/0.45 % Detected problem language: tptp
% 0.15/0.46 % Proving...
% 1.63/1.21 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.63/1.21 % SZS status Started for theBenchmark.p
% 1.63/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 1.63/1.21
% 1.63/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.63/1.21
% 1.63/1.21 % ------ iProver source info
% 1.63/1.21
% 1.63/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 1.63/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.63/1.21 % git: non_committed_changes: false
% 1.63/1.21
% 1.63/1.21 % ------ Parsing...% successful
% 1.63/1.21
% 1.63/1.21
% 1.63/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.63/1.21
% 1.63/1.21 % ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.63/1.21
% 1.63/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.63/1.21
% 1.63/1.21 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.63/1.21 % ------ Proving...
% 1.63/1.21 % ------ Problem Properties
% 1.63/1.21
% 1.63/1.21 %
% 1.63/1.21 % clauses 10
% 1.63/1.21 % conjectures 0
% 1.63/1.21 % EPR 0
% 1.63/1.21 % Horn 10
% 1.63/1.21 % unary 10
% 1.63/1.21 % binary 0
% 1.63/1.21 % lits 10
% 1.63/1.21 % lits eq 10
% 1.63/1.21 % fd_pure 0
% 1.63/1.21 % fd_pseudo 0
% 1.63/1.21 % fd_cond 0
% 1.63/1.21 % fd_pseudo_cond 0
% 1.63/1.21 % AC symbols 0
% 1.63/1.21
% 1.63/1.21 % ------ Input Options Time Limit: Unbounded
% 1.63/1.21
% 1.63/1.21
% 1.63/1.21 % ------
% 1.63/1.21 % Current options:
% 1.63/1.21 % ------
% 1.63/1.21
% 1.63/1.21
% 1.63/1.21 %
% 1.63/1.21
% 1.63/1.21 % ------ Proving...
% 1.63/1.21 %
% 1.63/1.21
% 1.63/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 1.63/1.21
% 1.63/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.63/1.21
% 1.63/1.21
%------------------------------------------------------------------------------