%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL327-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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:06:21 PM UTC 2026
% Result : Unsatisfiable 139.92s 21.96s
% Output : CNFRefutation 139.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 36 unt; 0 def)
% Number of atoms : 76 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 30 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn 99 !; 0 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(implies(and(not(p),not(q)),equivalent(p,q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(or(not(p),q)),not(or(not(q),p)))))),
inference(definition_unfolding,[],[f11,f6,f9,f12]) ).
tcf(c_60,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f14]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f15]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf_transformation,[],[f17]) ).
tcf(c_65,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_67,negated_conjecture,
~ theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(or(not(p),q)),not(or(not(q),p)))))),
inference(cnf_transformation,[],[f19]) ).
tcf(c_104,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_65,c_60]) ).
tcf(c_110,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_61,c_65]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_62,c_65]) ).
tcf(c_128,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[c_66,c_104]) ).
tcf(c_132,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_66,c_118]) ).
tcf(c_204,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c_63,c_65]) ).
tcf(c_211,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[status(thm)],[c_64,c_65]) ).
tcf(c_215,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c_204,c_66]) ).
tcf(c_240,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[c_211,c_66]) ).
tcf(c_279,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[status(thm)],[c_215,c_110]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[status(thm)],[c_215,c_211]) ).
tcf(c_348,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(resolution,[status(thm)],[c_279,c_128]) ).
tcf(c_383,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[c_348,c_132]) ).
tcf(c_497,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,X1))
| ~ theorem(or(X2,X0))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[c_240,c_66]) ).
tcf(c_864,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(not(X1),X2)),or(X0,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_285,c_66]) ).
tcf(c_885,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c_497,c_118]) ).
tcf(c_896,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(X0,or(X1,X3)))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c_497,c_240]) ).
tcf(c_906,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_497,c_383]) ).
tcf(c_1374,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_906,c_132]) ).
tcf(c_2167,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[status(thm)],[c_885,c_110]) ).
tcf(c_6603,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(or(not(X3),X0)),or(X2,X1)))
| ~ theorem(or(X2,X3))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[c_896,c_864]) ).
tcf(c_13741,plain,
~ theorem(or(not(or(not(or(not(p),q)),not(or(not(q),p)))),or(not(not(p)),not(not(q))))),
inference(resolution,[status(thm)],[c_1374,c_67]) ).
tcf(c_160011,plain,
( ~ theorem(or(not(not(p)),or(not(p),q)))
| ~ theorem(or(not(not(or(not(q),p))),not(not(q)))) ),
inference(resolution,[status(thm)],[c_6603,c_13741]) ).
tcf(c_164059,plain,
~ theorem(or(not(not(or(not(q),p))),not(not(q)))),
inference(forward_subsumption_resolution,[status(thm)],[c_160011,c_2167]) ).
tcf(c_164165,plain,
~ theorem(or(not(not(q)),or(not(q),p))),
inference(resolution,[status(thm)],[c_164059,c_1374]) ).
tcf(c_164194,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_164165,c_2167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL327-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n006.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.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 22:50:56 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 139.92/21.96 % SZS status Started for theBenchmark.p
% 139.92/21.96 % SZS status Unsatisfiable for theBenchmark.p
% 139.92/21.96
% 139.92/21.96 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 139.92/21.96
% 139.92/21.96 % ------ iProver source info
% 139.92/21.96
% 139.92/21.96 % git: date: 2026-07-19 20:42:38 +0200
% 139.92/21.96 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 139.92/21.96 % git: non_committed_changes: false
% 139.92/21.96
% 139.92/21.96 % ------ Parsing...% successful
% 139.92/21.96
% 139.92/21.96
% 139.92/21.96 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 139.92/21.96
% 139.92/21.96 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 139.92/21.96
% 139.92/21.96 % ------ Preprocessing...
% 139.92/21.96 % ------ Proving...
% 139.92/21.96 % ------ Problem Properties
% 139.92/21.96
% 139.92/21.96 %
% 139.92/21.96 % clauses 8
% 139.92/21.96 % conjectures 1
% 139.92/21.96 % EPR 1
% 139.92/21.96 % Horn 8
% 139.92/21.96 % unary 6
% 139.92/21.96 % binary 1
% 139.92/21.96 % lits 11
% 139.92/21.96 % lits eq 0
% 139.92/21.96 % fd_pure 0
% 139.92/21.96 % fd_pseudo 0
% 139.92/21.96 % fd_cond 0
% 139.92/21.97 % fd_pseudo_cond 0
% 139.92/21.97 % AC symbols 0
% 139.92/21.97
% 139.92/21.97 % ------ Input Options Time Limit: Unbounded
% 139.92/21.97
% 139.92/21.97
% 139.92/21.97 % ------
% 139.92/21.97 % Current options:
% 139.92/21.97 % ------
% 139.92/21.97
% 139.92/21.97
% 139.92/21.97 %
% 139.92/21.97
% 139.92/21.97 % ------ Proving...
% 139.92/21.97 %
% 139.92/21.97
% 139.92/21.97 % SZS status Unsatisfiable for theBenchmark.p
% 139.92/21.97
% 139.92/21.97 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 139.92/21.97
% 139.92/21.97
%------------------------------------------------------------------------------