%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL253-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 : 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:11 PM UTC 2026
% Result : Unsatisfiable 120.41s 21.81s
% Output : CNFRefutation 120.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 22
% Syntax : Number of formulae : 70 ( 51 unt; 12 def)
% Number of atoms : 177 ( 14 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 63 ( 36 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 13 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 89 !; 0 ?; 58 :)
% 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,negated_conjecture,
~ theorem(implies(implies(p,q),implies(and(p,r),and(q,r)))),
file('/export/starexec/sandbox2/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(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
inference(definition_unfolding,[],[f10,f6,f6,f6,f9,f9]) ).
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(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(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(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_144,definition,
iPr_def_11 = or(iPr_def_10,q),
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(r),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_147,definition,
iPr_def_14 = or(iPr_def_10,iPr_def_13),
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 = not(iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_150,definition,
iPr_def_17 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_151,definition,
iPr_def_18 = or(iPr_def_17,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_152,definition,
iPr_def_19 = not(iPr_def_18),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_153,definition,
iPr_def_20 = or(iPr_def_16,iPr_def_19),
introduced(definition,[new_symbols(definition,[iPr_def_20])],[]) ).
tcf(c_154,definition,
iPr_def_21 = or(iPr_def_12,iPr_def_20),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_155,negated_conjecture,
~ theorem(iPr_def_21),
inference(demodulation,[status(thm)],[c_66,c_150,c_151,c_152,c_146,c_147,c_148,c_149,c_153,c_143,c_144,c_145,c_154]) ).
tcf(c_114856,plain,
! [X0: $i] : theorem(or(iPr_def_16,or(X0,iPr_def_15))),
inference(superposition,[status(thm)],[c_149,c_100]) ).
tcf(c_114872,plain,
theorem(or(not(or(iPr_def_19,iPr_def_16)),iPr_def_20)),
inference(superposition,[status(thm)],[c_153,c_105]) ).
tcf(c_114880,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_95,c_65]) ).
tcf(c_114882,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_105,c_65]) ).
tcf(c_114938,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_115064,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(iPr_def_15,X0)),or(not(or(X1,iPr_def_14)),or(X1,X0)))),
inference(superposition,[status(thm)],[c_148,c_115]) ).
tcf(c_115067,plain,
! [X0: $i] : theorem(or(not(or(not(q),X0)),or(not(iPr_def_11),or(iPr_def_10,X0)))),
inference(superposition,[status(thm)],[c_144,c_115]) ).
tcf(c_115076,plain,
! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_20)),or(not(or(iPr_def_12,X0)),iPr_def_21))),
inference(superposition,[status(thm)],[c_154,c_115]) ).
tcf(c_115077,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_115081,plain,
! [X0: $i] : theorem(or(not(or(iPr_def_17,X0)),or(iPr_def_12,or(iPr_def_10,X0)))),
inference(light_normalisation,[status(thm)],[c_115067,c_145,c_150]) ).
tcf(c_115534,plain,
theorem(or(not(or(iPr_def_17,iPr_def_13)),or(iPr_def_12,iPr_def_14))),
inference(superposition,[status(thm)],[c_147,c_115081]) ).
tcf(c_115537,plain,
theorem(or(iPr_def_19,or(iPr_def_12,iPr_def_14))),
inference(light_normalisation,[status(thm)],[c_115534,c_151,c_152]) ).
tcf(c_115575,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_16,iPr_def_15))),
inference(superposition,[status(thm)],[c_114856,c_114938]) ).
tcf(c_115605,plain,
theorem(or(iPr_def_12,or(iPr_def_19,iPr_def_14))),
inference(superposition,[status(thm)],[c_115537,c_114938]) ).
tcf(c_115906,plain,
theorem(or(iPr_def_16,iPr_def_15)),
inference(superposition,[status(thm)],[c_115575,c_114880]) ).
tcf(c_115912,plain,
theorem(or(iPr_def_15,iPr_def_16)),
inference(superposition,[status(thm)],[c_115906,c_114882]) ).
tcf(c_116694,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X1,iPr_def_14)),or(X1,X0)))
| ~ theorem(or(iPr_def_15,X0)) ),
inference(superposition,[status(thm)],[c_115064,c_65]) ).
tcf(c_118312,plain,
! [X0: $i] :
( theorem(or(not(or(iPr_def_12,X0)),iPr_def_21))
| ~ theorem(or(not(X0),iPr_def_20)) ),
inference(superposition,[status(thm)],[c_115076,c_65]) ).
tcf(c_118454,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_115077,c_114938]) ).
tcf(c_120972,plain,
! [X0: $i] :
( theorem(iPr_def_21)
| ~ theorem(or(iPr_def_12,X0))
| ~ theorem(or(not(X0),iPr_def_20)) ),
inference(superposition,[status(thm)],[c_118312,c_65]) ).
tcf(c_120976,plain,
! [X0: $i] :
( ~ theorem(or(iPr_def_12,X0))
| ~ theorem(or(not(X0),iPr_def_20)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_120972,c_155]) ).
tcf(c_192765,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_118454,c_65]) ).
tcf(c_193253,plain,
! [X0: $i,X1: $i] :
( ~ theorem(X0)
| ~ theorem(or(not(X1),iPr_def_20))
| ~ theorem(or(iPr_def_12,or(not(X0),X1))) ),
inference(superposition,[status(thm)],[c_192765,c_120976]) ).
tcf(c_194535,plain,
! [X0: $i,X1: $i] :
( ~ theorem(or(iPr_def_12,X0))
| ~ theorem(or(not(X1),iPr_def_20))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_118454,c_193253]) ).
tcf(c_195510,plain,
! [X0: $i,X1: $i] :
( ~ theorem(or(iPr_def_15,X1))
| ~ theorem(or(iPr_def_12,or(X0,iPr_def_14)))
| ~ theorem(or(not(or(X0,X1)),iPr_def_20)) ),
inference(superposition,[status(thm)],[c_116694,c_194535]) ).
tcf(c_236145,plain,
( ~ theorem(or(iPr_def_15,iPr_def_16))
| ~ theorem(or(iPr_def_12,or(iPr_def_19,iPr_def_14))) ),
inference(superposition,[status(thm)],[c_114872,c_195510]) ).
tcf(c_236224,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_236145,c_115912,c_115605]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL253-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.41 % Computer : n006.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Wed Sep 23 22:36:41 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.47 Running first-order theorem proving
% 0.15/0.47 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.15/0.49
% 0.15/0.49 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.49
% 0.15/0.49 % Detected problem language: tptp
% 0.24/0.51 % Proving...
% 120.41/21.81 % SZS status Started for theBenchmark.p
% 120.41/21.81 % SZS status Unsatisfiable for theBenchmark.p
% 120.41/21.81
% 120.41/21.81 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 120.41/21.81
% 120.41/21.81 % ------ iProver source info
% 120.41/21.81
% 120.41/21.81 % git: date: 2026-07-19 20:42:38 +0200
% 120.41/21.81 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 120.41/21.81 % git: non_committed_changes: false
% 120.41/21.81
% 120.41/21.81 % ------ Parsing...% successful
% 120.41/21.81
% 120.41/21.81
% 120.41/21.81 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 120.41/21.81
% 120.41/21.81 % ------ 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 %
% 120.41/21.81
% 120.41/21.81 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 120.41/21.81
% 120.41/21.81 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 120.41/21.81 % ------ Proving...
% 120.41/21.81 % ------ Problem Properties
% 120.41/21.81
% 120.41/21.81 %
% 120.41/21.81 % clauses 19
% 120.41/21.81 % conjectures 1
% 120.41/21.81 % EPR 1
% 120.41/21.81 % Horn 19
% 120.41/21.81 % unary 18
% 120.41/21.81 % binary 0
% 120.41/21.81 % lits 21
% 120.41/21.81 % lits eq 12
% 120.41/21.81 % fd_pure 0
% 120.41/21.81 % fd_pseudo 0
% 120.41/21.81 % fd_cond 0
% 120.41/21.81 % fd_pseudo_cond 0
% 120.41/21.81 % AC symbols 0
% 120.41/21.81
% 120.41/21.81 % ------ Schedule dynamic 5 is on
% 120.41/21.81
% 120.41/21.81 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 120.41/21.81
% 120.41/21.81
% 120.41/21.81 % ------
% 120.41/21.81 % Current options:
% 120.41/21.81 % ------
% 120.41/21.81
% 120.41/21.81
% 120.41/21.81 %
% 120.41/21.81
% 120.41/21.81 % ------ Proving...
% 120.41/21.81 % Proof_search_loop: time out after: 5465 full_loop iterations
% 120.41/21.81
% 120.41/21.81 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 120.41/21.81
% 120.41/21.81
% 120.41/21.81 % ------
% 120.41/21.81 % Current options:
% 120.41/21.81 % ------
% 120.41/21.81
% 120.41/21.81
% 120.41/21.81 %
% 120.41/21.81
% 120.41/21.81 % ------ Proving...
% 120.41/21.81 %
% 120.41/21.81
% 120.41/21.81 % SZS status Unsatisfiable for theBenchmark.p
% 120.41/21.81
% 120.41/21.81 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 120.41/21.81
% 120.41/21.81
%------------------------------------------------------------------------------