%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL202-1 : TPTP v9.3.1. Released v1.1.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:05:58 PM UTC 2026
% Result : Unsatisfiable 1.94s 11.94s
% Output : CNFRefutation 1.94s
% 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 : 5 ( 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/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
fof(f6,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
fof(f9,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(p,not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tcf(c_58,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(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_351,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(superposition,[status(thm)],[c_63,c_66]) ).
tcf(c_419,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_62,c_65]) ).
tcf(c_420,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_61,c_65]) ).
tcf(c_507,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_560,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(X0),X1))
| ~ axiom(or(not(X0),or(X1,X1))) ),
inference(superposition,[status(thm)],[c_351,c_64]) ).
tcf(c_1004,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_419,c_507]) ).
tcf(c_1226,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_62,c_560]) ).
tcf(c_1299,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_1226,c_420]) ).
tcf(c_1437,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(X0),not(not(X1))))
| ~ axiom(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_1299,c_64]) ).
tcf(c_2532,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(not(X1)),not(X0)))
| ~ axiom(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_1437,c_420]) ).
tcf(c_2643,plain,
~ theorem(or(not(not(or(p,q))),not(q))),
inference(superposition,[status(thm)],[c_1004,c_58]) ).
tcf(c_6617,plain,
~ axiom(or(not(q),or(p,q))),
inference(superposition,[status(thm)],[c_2532,c_2643]) ).
tcf(c_6618,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6617,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL202-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/11.02 % Computer : n017.cluster.edu
% 0.12/11.02 % Model : x86_64 x86_64
% 0.12/11.02 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/11.02 % Memory : 8046.5625MB
% 0.12/11.02 % OS : Linux 6.8.0-71-generic
% 0.12/11.02 % CPULimit : 300
% 0.12/11.02 % WCLimit : 300
% 0.12/11.02 % DateTime : Wed Sep 23 22:14:44 UTC 2026
% 0.12/11.02 % CPUTime :
% 0.12/11.02 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/11.06 Running first-order theorem proving
% 0.15/11.06 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.15/11.07
% 0.15/11.07 % ======== iProver multi-core TPTP/SMT =========
% 0.15/11.07
% 0.15/11.07 % Detected problem language: tptp
% 0.15/11.08 % Proving...
% 1.94/11.94 % SZS status Started for theBenchmark.p
% 1.94/11.94 % SZS status Unsatisfiable for theBenchmark.p
% 1.94/11.94
% 1.94/11.94 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.94/11.94
% 1.94/11.94 % ------ iProver source info
% 1.94/11.94
% 1.94/11.94 % git: date: 2026-07-19 20:42:38 +0200
% 1.94/11.94 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.94/11.94 % git: non_committed_changes: false
% 1.94/11.94
% 1.94/11.94 % ------ Parsing...% successful
% 1.94/11.94
% 1.94/11.94
% 1.94/11.94 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.94/11.94
% 1.94/11.94 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.94/11.94
% 1.94/11.94 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.94/11.94 % ------ Proving...
% 1.94/11.94 % ------ Problem Properties
% 1.94/11.94
% 1.94/11.94 %
% 1.94/11.94 % clauses 9
% 1.94/11.94 % conjectures 1
% 1.94/11.94 % EPR 1
% 1.94/11.94 % Horn 9
% 1.94/11.94 % unary 6
% 1.94/11.94 % binary 1
% 1.94/11.94 % lits 14
% 1.94/11.94 % lits eq 0
% 1.94/11.94 % fd_pure 0
% 1.94/11.94 % fd_pseudo 0
% 1.94/11.94 % fd_cond 0
% 1.94/11.94 % fd_pseudo_cond 0
% 1.94/11.94 % AC symbols 0
% 1.94/11.94
% 1.94/11.94 % ------ Schedule dynamic 5 is on
% 1.94/11.94
% 1.94/11.94 % ------ no equalities: superposition off
% 1.94/11.94
% 1.94/11.94 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.94/11.94
% 1.94/11.94
% 1.94/11.94 % ------
% 1.94/11.94 % Current options:
% 1.94/11.94 % ------
% 1.94/11.94
% 1.94/11.94
% 1.94/11.94 %
% 1.94/11.94
% 1.94/11.94 % ------ Proving...
% 1.94/11.94 %
% 1.94/11.94
% 1.94/11.94 % SZS status Unsatisfiable for theBenchmark.p
% 1.94/11.94
% 1.94/11.94 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.94/11.94
% 1.94/11.94
%------------------------------------------------------------------------------