%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL245-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 : n006.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 3.12s 42.83s
% Output : CNFRefutation 3.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 66 ( 50 unt; 11 def)
% Number of atoms : 141 ( 13 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 45 ( 25 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 15 ( 13 usr; 12 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 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(implies(q,r),implies(p,q)),implies(p,r))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f13,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f15,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(f16,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f17,plain,
~ theorem(or(not(not(or(not(or(not(q),r)),not(or(not(p),q))))),or(not(p),r))),
inference(definition_unfolding,[],[f10,f6,f9,f6,f6,f6]) ).
tcf(c_59,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f11]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f12]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f13]) ).
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,[],[f14]) ).
tcf(c_63,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,[],[f15]) ).
tcf(c_64,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_66,negated_conjecture,
~ theorem(or(not(not(or(not(or(not(q),r)),not(or(not(p),q))))),or(not(p),r))),
inference(cnf_transformation,[],[f17]) ).
tcf(c_95,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_64,c_59]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_64,c_60]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_64,c_61]) ).
tcf(c_110,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_64,c_62]) ).
tcf(c_115,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_64,c_63]) ).
tcf(c_143,definition,
iPr_def_10 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_144,definition,
iPr_def_11 = or(iPr_def_10,r),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_145,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_146,definition,
iPr_def_13 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_147,definition,
iPr_def_14 = or(iPr_def_13,q),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_148,definition,
iPr_def_15 = not(iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_149,definition,
iPr_def_16 = or(iPr_def_12,iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_150,definition,
iPr_def_17 = not(iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_151,definition,
iPr_def_18 = not(iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_152,definition,
iPr_def_19 = or(iPr_def_13,r),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_153,definition,
iPr_def_20 = or(iPr_def_18,iPr_def_19),
introduced(definition,[new_symbols(definition,[iPr_def_20])],[]) ).
tcf(c_154,negated_conjecture,
~ theorem(iPr_def_20),
inference(demodulation,[status(thm)],[c_66,c_152,c_146,c_147,c_148,c_143,c_144,c_145,c_149,c_150,c_151,c_153]) ).
tcf(c_285634,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_95,c_65]) ).
tcf(c_285661,plain,
theorem(or(not(or(iPr_def_19,iPr_def_18)),iPr_def_20)),
inference(superposition,[status(thm)],[c_153,c_105]) ).
tcf(c_285662,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_105,c_65]) ).
tcf(c_285675,plain,
! [X0: $i] : theorem(or(not(or(iPr_def_12,or(X0,iPr_def_15))),or(X0,iPr_def_16))),
inference(superposition,[status(thm)],[c_149,c_110]) ).
tcf(c_285678,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_110,c_65]) ).
tcf(c_285687,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(iPr_def_10,X0)),or(not(or(X1,q)),or(X1,X0)))),
inference(superposition,[status(thm)],[c_143,c_115]) ).
tcf(c_285703,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_115,c_65]) ).
tcf(c_285825,plain,
( theorem(iPr_def_20)
| ~ theorem(or(iPr_def_19,iPr_def_18)) ),
inference(superposition,[status(thm)],[c_285661,c_65]) ).
tcf(c_285826,plain,
~ theorem(or(iPr_def_19,iPr_def_18)),
inference(forward_subsumption_resolution,[status(thm)],[c_285825,c_154]) ).
tcf(c_285986,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_16))
| ~ theorem(or(iPr_def_12,or(X0,iPr_def_15))) ),
inference(superposition,[status(thm)],[c_285675,c_65]) ).
tcf(c_286014,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
inference(superposition,[status(thm)],[c_100,c_285678]) ).
tcf(c_286138,plain,
theorem(or(not(or(iPr_def_10,r)),or(not(or(iPr_def_13,q)),iPr_def_19))),
inference(superposition,[status(thm)],[c_152,c_285687]) ).
tcf(c_286145,plain,
theorem(or(iPr_def_12,or(iPr_def_15,iPr_def_19))),
inference(light_normalisation,[status(thm)],[c_286138,c_144,c_145,c_147,c_148]) ).
tcf(c_286461,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_285703,c_65]) ).
tcf(c_287537,plain,
! [X0: $i] : theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_286014,c_285634]) ).
tcf(c_287556,plain,
! [X0: $i] : theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_287537,c_285662]) ).
tcf(c_287578,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_286461]) ).
tcf(c_288007,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_287556,c_286461]) ).
tcf(c_296209,plain,
theorem(or(iPr_def_12,or(iPr_def_19,iPr_def_15))),
inference(superposition,[status(thm)],[c_286145,c_287578]) ).
tcf(c_303803,plain,
theorem(or(iPr_def_19,iPr_def_16)),
inference(superposition,[status(thm)],[c_296209,c_285986]) ).
tcf(c_344450,plain,
! [X0: $i] :
( theorem(or(X0,not(iPr_def_17)))
| ~ theorem(or(X0,iPr_def_16)) ),
inference(superposition,[status(thm)],[c_150,c_288007]) ).
tcf(c_344464,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_18))
| ~ theorem(or(X0,iPr_def_16)) ),
inference(light_normalisation,[status(thm)],[c_344450,c_151]) ).
tcf(c_347149,plain,
theorem(or(iPr_def_19,iPr_def_18)),
inference(superposition,[status(thm)],[c_303803,c_344464]) ).
tcf(c_347181,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_347149,c_285826]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL245-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.14/10.41 % Computer : n006.cluster.edu
% 0.14/10.41 % Model : x86_64 x86_64
% 0.14/10.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.41 % Memory : 8046.5625MB
% 0.14/10.41 % OS : Linux 6.8.0-71-generic
% 0.14/10.41 % CPULimit : 300
% 0.14/10.41 % WCLimit : 300
% 0.14/10.41 % DateTime : Wed Sep 23 22:34:25 UTC 2026
% 0.14/10.41 % CPUTime :
% 0.14/10.41 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.46 Running first-order theorem proving
% 0.14/10.46 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.14/10.48
% 0.14/10.48 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.48
% 0.14/10.48 % Detected problem language: tptp
% 0.14/10.50 % Proving...
% 3.12/42.83 % SZS status Started for theBenchmark.p
% 3.12/42.83 % SZS status Unsatisfiable for theBenchmark.p
% 3.12/42.83
% 3.12/42.83 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.12/42.83
% 3.12/42.83 % ------ iProver source info
% 3.12/42.83
% 3.12/42.83 % git: date: 2026-07-19 20:42:38 +0200
% 3.12/42.83 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.12/42.83 % git: non_committed_changes: false
% 3.12/42.83
% 3.12/42.83 % ------ Parsing...% successful
% 3.12/42.83
% 3.12/42.83
% 3.12/42.83 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.12/42.83
% 3.12/42.83 % ------ 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 %
% 3.12/42.83
% 3.12/42.83 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.12/42.83
% 3.12/42.83 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.12/42.83 % ------ Proving...
% 3.12/42.83 % ------ Problem Properties
% 3.12/42.83
% 3.12/42.83 %
% 3.12/42.83 % clauses 18
% 3.12/42.83 % conjectures 1
% 3.12/42.83 % EPR 1
% 3.12/42.83 % Horn 18
% 3.12/42.83 % unary 17
% 3.12/42.83 % binary 0
% 3.12/42.83 % lits 20
% 3.12/42.83 % lits eq 11
% 3.12/42.83 % fd_pure 0
% 3.12/42.83 % fd_pseudo 0
% 3.12/42.83 % fd_cond 0
% 3.12/42.83 % fd_pseudo_cond 0
% 3.12/42.83 % AC symbols 0
% 3.12/42.83
% 3.12/42.83 % ------ Schedule dynamic 5 is on
% 3.12/42.83
% 3.12/42.83 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.12/42.83
% 3.12/42.83
% 3.12/42.83 % ------
% 3.12/42.83 % Current options:
% 3.12/42.83 % ------
% 3.12/42.83
% 3.12/42.83
% 3.12/42.83 %
% 3.12/42.83
% 3.12/42.83 % ------ Proving...
% 3.12/42.83 % Proof_search_loop: time out after: 5207 full_loop iterations
% 3.12/42.83
% 3.12/42.83 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 3.12/42.83
% 3.12/42.83
% 3.12/42.83 % ------
% 3.12/42.83 % Current options:
% 3.12/42.83 % ------
% 3.12/42.83
% 3.12/42.83
% 3.12/42.83 %
% 3.12/42.83
% 3.12/42.83 % ------ Proving...
% 3.12/42.83 % Proof_search_loop: time out after: 8558 full_loop iterations
% 3.12/42.83
% 3.12/42.83 % ------ Option_1: Negative Selections Time Limit: 35.
% 3.12/42.83
% 3.12/42.83
% 3.12/42.83 % ------
% 3.12/42.83 % Current options:
% 3.12/42.83 % ------
% 3.12/42.83
% 3.12/42.83
% 3.12/42.83 %
% 3.12/42.83
% 3.12/42.83 % ------ Proving...
% 3.12/42.83 %
% 3.12/42.83
% 3.12/42.83 % SZS status Unsatisfiable for theBenchmark.p
% 3.12/42.83
% 3.12/42.83 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.12/42.83
% 3.12/42.83
%------------------------------------------------------------------------------