%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL161-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 : n014.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 2.74s 6.32s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : xor(X0,falsehood) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_2) ).
fof(f3,axiom,
! [X0] : xor(X0,X0) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_3) ).
fof(f4,plain,
! [X0] : falsehood = xor(X0,X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0] : and_star(X0,truth) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_4) ).
fof(f10,axiom,
! [X0,X1] : xor(X0,xor(truth,X1)) = xor(xor(X0,truth),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_7) ).
fof(f12,axiom,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',and_star_associativity) ).
fof(f14,axiom,
! [X0,X1] : and_star(X0,X1) = and_star(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f18,negated_conjecture,
implies(truth,x) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_axiom) ).
fof(f19,plain,
x != implies(truth,x),
inference(reorient_equations,[],[f18]) ).
fof(f21,plain,
x != xor(truth,and_star(truth,xor(truth,x))),
inference(definition_unfolding,[],[f19,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_65,plain,
! [X0: $i] : and_star(X0,truth) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : xor(xor(X0,truth),X1) = xor(X0,xor(truth,X1)),
inference(cnf_transformation,[],[f10]) ).
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(truth,xor(truth,x))) != x,
inference(cnf_transformation,[],[f21]) ).
tcf(c_110,plain,
xor(truth,xor(truth,x)) != x,
inference(ac_demodulation,[status(thm)],[c_74,c_65,c_71,c_72]) ).
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_231,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_110,c_230]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL161-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/5.39 % Computer : n014.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Wed Sep 23 22:07:09 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/5.43 Running UEQ theorem proving
% 0.17/5.43 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.44
% 0.17/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.17/5.44
% 0.17/5.44 % Detected problem language: tptp
% 0.17/5.45 % Proving...
% 2.74/6.32 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.74/6.32 % SZS status Started for theBenchmark.p
% 2.74/6.32 % SZS status Unsatisfiable for theBenchmark.p
% 2.74/6.32
% 2.74/6.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.74/6.32
% 2.74/6.32 % ------ iProver source info
% 2.74/6.32
% 2.74/6.32 % git: date: 2026-07-19 20:42:38 +0200
% 2.74/6.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.74/6.32 % git: non_committed_changes: false
% 2.74/6.32
% 2.74/6.32 % ------ Parsing...% successful
% 2.74/6.32
% 2.74/6.32
% 2.74/6.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.74/6.32
% 2.74/6.32 % ------ 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 %
% 2.74/6.32
% 2.74/6.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.74/6.32
% 2.74/6.32 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.74/6.32 % ------ Proving...
% 2.74/6.32 % ------ Problem Properties
% 2.74/6.32
% 2.74/6.32 %
% 2.74/6.32 % clauses 11
% 2.74/6.32 % conjectures 0
% 2.74/6.32 % EPR 0
% 2.74/6.32 % Horn 11
% 2.74/6.32 % unary 11
% 2.74/6.32 % binary 0
% 2.74/6.32 % lits 11
% 2.74/6.32 % lits eq 11
% 2.74/6.32 % fd_pure 0
% 2.74/6.32 % fd_pseudo 0
% 2.74/6.32 % fd_cond 0
% 2.74/6.32 % fd_pseudo_cond 0
% 2.74/6.32 % AC symbols 1
% 2.74/6.32
% 2.74/6.32 % ------ Input Options Time Limit: Unbounded
% 2.74/6.32
% 2.74/6.32
% 2.74/6.32 % ------
% 2.74/6.32 % Current options:
% 2.74/6.32 % ------
% 2.74/6.32
% 2.74/6.32
% 2.74/6.32 %
% 2.74/6.32
% 2.74/6.32 % ------ Proving...
% 2.74/6.32 %
% 2.74/6.32
% 2.74/6.32 % SZS status Unsatisfiable for theBenchmark.p
% 2.74/6.32
% 2.74/6.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.74/6.32
% 2.74/6.32
%------------------------------------------------------------------------------