%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL320-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 : n010.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:20 PM UTC 2026
% Result : Unsatisfiable 6.10s 2.44s
% Output : CNFRefutation 6.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 39 unt; 5 def)
% Number of atoms : 142 ( 6 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 57 ( 33 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 76 !; 0 ?; 49 :)
% 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(or(implies(p,q),implies(not(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(or(not(p),q),or(not(not(p)),q))),
inference(definition_unfolding,[],[f9,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(or(not(p),q),or(not(not(p)),q))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_63,c_59]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_63,c_60]) ).
tcf(c_109,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_63,c_61]) ).
tcf(c_114,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_63,c_62]) ).
tcf(c_142,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_143,definition,
iPr_def_11 = or(iPr_def_10,q),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_144,definition,
iPr_def_12 = not(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_145,definition,
iPr_def_13 = or(iPr_def_12,q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_146,definition,
iPr_def_14 = or(iPr_def_11,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_147,negated_conjecture,
~ theorem(iPr_def_14),
inference(demodulation,[status(thm)],[c_65,c_144,c_145,c_142,c_143,c_146]) ).
tcf(c_265,plain,
! [X0: $i] : theorem(or(iPr_def_12,or(X0,iPr_def_10))),
inference(superposition,[status(thm)],[c_144,c_99]) ).
tcf(c_274,plain,
theorem(or(not(or(q,iPr_def_10)),iPr_def_11)),
inference(superposition,[status(thm)],[c_143,c_104]) ).
tcf(c_275,plain,
theorem(or(not(or(q,iPr_def_12)),iPr_def_13)),
inference(superposition,[status(thm)],[c_145,c_104]) ).
tcf(c_281,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_99,c_64]) ).
tcf(c_282,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_104,c_64]) ).
tcf(c_334,plain,
! [X0: $i] : theorem(or(not(or(X0,iPr_def_11)),or(iPr_def_10,or(X0,q)))),
inference(superposition,[status(thm)],[c_143,c_109]) ).
tcf(c_335,plain,
! [X0: $i] : theorem(or(not(or(X0,iPr_def_13)),or(iPr_def_12,or(X0,q)))),
inference(superposition,[status(thm)],[c_145,c_109]) ).
tcf(c_340,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_109,c_64]) ).
tcf(c_464,plain,
! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_13)),or(not(or(iPr_def_11,X0)),iPr_def_14))),
inference(superposition,[status(thm)],[c_146,c_114]) ).
tcf(c_465,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_114,c_64]) ).
tcf(c_516,plain,
theorem(or(not(or(iPr_def_12,iPr_def_11)),or(iPr_def_10,iPr_def_13))),
inference(superposition,[status(thm)],[c_145,c_334]) ).
tcf(c_566,plain,
( theorem(or(iPr_def_10,iPr_def_13))
| ~ theorem(or(iPr_def_12,iPr_def_11)) ),
inference(superposition,[status(thm)],[c_516,c_64]) ).
tcf(c_573,plain,
! [X0: $i] :
( theorem(or(iPr_def_12,or(X0,q)))
| ~ theorem(or(X0,iPr_def_13)) ),
inference(superposition,[status(thm)],[c_335,c_64]) ).
tcf(c_750,plain,
! [X0: $i] :
( theorem(or(or(X0,q),iPr_def_12))
| ~ theorem(or(X0,iPr_def_13)) ),
inference(superposition,[status(thm)],[c_573,c_282]) ).
tcf(c_824,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_281,c_340]) ).
tcf(c_1657,plain,
! [X0: $i] :
( theorem(or(not(or(iPr_def_11,X0)),iPr_def_14))
| ~ theorem(or(not(X0),iPr_def_13)) ),
inference(superposition,[status(thm)],[c_464,c_64]) ).
tcf(c_1883,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_465,c_64]) ).
tcf(c_1937,plain,
! [X0: $i] :
( theorem(iPr_def_14)
| ~ theorem(or(iPr_def_11,X0))
| ~ theorem(or(not(X0),iPr_def_13)) ),
inference(superposition,[status(thm)],[c_1657,c_64]) ).
tcf(c_1941,plain,
! [X0: $i] :
( ~ theorem(or(iPr_def_11,X0))
| ~ theorem(or(not(X0),iPr_def_13)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1937,c_147]) ).
tcf(c_1966,plain,
~ theorem(or(iPr_def_11,or(q,iPr_def_12))),
inference(superposition,[status(thm)],[c_275,c_1941]) ).
tcf(c_2367,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_11))
| ~ theorem(or(X0,or(q,iPr_def_10))) ),
inference(superposition,[status(thm)],[c_274,c_1883]) ).
tcf(c_3587,plain,
( theorem(or(iPr_def_11,iPr_def_12))
| ~ theorem(or(iPr_def_10,iPr_def_13)) ),
inference(superposition,[status(thm)],[c_143,c_750]) ).
tcf(c_5073,plain,
~ theorem(or(iPr_def_11,iPr_def_12)),
inference(superposition,[status(thm)],[c_824,c_1966]) ).
tcf(c_5130,plain,
~ theorem(or(iPr_def_10,iPr_def_13)),
inference(backward_subsumption_resolution,[status(thm)],[c_3587,c_5073]) ).
tcf(c_5131,plain,
~ theorem(or(iPr_def_12,iPr_def_11)),
inference(backward_subsumption_resolution,[status(thm)],[c_566,c_5130]) ).
tcf(c_8604,plain,
theorem(or(iPr_def_12,iPr_def_11)),
inference(superposition,[status(thm)],[c_265,c_2367]) ).
tcf(c_8642,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8604,c_5131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL320-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.18/0.42 % Computer : n010.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.42 % CPULimit : 300
% 0.18/0.42 % WCLimit : 300
% 0.18/0.42 % DateTime : Wed Sep 23 22:50:27 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 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.18/0.50
% 0.18/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.18/0.50
% 0.18/0.50 % Detected problem language: tptp
% 0.24/0.52 % Proving...
% 6.10/2.44 % SZS status Started for theBenchmark.p
% 6.10/2.44 % SZS status Unsatisfiable for theBenchmark.p
% 6.10/2.44
% 6.10/2.44 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.10/2.44
% 6.10/2.44 % ------ iProver source info
% 6.10/2.44
% 6.10/2.44 % git: date: 2026-07-19 20:42:38 +0200
% 6.10/2.44 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.10/2.44 % git: non_committed_changes: false
% 6.10/2.44
% 6.10/2.44 % ------ Parsing...% successful
% 6.10/2.44
% 6.10/2.44
% 6.10/2.44 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.10/2.44
% 6.10/2.44 % ------ 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.10/2.44
% 6.10/2.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.10/2.44
% 6.10/2.44 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.10/2.44 % ------ Proving...
% 6.10/2.44 % ------ Problem Properties
% 6.10/2.44
% 6.10/2.44 %
% 6.10/2.44 % clauses 12
% 6.10/2.44 % conjectures 1
% 6.10/2.44 % EPR 1
% 6.10/2.44 % Horn 12
% 6.10/2.44 % unary 11
% 6.10/2.44 % binary 0
% 6.10/2.44 % lits 14
% 6.10/2.44 % lits eq 5
% 6.10/2.44 % fd_pure 0
% 6.10/2.44 % fd_pseudo 0
% 6.10/2.44 % fd_cond 0
% 6.10/2.44 % fd_pseudo_cond 0
% 6.10/2.44 % AC symbols 0
% 6.10/2.44
% 6.10/2.44 % ------ Schedule dynamic 5 is on
% 6.10/2.44
% 6.10/2.44 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.10/2.44
% 6.10/2.44
% 6.10/2.44 % ------
% 6.10/2.44 % Current options:
% 6.10/2.44 % ------
% 6.10/2.44
% 6.10/2.44
% 6.10/2.44 %
% 6.10/2.44
% 6.10/2.44 % ------ Proving...
% 6.10/2.44 %
% 6.10/2.44
% 6.10/2.44 % SZS status Unsatisfiable for theBenchmark.p
% 6.10/2.44
% 6.10/2.44 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.10/2.44
% 6.10/2.44
%------------------------------------------------------------------------------