%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL306-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.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:18 PM UTC 2026
% Result : Unsatisfiable 6.29s 1.73s
% Output : CNFRefutation 6.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 35 unt; 0 def)
% Number of atoms : 70 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 27 ~; 20 |; 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 88 !; 0 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(implies(not(p),equivalent(q,or(p,q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
~ theorem(or(not(not(p)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),
inference(definition_unfolding,[],[f11,f6,f12]) ).
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,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f16,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f17,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f18,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f19,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
tcf(c_60,negated_conjecture,
~ theorem(or(not(not(p)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),
inference(cnf_transformation,[],[f13]) ).
tcf(c_61,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_62,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f15]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f17]) ).
tcf(c_65,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f18]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_67,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_96,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_67,c_61]) ).
tcf(c_101,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_67,c_62]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_67,c_63]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_67,c_64]) ).
tcf(c_116,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_67,c_65]) ).
tcf(c_218,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_106,c_66]) ).
tcf(c_220,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_116,c_66]) ).
tcf(c_336,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_96,c_66]) ).
tcf(c_431,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_101,c_66]) ).
tcf(c_477,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
inference(superposition,[status(thm)],[c_111,c_431]) ).
tcf(c_564,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_336,c_66]) ).
tcf(c_566,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_336,c_431]) ).
tcf(c_700,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_477,c_220]) ).
tcf(c_731,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_700,c_218]) ).
tcf(c_732,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(X0,X1)),X1))),
inference(superposition,[status(thm)],[c_700,c_431]) ).
tcf(c_1753,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_731,c_564]) ).
tcf(c_3379,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_1753,c_218]) ).
tcf(c_4886,plain,
~ theorem(or(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))),p)),
inference(superposition,[status(thm)],[c_3379,c_60]) ).
tcf(c_11477,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(not(X2),X0)),X1))
| ~ theorem(X2)
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_566,c_66]) ).
tcf(c_11522,plain,
( ~ theorem(or(not(q),or(p,q)))
| ~ theorem(or(not(not(or(not(or(p,q)),q))),p)) ),
inference(superposition,[status(thm)],[c_11477,c_4886]) ).
tcf(c_11552,plain,
~ theorem(or(not(not(or(not(or(p,q)),q))),p)),
inference(forward_subsumption_resolution,[status(thm)],[c_11522,c_111]) ).
tcf(c_12879,plain,
~ theorem(or(p,or(not(or(p,q)),q))),
inference(superposition,[status(thm)],[c_3379,c_11552]) ).
tcf(c_12880,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12879,c_732]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL306-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n004.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:47:20 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.43 % Proving...
% 6.29/1.73 % SZS status Started for theBenchmark.p
% 6.29/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 6.29/1.73
% 6.29/1.73 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.29/1.73
% 6.29/1.73 % ------ iProver source info
% 6.29/1.73
% 6.29/1.73 % git: date: 2026-07-19 20:42:38 +0200
% 6.29/1.73 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.29/1.73 % git: non_committed_changes: false
% 6.29/1.73
% 6.29/1.73 % ------ Parsing...% successful
% 6.29/1.73
% 6.29/1.73
% 6.29/1.73 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.29/1.73
% 6.29/1.73 % ------ 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 %
% 6.29/1.73
% 6.29/1.73 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 6.29/1.73 % ------ Proving...
% 6.29/1.73 % ------ Problem Properties
% 6.29/1.73
% 6.29/1.73 %
% 6.29/1.73 % clauses 7
% 6.29/1.73 % conjectures 1
% 6.29/1.73 % EPR 0
% 6.29/1.73 % Horn 7
% 6.29/1.73 % unary 6
% 6.29/1.73 % binary 0
% 6.29/1.73 % lits 9
% 6.29/1.73 % lits eq 0
% 6.29/1.73 % fd_pure 0
% 6.29/1.73 % fd_pseudo 0
% 6.29/1.73 % fd_cond 0
% 6.29/1.73 % fd_pseudo_cond 0
% 6.29/1.73 % AC symbols 0
% 6.29/1.73
% 6.29/1.73 % ------ Schedule dynamic 5 is on
% 6.29/1.73
% 6.29/1.73 % ------ no equalities: superposition off
% 6.29/1.73
% 6.29/1.73 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.29/1.73
% 6.29/1.73
% 6.29/1.73 % ------
% 6.29/1.73 % Current options:
% 6.29/1.73 % ------
% 6.29/1.73
% 6.29/1.73
% 6.29/1.73 %
% 6.29/1.73
% 6.29/1.73 % ------ Proving...
% 6.29/1.73 %
% 6.29/1.73
% 6.29/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 6.29/1.73
% 6.29/1.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.29/1.73
% 6.29/1.73
%------------------------------------------------------------------------------