%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL253-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n002.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 32.85s 5.62s
% Output : CNFRefutation 32.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 21
% Syntax : Number of formulae : 65 ( 41 unt; 12 def)
% Number of atoms : 185 ( 12 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 59 ( 31 ~; 28 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 72 !; 0 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tcf(c_58,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f3]) ).
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,[],[f4]) ).
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,[],[f5]) ).
tcf(c_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ axiom(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X2),X1))
| ~ axiom(or(not(X2),X0))
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f8]) ).
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,[],[f9]) ).
tcf(c_225,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_226,definition,
iPr_def_11 = or(iPr_def_10,q),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_227,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_228,definition,
iPr_def_13 = not(r),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_229,definition,
iPr_def_14 = or(iPr_def_10,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_230,definition,
iPr_def_15 = not(iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_231,definition,
iPr_def_16 = not(iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_232,definition,
iPr_def_17 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_233,definition,
iPr_def_18 = or(iPr_def_17,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_234,definition,
iPr_def_19 = not(iPr_def_18),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_235,definition,
iPr_def_20 = or(iPr_def_16,iPr_def_19),
introduced(definition,[new_symbols(definition,[iPr_def_20])],[]) ).
tcf(c_236,definition,
iPr_def_21 = or(iPr_def_12,iPr_def_20),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_237,negated_conjecture,
~ theorem(iPr_def_21),
inference(demodulation,[status(thm)],[c_66,c_232,c_233,c_234,c_228,c_229,c_230,c_231,c_235,c_225,c_226,c_227,c_236]) ).
tcf(c_454,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_60,c_63]) ).
tcf(c_473,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_58,c_64]) ).
tcf(c_474,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_59,c_64]) ).
tcf(c_475,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_60,c_64]) ).
tcf(c_565,plain,
! [X0: $i] : axiom(or(not(or(iPr_def_16,or(X0,iPr_def_19))),or(X0,iPr_def_20))),
inference(superposition,[status(thm)],[c_235,c_61]) ).
tcf(c_568,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_61,c_64]) ).
tcf(c_588,plain,
! [X0: $i] : axiom(or(not(or(not(q),X0)),or(not(iPr_def_11),or(iPr_def_10,X0)))),
inference(superposition,[status(thm)],[c_226,c_62]) ).
tcf(c_597,plain,
! [X0: $i] : axiom(or(not(or(not(X0),iPr_def_20)),or(not(or(iPr_def_12,X0)),iPr_def_21))),
inference(superposition,[status(thm)],[c_236,c_62]) ).
tcf(c_602,plain,
! [X0: $i] : axiom(or(not(or(iPr_def_17,X0)),or(iPr_def_12,or(iPr_def_10,X0)))),
inference(light_normalisation,[status(thm)],[c_588,c_227,c_232]) ).
tcf(c_858,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X0),or(X2,X1)))
| ~ axiom(or(not(X0),or(X1,X2))) ),
inference(superposition,[status(thm)],[c_454,c_65]) ).
tcf(c_1282,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_474,c_568]) ).
tcf(c_2722,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_20))
| ~ theorem(or(iPr_def_16,or(X0,iPr_def_19))) ),
inference(superposition,[status(thm)],[c_565,c_64]) ).
tcf(c_2905,plain,
axiom(or(not(or(iPr_def_17,iPr_def_13)),or(iPr_def_12,iPr_def_14))),
inference(superposition,[status(thm)],[c_229,c_602]) ).
tcf(c_2908,plain,
axiom(or(iPr_def_19,or(iPr_def_12,iPr_def_14))),
inference(light_normalisation,[status(thm)],[c_2905,c_233,c_234]) ).
tcf(c_3724,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_20))
| ~ theorem(or(X0,iPr_def_19)) ),
inference(superposition,[status(thm)],[c_235,c_1282]) ).
tcf(c_3725,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_21))
| ~ theorem(or(X0,iPr_def_20)) ),
inference(superposition,[status(thm)],[c_236,c_1282]) ).
tcf(c_3727,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,X1))
| ~ theorem(or(or(X0,X1),X1)) ),
inference(superposition,[status(thm)],[c_1282,c_473]) ).
tcf(c_3728,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(or(X2,X1),X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_1282,c_475]) ).
tcf(c_9612,plain,
! [X0: $i,X1: $i] :
( theorem(or(or(X1,X0),iPr_def_20))
| ~ theorem(or(iPr_def_19,X0)) ),
inference(superposition,[status(thm)],[c_3728,c_3724]) ).
tcf(c_11230,plain,
axiom(or(not(or(iPr_def_15,iPr_def_20)),or(not(or(iPr_def_12,iPr_def_14)),iPr_def_21))),
inference(superposition,[status(thm)],[c_230,c_597]) ).
tcf(c_11648,plain,
( theorem(or(not(or(iPr_def_12,iPr_def_14)),iPr_def_21))
| ~ theorem(or(iPr_def_15,iPr_def_20)) ),
inference(superposition,[status(thm)],[c_11230,c_64]) ).
tcf(c_13015,plain,
! [X0: $i,X1: $i] :
( theorem(or(or(X1,X0),iPr_def_21))
| ~ theorem(or(iPr_def_19,X0)) ),
inference(superposition,[status(thm)],[c_9612,c_3725]) ).
tcf(c_16789,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_21))
| ~ theorem(or(iPr_def_19,iPr_def_21)) ),
inference(superposition,[status(thm)],[c_13015,c_3727]) ).
tcf(c_42890,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_59,c_858]) ).
tcf(c_43214,plain,
! [X0: $i] : theorem(or(iPr_def_16,or(iPr_def_15,X0))),
inference(superposition,[status(thm)],[c_231,c_42890]) ).
tcf(c_43262,plain,
theorem(or(iPr_def_15,iPr_def_20)),
inference(superposition,[status(thm)],[c_43214,c_2722]) ).
tcf(c_43263,plain,
theorem(or(not(or(iPr_def_12,iPr_def_14)),iPr_def_21)),
inference(backward_subsumption_resolution,[status(thm)],[c_11648,c_43262]) ).
tcf(c_45584,plain,
! [X0: $i] :
( theorem(or(not(X0),iPr_def_21))
| ~ axiom(or(not(X0),or(iPr_def_12,iPr_def_14))) ),
inference(superposition,[status(thm)],[c_43263,c_65]) ).
tcf(c_46908,plain,
( theorem(or(not(iPr_def_18),iPr_def_21))
| ~ axiom(or(iPr_def_19,or(iPr_def_12,iPr_def_14))) ),
inference(superposition,[status(thm)],[c_234,c_45584]) ).
tcf(c_46910,plain,
( theorem(or(iPr_def_19,iPr_def_21))
| ~ axiom(or(iPr_def_19,or(iPr_def_12,iPr_def_14))) ),
inference(light_normalisation,[status(thm)],[c_46908,c_234]) ).
tcf(c_46911,plain,
theorem(or(iPr_def_19,iPr_def_21)),
inference(forward_subsumption_resolution,[status(thm)],[c_46910,c_2908]) ).
tcf(c_46928,plain,
! [X0: $i] : theorem(or(X0,iPr_def_21)),
inference(backward_subsumption_resolution,[status(thm)],[c_16789,c_46911]) ).
tcf(c_47070,plain,
theorem(iPr_def_21),
inference(superposition,[status(thm)],[c_46928,c_473]) ).
tcf(c_47081,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_47070,c_237]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL253-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/0.44 % Computer : n002.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Wed Sep 23 22:39:33 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.51 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.24/0.52
% 0.24/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.52
% 0.24/0.52 % Detected problem language: tptp
% 0.24/0.54 % Proving...
% 32.85/5.62 % SZS status Started for theBenchmark.p
% 32.85/5.62 % SZS status Unsatisfiable for theBenchmark.p
% 32.85/5.62
% 32.85/5.62 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 32.85/5.62
% 32.85/5.62 % ------ iProver source info
% 32.85/5.62
% 32.85/5.62 % git: date: 2026-07-19 20:42:38 +0200
% 32.85/5.62 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 32.85/5.62 % git: non_committed_changes: false
% 32.85/5.62
% 32.85/5.62 % ------ Parsing...% successful
% 32.85/5.62
% 32.85/5.62
% 32.85/5.62 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 32.85/5.62
% 32.85/5.62 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 32.85/5.62
% 32.85/5.62 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 32.85/5.62
% 32.85/5.62 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 32.85/5.62 % ------ Proving...
% 32.85/5.62 % ------ Problem Properties
% 32.85/5.62
% 32.85/5.62 %
% 32.85/5.62 % clauses 21
% 32.85/5.62 % conjectures 1
% 32.85/5.62 % EPR 2
% 32.85/5.62 % Horn 21
% 32.85/5.62 % unary 18
% 32.85/5.62 % binary 1
% 32.85/5.62 % lits 26
% 32.85/5.62 % lits eq 12
% 32.85/5.62 % fd_pure 0
% 32.85/5.62 % fd_pseudo 0
% 32.85/5.62 % fd_cond 0
% 32.85/5.62 % fd_pseudo_cond 0
% 32.85/5.62 % AC symbols 0
% 32.85/5.62
% 32.85/5.62 % ------ Schedule dynamic 5 is on
% 32.85/5.62
% 32.85/5.62 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 32.85/5.62
% 32.85/5.62
% 32.85/5.62 % ------
% 32.85/5.62 % Current options:
% 32.85/5.62 % ------
% 32.85/5.62
% 32.85/5.62
% 32.85/5.62 %
% 32.85/5.62
% 32.85/5.62 % ------ Proving...
% 32.85/5.62 %
% 32.85/5.62
% 32.85/5.62 % SZS status Unsatisfiable for theBenchmark.p
% 32.85/5.62
% 32.85/5.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 32.85/5.62
% 32.85/5.62
%------------------------------------------------------------------------------