%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL163-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 : n009.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:48 PM UTC 2026
% Result : Unsatisfiable 8.48s 1.92s
% Output : CNFRefutation 8.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : xor(X0,falsehood) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_2) ).
fof(f3,axiom,
! [X0] : xor(X0,X0) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_3) ).
fof(f4,plain,
! [X0] : falsehood = xor(X0,X0),
inference(reorient_equations,[],[f3]) ).
fof(f10,axiom,
! [X0,X1] : xor(X0,xor(truth,X1)) = xor(xor(X0,truth),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_7) ).
fof(f11,axiom,
! [X0,X1] : and_star(xor(and_star(xor(truth,X0),X1),truth),X1) = and_star(xor(and_star(xor(truth,X1),X0),truth),X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_8) ).
fof(f12,axiom,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_commutativity) ).
fof(f13,axiom,
! [X2,X0,X1] : and_star(and_star(X0,X1),X2) = and_star(X0,and_star(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_star_associativity) ).
fof(f14,axiom,
! [X0,X1] : and_star(X0,X1) = and_star(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_star_commutativity) ).
fof(f17,axiom,
! [X0,X1] : implies(X0,X1) = xor(truth,and_star(X0,xor(truth,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f18,negated_conjecture,
implies(implies(x,y),y) != implies(implies(y,x),x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wajsberg_axiom) ).
fof(f20,plain,
xor(truth,and_star(xor(truth,and_star(x,xor(truth,y))),xor(truth,y))) != xor(truth,and_star(xor(truth,and_star(y,xor(truth,x))),xor(truth,x))),
inference(definition_unfolding,[],[f18,f17,f17,f17,f17]) ).
tcf(c_63,plain,
! [X0: $i] : xor(X0,falsehood) = X0,
inference(cnf_transformation,[],[f2]) ).
tcf(c_64,plain,
! [X0: $i] : xor(X0,X0) = falsehood,
inference(cnf_transformation,[],[f4]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : xor(xor(X0,truth),X1) = xor(X0,xor(truth,X1)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] : and_star(xor(and_star(xor(truth,X0),X1),truth),X1) = and_star(xor(and_star(xor(truth,X1),X0),truth),X0),
inference(cnf_transformation,[],[f11]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f12]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] : and_star(and_star(X0,X1),X2) = and_star(X0,and_star(X1,X2)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] : and_star(X0,X1) = and_star(X1,X0),
inference(cnf_transformation,[],[f14]) ).
tcf(c_74,negated_conjecture,
xor(truth,and_star(xor(truth,and_star(x,xor(truth,y))),xor(truth,y))) != xor(truth,and_star(xor(truth,and_star(y,xor(truth,x))),xor(truth,x))),
inference(cnf_transformation,[],[f20]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] : and_star(X0,xor(and_star(xor(truth,X1),X0),truth)) = and_star(X1,xor(and_star(xor(truth,X0),X1),truth)),
inference(theory_normalisation,[status(thm)],[c_69,c_71,c_72]) ).
tcf(c_86,negated_conjecture,
xor(truth,and_star(xor(truth,x),xor(truth,and_star(y,xor(truth,x))))) != xor(truth,and_star(xor(truth,y),xor(truth,and_star(x,xor(truth,y))))),
inference(theory_normalisation,[status(thm)],[c_74,c_71,c_72]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] : and_star(X0,xor(truth,and_star(xor(truth,X1),X0))) = and_star(X1,xor(truth,and_star(xor(truth,X0),X1))),
inference(demodulation,[status(thm)],[c_85,c_70]) ).
tcf(c_193,plain,
! [X0: $i] : xor(falsehood,X0) = X0,
inference(superposition,[status(thm)],[c_63,c_70]) ).
tcf(c_222,plain,
! [X0: $i] : xor(truth,xor(truth,X0)) = xor(falsehood,X0),
inference(superposition,[status(thm)],[c_64,c_68]) ).
tcf(c_230,plain,
! [X0: $i] : xor(truth,xor(truth,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_222,c_193]) ).
tcf(c_374,plain,
! [X0: $i,X1: $i] : and_star(xor(truth,X0),xor(truth,and_star(xor(truth,X1),xor(truth,X0)))) = and_star(X1,xor(truth,and_star(X0,X1))),
inference(superposition,[status(thm)],[c_230,c_111]) ).
tcf(c_5512,plain,
! [X0: $i,X1: $i] : and_star(xor(truth,X0),xor(truth,and_star(X1,xor(truth,X0)))) = and_star(xor(truth,X1),xor(truth,and_star(X0,xor(truth,X1)))),
inference(superposition,[status(thm)],[c_230,c_374]) ).
tcf(c_5764,plain,
xor(truth,and_star(xor(truth,x),xor(truth,and_star(y,xor(truth,x))))) != xor(truth,and_star(xor(truth,x),xor(truth,and_star(y,xor(truth,x))))),
inference(demodulation,[status(thm)],[c_86,c_5512]) ).
tcf(c_5765,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_5764]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL163-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.08/0.35 % Computer : n009.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 22:07:28 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running UEQ theorem proving
% 0.13/0.40 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.13/0.42
% 0.13/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42
% 0.13/0.42 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 8.48/1.92 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 8.48/1.92 % SZS status Started for theBenchmark.p
% 8.48/1.92 % SZS status Unsatisfiable for theBenchmark.p
% 8.48/1.92
% 8.48/1.92 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.48/1.92
% 8.48/1.92 % ------ iProver source info
% 8.48/1.92
% 8.48/1.92 % git: date: 2026-07-19 20:42:38 +0200
% 8.48/1.92 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.48/1.92 % git: non_committed_changes: false
% 8.48/1.92
% 8.48/1.92 % ------ Parsing...% successful
% 8.48/1.92
% 8.48/1.92
% 8.48/1.92 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.48/1.92
% 8.48/1.92 % ------ Preprocessing... sup_sim: 1 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 %
% 8.48/1.92
% 8.48/1.92 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.48/1.92
% 8.48/1.92 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 8.48/1.92 % ------ Proving...
% 8.48/1.92 % ------ Problem Properties
% 8.48/1.92
% 8.48/1.92 %
% 8.48/1.92 % clauses 11
% 8.48/1.92 % conjectures 1
% 8.48/1.92 % EPR 0
% 8.48/1.92 % Horn 11
% 8.48/1.92 % unary 11
% 8.48/1.92 % binary 0
% 8.48/1.92 % lits 11
% 8.48/1.92 % lits eq 11
% 8.48/1.92 % fd_pure 0
% 8.48/1.92 % fd_pseudo 0
% 8.48/1.92 % fd_cond 0
% 8.48/1.92 % fd_pseudo_cond 0
% 8.48/1.92 % AC symbols 1
% 8.48/1.92
% 8.48/1.92 % ------ Input Options Time Limit: Unbounded
% 8.48/1.92
% 8.48/1.92
% 8.48/1.92 % ------
% 8.48/1.92 % Current options:
% 8.48/1.92 % ------
% 8.48/1.92
% 8.48/1.92
% 8.48/1.92 %
% 8.48/1.92
% 8.48/1.92 % ------ Proving...
% 8.48/1.92 %
% 8.48/1.92
% 8.48/1.92 % SZS status Unsatisfiable for theBenchmark.p
% 8.48/1.92
% 8.48/1.92 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.48/1.92
% 8.48/1.92
%------------------------------------------------------------------------------