%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL177-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 : n007.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:51 PM UTC 2026
% Result : Unsatisfiable 1.70s 1.28s
% Output : CNFRefutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 18 |; 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 22 :)
% 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(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(p,not(p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tcf(c_58,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ axiom(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,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_66,negated_conjecture,
~ theorem(or(p,not(p))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_101,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_58,c_63]) ).
tcf(c_102,plain,
theorem(or(not(or(p,p)),p)),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c_59,c_65]) ).
tcf(c_135,plain,
( theorem(or(not(p),p))
| ~ theorem(or(not(or(p,p)),p)) ),
inference(instantiation,[status(thm)],[c_134]) ).
tcf(c_488,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(X2)
| ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(or(not(X0),X1)),X2)) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_526,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,not(X0)))
| ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(or(not(X0),X1)),or(X1,not(X0)))) ),
inference(instantiation,[status(thm)],[c_488]) ).
tcf(c_527,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(not(X0),X1)),or(X1,not(X0)))),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_528,plain,
( theorem(or(p,not(p)))
| ~ theorem(or(not(p),p))
| ~ axiom(or(not(or(not(p),p)),or(p,not(p)))) ),
inference(instantiation,[status(thm)],[c_526]) ).
tcf(c_529,plain,
axiom(or(not(or(not(p),p)),or(p,not(p)))),
inference(instantiation,[status(thm)],[c_527]) ).
tcf(c_530,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_529,c_528,c_135,c_102,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL177-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.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 22:08:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 1.70/1.28 % SZS status Started for theBenchmark.p
% 1.70/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.70/1.28
% 1.70/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.70/1.28
% 1.70/1.28 % ------ iProver source info
% 1.70/1.28
% 1.70/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.70/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.70/1.28 % git: non_committed_changes: false
% 1.70/1.28
% 1.70/1.28 % ------ Parsing...% successful
% 1.70/1.28
% 1.70/1.28
% 1.70/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.70/1.28
% 1.70/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.70/1.28
% 1.70/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.70/1.28
% 1.70/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.70/1.28 % ------ Proving...
% 1.70/1.28 % ------ Problem Properties
% 1.70/1.28
% 1.70/1.28 %
% 1.70/1.28 % clauses 11
% 1.70/1.28 % conjectures 1
% 1.70/1.28 % EPR 2
% 1.70/1.28 % Horn 11
% 1.70/1.28 % unary 8
% 1.70/1.28 % binary 1
% 1.70/1.28 % lits 16
% 1.70/1.28 % lits eq 2
% 1.70/1.28 % fd_pure 0
% 1.70/1.28 % fd_pseudo 0
% 1.70/1.28 % fd_cond 0
% 1.70/1.28 % fd_pseudo_cond 0
% 1.70/1.28 % AC symbols 0
% 1.70/1.28
% 1.70/1.28 % ------ Schedule dynamic 5 is on
% 1.70/1.28
% 1.70/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.70/1.28
% 1.70/1.28
% 1.70/1.28 % ------
% 1.70/1.28 % Current options:
% 1.70/1.28 % ------
% 1.70/1.28
% 1.70/1.28
% 1.70/1.28 %
% 1.70/1.28
% 1.70/1.28 % ------ Proving...
% 1.70/1.28 %
% 1.70/1.28
% 1.70/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.70/1.28
% 1.70/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.70/1.28
% 1.70/1.28
%------------------------------------------------------------------------------