%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL203-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 : n026.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 4.53s 1.31s
% Output : CNFRefutation 4.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 18 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 16 |; 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 : 52 ( 0 sgn 52 !; 0 ?; 38 :)
% 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(p,q))),or(not(p),not(q)))),
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_61,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_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(not(not(or(p,q))),or(not(p),not(q)))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_394,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_59,c_63]) ).
tcf(c_419,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[c_64,c_58]) ).
tcf(c_420,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(resolution,[status(thm)],[c_64,c_59]) ).
tcf(c_421,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_64,c_60]) ).
tcf(c_559,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c_61,c_64]) ).
tcf(c_666,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c_65,c_59]) ).
tcf(c_1086,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[status(thm)],[c_559,c_394]) ).
tcf(c_1087,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_559,c_420]) ).
tcf(c_1179,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(resolution,[status(thm)],[c_1086,c_419]) ).
tcf(c_1240,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[c_1179,c_421]) ).
tcf(c_1794,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),not(not(or(X1,X0))))),
inference(resolution,[status(thm)],[c_666,c_1240]) ).
tcf(c_3547,plain,
! [X0: $i,X1: $i] : theorem(or(not(not(or(X0,X1))),not(X1))),
inference(resolution,[status(thm)],[c_1794,c_421]) ).
tcf(c_5465,plain,
~ theorem(or(not(not(or(p,q))),not(q))),
inference(resolution,[status(thm)],[c_1087,c_66]) ).
tcf(c_5596,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5465,c_3547]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL203-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.11/0.36 % Computer : n026.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 22:22:08 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.15/0.42
% 0.15/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42
% 0.15/0.42 % Detected problem language: tptp
% 0.15/0.44 % Proving...
% 4.53/1.31 % SZS status Started for theBenchmark.p
% 4.53/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 4.53/1.31
% 4.53/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.53/1.31
% 4.53/1.31 % ------ iProver source info
% 4.53/1.31
% 4.53/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.53/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.53/1.31 % git: non_committed_changes: false
% 4.53/1.31
% 4.53/1.31 % ------ Parsing...% successful
% 4.53/1.31
% 4.53/1.31
% 4.53/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.53/1.31
% 4.53/1.31 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.53/1.31
% 4.53/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.53/1.31 % ------ Proving...
% 4.53/1.31 % ------ Problem Properties
% 4.53/1.31
% 4.53/1.31 %
% 4.53/1.31 % clauses 9
% 4.53/1.31 % conjectures 1
% 4.53/1.31 % EPR 1
% 4.53/1.31 % Horn 9
% 4.53/1.31 % unary 6
% 4.53/1.31 % binary 1
% 4.53/1.31 % lits 14
% 4.53/1.31 % lits eq 0
% 4.53/1.31 % fd_pure 0
% 4.53/1.31 % fd_pseudo 0
% 4.53/1.31 % fd_cond 0
% 4.53/1.31 % fd_pseudo_cond 0
% 4.53/1.31 % AC symbols 0
% 4.53/1.31
% 4.53/1.31 % ------ Input Options Time Limit: Unbounded
% 4.53/1.31
% 4.53/1.31
% 4.53/1.31 % ------
% 4.53/1.31 % Current options:
% 4.53/1.31 % ------
% 4.53/1.31
% 4.53/1.31
% 4.53/1.31 %
% 4.53/1.31
% 4.53/1.31 % ------ Proving...
% 4.53/1.31 %
% 4.53/1.31
% 4.53/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 4.53/1.31
% 4.53/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.53/1.31
% 4.53/1.31
%------------------------------------------------------------------------------