%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL218-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.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:02 PM UTC 2026
% Result : Unsatisfiable 1.62s 1.20s
% Output : CNFRefutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 24 unt; 0 def)
% Number of atoms : 48 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 18 ~; 14 |; 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 70 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(implies(or(p,q),q),implies(p,q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f15,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
inference(definition_unfolding,[],[f9,f6,f6,f6]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f11]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f12]) ).
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,[],[f13]) ).
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,[],[f14]) ).
tcf(c_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_65,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(superposition,[status(thm)],[c_59,c_63]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_60,c_63]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(superposition,[status(thm)],[c_61,c_63]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(superposition,[status(thm)],[c_62,c_63]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_86,c_64]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_88,c_64]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(superposition,[status(thm)],[c_88,c_97]) ).
tcf(c_159,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,X1))
| ~ theorem(or(X2,X0))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_99,c_64]) ).
tcf(c_242,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(not(X1),X2)),or(X0,X2)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_144,c_64]) ).
tcf(c_267,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_78,c_159]) ).
tcf(c_515,plain,
~ theorem(or(not(p),or(p,q))),
inference(superposition,[status(thm)],[c_242,c_65]) ).
tcf(c_714,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_74,c_267]) ).
tcf(c_5542,plain,
$false,
inference(superposition,[status(thm)],[c_714,c_515]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL218-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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:24:29 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 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.43 % Detected problem language: tptp
% 0.15/0.44 % Proving...
% 1.62/1.20 % SZS status Started for theBenchmark.p
% 1.62/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 1.62/1.20
% 1.62/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.62/1.20
% 1.62/1.20 % ------ iProver source info
% 1.62/1.20
% 1.62/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 1.62/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.62/1.20 % git: non_committed_changes: false
% 1.62/1.20
% 1.62/1.20 % ------ Parsing...% successful
% 1.62/1.20
% 1.62/1.20
% 1.62/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.62/1.20 % ------ Proving...
% 1.62/1.20 % ------ Problem Properties
% 1.62/1.20
% 1.62/1.20 %
% 1.62/1.20 % clauses 8
% 1.62/1.20 % conjectures 1
% 1.62/1.20 % EPR 1
% 1.62/1.20 % Horn 8
% 1.62/1.20 % unary 6
% 1.62/1.20 % binary 1
% 1.62/1.20 % lits 11
% 1.62/1.20 % lits eq 0
% 1.62/1.20 % fd_pure 0
% 1.62/1.20 % fd_pseudo 0
% 1.62/1.20 % fd_cond 0
% 1.62/1.20 % fd_pseudo_cond 0
% 1.62/1.20 % AC symbols 0
% 1.62/1.20
% 1.62/1.20 % ------ Input Options Time Limit: Unbounded
% 1.62/1.20
% 1.62/1.20
% 1.62/1.20 % ------
% 1.62/1.20 % Current options:
% 1.62/1.20 % ------
% 1.62/1.20
% 1.62/1.20
% 1.62/1.20 %
% 1.62/1.20
% 1.62/1.20 % ------ Proving...
% 1.62/1.20 %
% 1.62/1.20
% 1.62/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 1.62/1.20
% 1.62/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.62/1.20
% 1.62/1.20
%------------------------------------------------------------------------------