%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL225-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:06:04 PM UTC 2026
% Result : Unsatisfiable 39.89s 11.26s
% Output : CNFRefutation 39.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 20 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 96 !; 0 ?; 79 :)
% 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(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
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(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
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_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,[],[f5]) ).
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(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_126,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_60,c_63]) ).
tcf(c_136,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[c_64,c_58]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(resolution,[status(thm)],[c_64,c_59]) ).
tcf(c_140,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_64,c_60]) ).
tcf(c_179,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_225,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[c_62,c_64]) ).
tcf(c_243,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_245,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X1,X0)),X2))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c_65,c_60]) ).
tcf(c_246,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(or(X1,or(X0,X2))),X3))
| ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
inference(resolution,[status(thm)],[c_65,c_61]) ).
tcf(c_247,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(or(not(or(X0,X1)),or(X0,X2))),X3)) ),
inference(resolution,[status(thm)],[c_65,c_62]) ).
tcf(c_413,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_179,c_138]) ).
tcf(c_1103,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(or(X0,or(X3,X1))),or(X3,X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c_246,c_225]) ).
tcf(c_1220,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(or(not(X3),X1)),or(not(or(X0,X3)),X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c_247,c_225]) ).
tcf(c_1378,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,X1))
| ~ theorem(or(or(X0,X1),X1)) ),
inference(resolution,[status(thm)],[c_413,c_136]) ).
tcf(c_5576,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(or(X3,X1)),or(X3,X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c_1103,c_243]) ).
tcf(c_6431,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( theorem(or(not(or(X1,or(not(X4),X2))),or(not(or(X0,X4)),X3)))
| ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
inference(resolution,[status(thm)],[c_1220,c_246]) ).
tcf(c_18066,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,X1)),or(X0,or(X1,X2)))),
inference(resolution,[status(thm)],[c_5576,c_126]) ).
tcf(c_19093,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(X0,or(not(or(X0,X1)),or(X1,X2)))),
inference(resolution,[status(thm)],[c_18066,c_179]) ).
tcf(c_19475,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(or(not(or(X0,X1)),or(X1,X2)),X0)),
inference(resolution,[status(thm)],[c_19093,c_140]) ).
tcf(c_19996,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(or(X0,X1),X0)),or(X0,X1))),
inference(resolution,[status(thm)],[c_19475,c_1378]) ).
tcf(c_21429,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,or(X0,X1))),or(X0,X1))),
inference(resolution,[status(thm)],[c_19996,c_245]) ).
tcf(c_43329,plain,
~ theorem(or(not(or(not(p),or(not(p),r))),or(not(p),r))),
inference(resolution,[status(thm)],[c_6431,c_66]) ).
tcf(c_44006,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_43329,c_21429]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL225-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 : n020.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:28:33 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.11/0.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 39.89/11.26 % SZS status Started for theBenchmark.p
% 39.89/11.26 % SZS status Unsatisfiable for theBenchmark.p
% 39.89/11.26
% 39.89/11.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 39.89/11.26
% 39.89/11.26 % ------ iProver source info
% 39.89/11.26
% 39.89/11.26 % git: date: 2026-07-19 20:42:38 +0200
% 39.89/11.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 39.89/11.26 % git: non_committed_changes: false
% 39.89/11.26
% 39.89/11.26 % ------ Parsing...% successful
% 39.89/11.26
% 39.89/11.26
% 39.89/11.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 39.89/11.26
% 39.89/11.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 39.89/11.26
% 39.89/11.26 % ------ Preprocessing...
% 39.89/11.26 % ------ Proving...
% 39.89/11.26 % ------ Problem Properties
% 39.89/11.26
% 39.89/11.26 %
% 39.89/11.26 % clauses 9
% 39.89/11.26 % conjectures 1
% 39.89/11.26 % EPR 1
% 39.89/11.26 % Horn 9
% 39.89/11.26 % unary 6
% 39.89/11.26 % binary 1
% 39.89/11.26 % lits 14
% 39.89/11.26 % lits eq 0
% 39.89/11.26 % fd_pure 0
% 39.89/11.26 % fd_pseudo 0
% 39.89/11.26 % fd_cond 0
% 39.89/11.26 % fd_pseudo_cond 0
% 39.89/11.26 % AC symbols 0
% 39.89/11.26
% 39.89/11.26 % ------ Input Options Time Limit: Unbounded
% 39.89/11.26
% 39.89/11.26
% 39.89/11.26 % ------
% 39.89/11.26 % Current options:
% 39.89/11.26 % ------
% 39.89/11.26
% 39.89/11.26
% 39.89/11.26 %
% 39.89/11.26
% 39.89/11.26 % ------ Proving...
% 39.89/11.26 %
% 39.89/11.26
% 39.89/11.26 % SZS status Unsatisfiable for theBenchmark.p
% 39.89/11.26
% 39.89/11.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 39.89/11.26
% 39.89/11.26
%------------------------------------------------------------------------------