%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL206-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n020.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.05s 1.19s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 16 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 21 ~; 17 |; 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 : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 47 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
fof(f6,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
fof(f9,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),not(q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tcf(c_58,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),not(q)))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_63,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X2),X1))
| ~ axiom(or(not(X2),X0))
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ axiom(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_327,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(superposition,[status(thm)],[c_63,c_66]) ).
tcf(c_392,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_62,c_65]) ).
tcf(c_393,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_61,c_65]) ).
tcf(c_440,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_60,c_65]) ).
tcf(c_554,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(X0),X1))
| ~ axiom(or(not(X0),or(X1,X1))) ),
inference(superposition,[status(thm)],[c_327,c_64]) ).
tcf(c_1016,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_392,c_440]) ).
tcf(c_1229,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_62,c_554]) ).
tcf(c_1323,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_1229,c_393]) ).
tcf(c_1512,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(X0),not(not(X1))))
| ~ axiom(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_1323,c_64]) ).
tcf(c_2673,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(not(X1)),not(X0)))
| ~ axiom(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_1512,c_393]) ).
tcf(c_2742,plain,
~ theorem(or(not(not(or(not(p),q))),not(q))),
inference(superposition,[status(thm)],[c_1016,c_58]) ).
tcf(c_7102,plain,
~ axiom(or(not(q),or(not(p),q))),
inference(superposition,[status(thm)],[c_2673,c_2742]) ).
tcf(c_7103,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7102,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL206-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n020.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 22:21:18 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 4.05/1.19 % SZS status Started for theBenchmark.p
% 4.05/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 4.05/1.19
% 4.05/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.05/1.19
% 4.05/1.19 % ------ iProver source info
% 4.05/1.19
% 4.05/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 4.05/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.05/1.19 % git: non_committed_changes: false
% 4.05/1.19
% 4.05/1.19 % ------ Parsing...% successful
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.05/1.19
% 4.05/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.05/1.19
% 4.05/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.05/1.19 % ------ Proving...
% 4.05/1.19 % ------ Problem Properties
% 4.05/1.19
% 4.05/1.19 %
% 4.05/1.19 % clauses 9
% 4.05/1.19 % conjectures 1
% 4.05/1.19 % EPR 1
% 4.05/1.19 % Horn 9
% 4.05/1.19 % unary 6
% 4.05/1.19 % binary 1
% 4.05/1.19 % lits 14
% 4.05/1.19 % lits eq 0
% 4.05/1.19 % fd_pure 0
% 4.05/1.19 % fd_pseudo 0
% 4.05/1.19 % fd_cond 0
% 4.05/1.19 % fd_pseudo_cond 0
% 4.05/1.19 % AC symbols 0
% 4.05/1.19
% 4.05/1.19 % ------ Schedule dynamic 5 is on
% 4.05/1.19
% 4.05/1.19 % ------ no equalities: superposition off
% 4.05/1.19
% 4.05/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19 % ------
% 4.05/1.19 % Current options:
% 4.05/1.19 % ------
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19 %
% 4.05/1.19
% 4.05/1.19 % ------ Proving...
% 4.05/1.19 %
% 4.05/1.19
% 4.05/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 4.05/1.19
% 4.05/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.05/1.19
% 4.05/1.19
%------------------------------------------------------------------------------