%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL205-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 : 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:59 PM UTC 2026
% Result : Unsatisfiable 4.39s 6.21s
% Output : CNFRefutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 32 unt; 0 def)
% Number of atoms : 78 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 31 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 100 !; 0 ?; 71 :)
% 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,negated_conjecture,
~ theorem(implies(not(implies(p,q)),implies(p,not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
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,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(not(or(not(p),q))),or(not(p),not(q)))),
inference(definition_unfolding,[],[f9,f6,f6,f6]) ).
tcf(c_58,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f11]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f12]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f13]) ).
tcf(c_62,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_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_65,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(p),not(q)))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_94,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_63,c_58]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_63,c_59]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_63,c_60]) ).
tcf(c_109,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_61]) ).
tcf(c_114,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_63,c_62]) ).
tcf(c_274,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_99,c_64]) ).
tcf(c_314,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_104,c_64]) ).
tcf(c_334,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_109,c_64]) ).
tcf(c_335,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(or(X0,or(X1,X2)),not(or(X1,or(X0,X2))))),
inference(superposition,[status(thm)],[c_109,c_314]) ).
tcf(c_344,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
inference(superposition,[status(thm)],[c_99,c_334]) ).
tcf(c_345,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(superposition,[status(thm)],[c_104,c_334]) ).
tcf(c_347,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_274,c_334]) ).
tcf(c_426,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X1,not(X0))),X1))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_345,c_64]) ).
tcf(c_434,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,X1))
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_347,c_64]) ).
tcf(c_652,plain,
! [X0: $i,X1: $i] :
( theorem(X0)
| ~ theorem(X1)
| ~ theorem(or(X0,not(X1))) ),
inference(superposition,[status(thm)],[c_426,c_64]) ).
tcf(c_684,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_335,c_652]) ).
tcf(c_822,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,or(X1,X0)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_104,c_434]) ).
tcf(c_1461,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_114,c_64]) ).
tcf(c_1640,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X2,X0)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_822,c_684]) ).
tcf(c_1854,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_94,c_64]) ).
tcf(c_1876,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_344,c_1854]) ).
tcf(c_1893,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_104,c_64]) ).
tcf(c_1905,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_1876,c_1893]) ).
tcf(c_3435,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_1461,c_64]) ).
tcf(c_3728,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_1905,c_3435]) ).
tcf(c_7710,plain,
~ theorem(or(not(q),not(not(or(not(p),q))))),
inference(superposition,[status(thm)],[c_1640,c_65]) ).
tcf(c_7738,plain,
~ theorem(or(not(q),or(not(p),q))),
inference(superposition,[status(thm)],[c_3728,c_7710]) ).
tcf(c_7742,plain,
$false,
inference(superposition,[status(thm)],[c_99,c_7738]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL205-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/5.39 % Computer : n009.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:20:03 UTC 2026
% 0.12/5.40 % CPUTime :
% 0.12/5.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.44 Running first-order theorem proving
% 0.16/5.44 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.16/5.45
% 0.16/5.45 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.45
% 0.16/5.45 % Detected problem language: tptp
% 0.16/5.46 % Proving...
% 4.39/6.21 % SZS status Started for theBenchmark.p
% 4.39/6.21 % SZS status Unsatisfiable for theBenchmark.p
% 4.39/6.21
% 4.39/6.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.39/6.21
% 4.39/6.21 % ------ iProver source info
% 4.39/6.21
% 4.39/6.21 % git: date: 2026-07-19 20:42:38 +0200
% 4.39/6.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.39/6.21 % git: non_committed_changes: false
% 4.39/6.21
% 4.39/6.21 % ------ Parsing...% successful
% 4.39/6.21
% 4.39/6.21
% 4.39/6.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.39/6.21
% 4.39/6.21 % ------ 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 %
% 4.39/6.21
% 4.39/6.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.39/6.21 % ------ Proving...
% 4.39/6.21 % ------ Problem Properties
% 4.39/6.21
% 4.39/6.21 %
% 4.39/6.21 % clauses 7
% 4.39/6.21 % conjectures 1
% 4.39/6.21 % EPR 0
% 4.39/6.21 % Horn 7
% 4.39/6.21 % unary 6
% 4.39/6.21 % binary 0
% 4.39/6.21 % lits 9
% 4.39/6.21 % lits eq 0
% 4.39/6.21 % fd_pure 0
% 4.39/6.21 % fd_pseudo 0
% 4.39/6.21 % fd_cond 0
% 4.39/6.21 % fd_pseudo_cond 0
% 4.39/6.21 % AC symbols 0
% 4.39/6.21
% 4.39/6.21 % ------ Input Options Time Limit: Unbounded
% 4.39/6.21
% 4.39/6.21
% 4.39/6.21 % ------
% 4.39/6.21 % Current options:
% 4.39/6.21 % ------
% 4.39/6.21
% 4.39/6.21
% 4.39/6.21 %
% 4.39/6.21
% 4.39/6.21 % ------ Proving...
% 4.39/6.21 %
% 4.39/6.21
% 4.39/6.21 % SZS status Unsatisfiable for theBenchmark.p
% 4.39/6.21
% 4.39/6.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.39/6.21
% 4.39/6.21
%------------------------------------------------------------------------------