%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL246-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 : 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:06:09 PM UTC 2026
% Result : Unsatisfiable 18.23s 8.99s
% Output : CNFRefutation 18.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 32 unt; 0 def)
% Number of atoms : 62 ( 2 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 : 8 ( 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn 83 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
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,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,negated_conjecture,
~ theorem(implies(and(p,implies(p,q)),q)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
~ theorem(or(not(not(or(not(p),not(or(not(p),q))))),q)),
inference(definition_unfolding,[],[f10,f6,f9,f6]) ).
fof(f12,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(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,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f16,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f17,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
tcf(c_59,negated_conjecture,
~ theorem(or(not(not(or(not(p),not(or(not(p),q))))),q)),
inference(cnf_transformation,[],[f11]) ).
tcf(c_60,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,[],[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] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f14]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f15]) ).
tcf(c_64,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f16]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_66,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[status(thm)],[c_66,c_60]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c_66,c_61]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_66,c_62]) ).
tcf(c_110,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_66,c_63]) ).
tcf(c_115,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_66,c_64]) ).
tcf(c_217,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_105,c_65]) ).
tcf(c_219,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_115,c_65]) ).
tcf(c_335,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_95,c_65]) ).
tcf(c_430,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_100,c_65]) ).
tcf(c_475,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(superposition,[status(thm)],[c_105,c_430]) ).
tcf(c_476,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
inference(superposition,[status(thm)],[c_110,c_430]) ).
tcf(c_563,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_335,c_65]) ).
tcf(c_699,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_476,c_219]) ).
tcf(c_730,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_699,c_217]) ).
tcf(c_902,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_105,c_563]) ).
tcf(c_911,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_730,c_563]) ).
tcf(c_2672,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_911,c_217]) ).
tcf(c_6486,plain,
~ theorem(or(q,or(not(p),not(or(not(p),q))))),
inference(superposition,[status(thm)],[c_2672,c_59]) ).
tcf(c_21989,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(X1,not(or(X1,X0))))),
inference(superposition,[status(thm)],[c_475,c_902]) ).
tcf(c_22092,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_6486,c_21989]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL246-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/5.43 % Computer : n026.cluster.edu
% 0.17/5.43 % Model : x86_64 x86_64
% 0.17/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.43 % Memory : 8046.5625MB
% 0.17/5.43 % OS : Linux 6.8.0-71-generic
% 0.17/5.44 % CPULimit : 300
% 0.17/5.44 % WCLimit : 300
% 0.17/5.44 % DateTime : Wed Sep 23 22:36:59 UTC 2026
% 0.17/5.44 % CPUTime :
% 0.17/5.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.17/5.50 Running first-order theorem proving
% 0.17/5.50 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.20/5.51
% 0.20/5.51 % ======== iProver multi-core TPTP/SMT =========
% 0.20/5.51
% 0.20/5.51 % Detected problem language: tptp
% 0.20/5.53 % Proving...
% 18.23/8.99 % SZS status Started for theBenchmark.p
% 18.23/8.99 % SZS status Unsatisfiable for theBenchmark.p
% 18.23/8.99
% 18.23/8.99 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 18.23/8.99
% 18.23/8.99 % ------ iProver source info
% 18.23/8.99
% 18.23/8.99 % git: date: 2026-07-19 20:42:38 +0200
% 18.23/8.99 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 18.23/8.99 % git: non_committed_changes: false
% 18.23/8.99
% 18.23/8.99 % ------ Parsing...% successful
% 18.23/8.99
% 18.23/8.99
% 18.23/8.99 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 18.23/8.99
% 18.23/8.99 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 18.23/8.99
% 18.23/8.99 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 18.23/8.99 % ------ Proving...
% 18.23/8.99 % ------ Problem Properties
% 18.23/8.99
% 18.23/8.99 %
% 18.23/8.99 % clauses 7
% 18.23/8.99 % conjectures 1
% 18.23/8.99 % EPR 0
% 18.23/8.99 % Horn 7
% 18.23/8.99 % unary 6
% 18.23/8.99 % binary 0
% 18.23/8.99 % lits 9
% 18.23/8.99 % lits eq 0
% 18.23/8.99 % fd_pure 0
% 18.23/8.99 % fd_pseudo 0
% 18.23/8.99 % fd_cond 0
% 18.23/8.99 % fd_pseudo_cond 0
% 18.23/8.99 % AC symbols 0
% 18.23/8.99
% 18.23/8.99 % ------ Schedule dynamic 5 is on
% 18.23/8.99
% 18.23/8.99 % ------ no equalities: superposition off
% 18.23/8.99
% 18.23/8.99 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 18.23/8.99
% 18.23/8.99
% 18.23/8.99 % ------
% 18.23/8.99 % Current options:
% 18.23/8.99 % ------
% 18.23/8.99
% 18.23/8.99
% 18.23/8.99 %
% 18.23/8.99
% 18.23/8.99 % ------ Proving...
% 18.23/8.99 %
% 18.23/8.99
% 18.23/8.99 % SZS status Unsatisfiable for theBenchmark.p
% 18.23/8.99
% 18.23/8.99 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 18.23/8.99
% 18.23/8.99
%------------------------------------------------------------------------------