%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL285-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 : n017.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:15 PM UTC 2026
% Result : Unsatisfiable 10.98s 7.84s
% Output : CNFRefutation 10.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 37 unt; 0 def)
% Number of atoms : 83 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 33 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 10 ( 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 : 102 ( 0 sgn 102 !; 0 ?; 67 :)
% 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(equivalent(p,or(p,and(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,
~ theorem(not(or(not(or(not(p),or(p,not(or(not(p),not(q)))))),not(or(not(or(p,not(or(not(p),not(q))))),p))))),
inference(definition_unfolding,[],[f11,f12,f9]) ).
fof(f14,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(f15,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f16,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f17,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f18,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f19,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
tcf(c_60,negated_conjecture,
~ theorem(not(or(not(or(not(p),or(p,not(or(not(p),not(q)))))),not(or(not(or(p,not(or(not(p),not(q))))),p))))),
inference(cnf_transformation,[],[f13]) ).
tcf(c_61,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,[],[f14]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f15]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f17]) ).
tcf(c_65,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f18]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_67,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_96,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_67,c_61]) ).
tcf(c_101,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_67,c_62]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_67,c_63]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_67,c_64]) ).
tcf(c_116,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_67,c_65]) ).
tcf(c_204,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_106,c_66]) ).
tcf(c_206,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_116,c_66]) ).
tcf(c_382,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_96,c_66]) ).
tcf(c_424,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_101,c_66]) ).
tcf(c_456,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(superposition,[status(thm)],[c_106,c_424]) ).
tcf(c_457,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
inference(superposition,[status(thm)],[c_111,c_424]) ).
tcf(c_546,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,X1))
| ~ theorem(or(X2,X0))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_382,c_66]) ).
tcf(c_597,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_106,c_546]) ).
tcf(c_599,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,X1))
| ~ theorem(or(X0,or(X1,X1))) ),
inference(superposition,[status(thm)],[c_116,c_546]) ).
tcf(c_805,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_457,c_206]) ).
tcf(c_832,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_805,c_204]) ).
tcf(c_861,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_832,c_546]) ).
tcf(c_997,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X1,not(X0))),X1))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_456,c_66]) ).
tcf(c_1139,plain,
! [X0: $i,X1: $i] :
( theorem(X0)
| ~ theorem(X1)
| ~ theorem(or(X0,not(X1))) ),
inference(superposition,[status(thm)],[c_997,c_66]) ).
tcf(c_1188,plain,
! [X0: $i,X1: $i] :
( theorem(not(or(not(X1),not(X0))))
| ~ theorem(X1)
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_997,c_1139]) ).
tcf(c_1515,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X1,X0)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_382,c_599]) ).
tcf(c_1684,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_861,c_204]) ).
tcf(c_2131,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_101,c_66]) ).
tcf(c_4757,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_111,c_597]) ).
tcf(c_6903,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X0),X1))),
inference(superposition,[status(thm)],[c_4757,c_2131]) ).
tcf(c_9725,plain,
( ~ theorem(or(not(p),or(p,not(or(not(p),not(q))))))
| ~ theorem(or(not(or(p,not(or(not(p),not(q))))),p)) ),
inference(superposition,[status(thm)],[c_1188,c_60]) ).
tcf(c_9731,plain,
~ theorem(or(not(or(p,not(or(not(p),not(q))))),p)),
inference(forward_subsumption_resolution,[status(thm)],[c_9725,c_4757]) ).
tcf(c_12379,plain,
~ theorem(or(not(not(or(not(p),not(q)))),p)),
inference(superposition,[status(thm)],[c_1515,c_9731]) ).
tcf(c_13909,plain,
~ theorem(or(p,or(not(p),not(q)))),
inference(superposition,[status(thm)],[c_1684,c_12379]) ).
tcf(c_13910,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_13909,c_6903]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL285-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.19/5.46 % Computer : n017.cluster.edu
% 0.19/5.46 % Model : x86_64 x86_64
% 0.19/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.46 % Memory : 8046.5625MB
% 0.19/5.46 % OS : Linux 6.8.0-71-generic
% 0.19/5.46 % CPULimit : 300
% 0.19/5.46 % WCLimit : 300
% 0.19/5.46 % DateTime : Wed Sep 23 22:39:06 UTC 2026
% 0.19/5.47 % CPUTime :
% 0.19/5.47 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.23/5.53 Running first-order theorem proving
% 0.23/5.53 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.23/5.55
% 0.23/5.55 % ======== iProver multi-core TPTP/SMT =========
% 0.23/5.55
% 0.23/5.55 % Detected problem language: tptp
% 0.23/5.57 % Proving...
% 10.98/7.84 % SZS status Started for theBenchmark.p
% 10.98/7.84 % SZS status Unsatisfiable for theBenchmark.p
% 10.98/7.84
% 10.98/7.84 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.98/7.84
% 10.98/7.84 % ------ iProver source info
% 10.98/7.84
% 10.98/7.84 % git: date: 2026-07-19 20:42:38 +0200
% 10.98/7.84 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.98/7.84 % git: non_committed_changes: false
% 10.98/7.84
% 10.98/7.84 % ------ Parsing...% successful
% 10.98/7.84
% 10.98/7.84
% 10.98/7.84 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.98/7.84
% 10.98/7.84 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 10.98/7.84
% 10.98/7.84 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.98/7.84 % ------ Proving...
% 10.98/7.84 % ------ Problem Properties
% 10.98/7.84
% 10.98/7.84 %
% 10.98/7.84 % clauses 7
% 10.98/7.84 % conjectures 1
% 10.98/7.84 % EPR 0
% 10.98/7.84 % Horn 7
% 10.98/7.84 % unary 6
% 10.98/7.84 % binary 0
% 10.98/7.84 % lits 9
% 10.98/7.84 % lits eq 0
% 10.98/7.84 % fd_pure 0
% 10.98/7.84 % fd_pseudo 0
% 10.98/7.84 % fd_cond 0
% 10.98/7.84 % fd_pseudo_cond 0
% 10.98/7.84 % AC symbols 0
% 10.98/7.84
% 10.98/7.84 % ------ Schedule dynamic 5 is on
% 10.98/7.84
% 10.98/7.84 % ------ no equalities: superposition off
% 10.98/7.84
% 10.98/7.84 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.98/7.84
% 10.98/7.84
% 10.98/7.84 % ------
% 10.98/7.84 % Current options:
% 10.98/7.84 % ------
% 10.98/7.84
% 10.98/7.84
% 10.98/7.84 %
% 10.98/7.84
% 10.98/7.84 % ------ Proving...
% 10.98/7.84 %
% 10.98/7.84
% 10.98/7.84 % SZS status Unsatisfiable for theBenchmark.p
% 10.98/7.84
% 10.98/7.84 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.98/7.85
%------------------------------------------------------------------------------