%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL240-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 : n019.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:08 PM UTC 2026
% Result : Unsatisfiable 7.77s 2.28s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 65 ( 47 unt; 6 def)
% Number of atoms : 134 ( 8 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 51 ( 28 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 86 !; 0 ?; 55 :)
% 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(and(p,q),p)),
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(not(or(not(p),not(q)))),p)),
inference(definition_unfolding,[],[f10,f6,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(not(or(not(p),not(q)))),p)),
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 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_145,definition,
iPr_def_12 = or(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_146,definition,
iPr_def_13 = not(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_147,definition,
iPr_def_14 = not(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_148,definition,
iPr_def_15 = or(iPr_def_14,p),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_149,negated_conjecture,
~ theorem(iPr_def_15),
inference(demodulation,[status(thm)],[c_66,c_144,c_143,c_145,c_146,c_147,c_148]) ).
tcf(c_270,plain,
! [X0: $i] : theorem(or(iPr_def_10,or(X0,p))),
inference(superposition,[status(thm)],[c_143,c_100]) ).
tcf(c_273,plain,
! [X0: $i] : theorem(or(iPr_def_14,or(X0,iPr_def_13))),
inference(superposition,[status(thm)],[c_147,c_100]) ).
tcf(c_284,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_95,c_65]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_100,c_65]) ).
tcf(c_334,plain,
theorem(or(not(or(iPr_def_11,iPr_def_10)),iPr_def_12)),
inference(superposition,[status(thm)],[c_145,c_105]) ).
tcf(c_335,plain,
theorem(or(not(or(p,iPr_def_14)),iPr_def_15)),
inference(superposition,[status(thm)],[c_148,c_105]) ).
tcf(c_336,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_105,c_65]) ).
tcf(c_348,plain,
( theorem(iPr_def_15)
| ~ theorem(or(p,iPr_def_14)) ),
inference(superposition,[status(thm)],[c_335,c_65]) ).
tcf(c_349,plain,
~ theorem(or(p,iPr_def_14)),
inference(forward_subsumption_resolution,[status(thm)],[c_348,c_149]) ).
tcf(c_356,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_502,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(iPr_def_13,X0)),or(not(or(X1,iPr_def_12)),or(X1,X0)))),
inference(superposition,[status(thm)],[c_146,c_115]) ).
tcf(c_508,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_816,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_10,p))),
inference(superposition,[status(thm)],[c_270,c_356]) ).
tcf(c_819,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_14,iPr_def_13))),
inference(superposition,[status(thm)],[c_273,c_356]) ).
tcf(c_820,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_285,c_356]) ).
tcf(c_967,plain,
theorem(or(iPr_def_10,p)),
inference(superposition,[status(thm)],[c_816,c_284]) ).
tcf(c_975,plain,
theorem(or(p,iPr_def_10)),
inference(superposition,[status(thm)],[c_967,c_336]) ).
tcf(c_1006,plain,
theorem(or(iPr_def_14,iPr_def_13)),
inference(superposition,[status(thm)],[c_819,c_284]) ).
tcf(c_1058,plain,
theorem(or(iPr_def_13,iPr_def_14)),
inference(superposition,[status(thm)],[c_1006,c_336]) ).
tcf(c_1544,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X1,iPr_def_12)),or(X1,X0)))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_502,c_65]) ).
tcf(c_2057,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_508,c_65]) ).
tcf(c_2580,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,X1))
| ~ theorem(or(iPr_def_13,X1))
| ~ theorem(or(X0,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_1544,c_65]) ).
tcf(c_3303,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_12))
| ~ theorem(or(X0,or(iPr_def_11,iPr_def_10))) ),
inference(superposition,[status(thm)],[c_334,c_2057]) ).
tcf(c_14828,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_12))
| ~ theorem(or(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_820,c_3303]) ).
tcf(c_15107,plain,
theorem(or(p,iPr_def_12)),
inference(superposition,[status(thm)],[c_975,c_14828]) ).
tcf(c_15280,plain,
! [X0: $i] :
( theorem(or(p,X0))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_15107,c_2580]) ).
tcf(c_16746,plain,
theorem(or(p,iPr_def_14)),
inference(superposition,[status(thm)],[c_1058,c_15280]) ).
tcf(c_16795,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_16746,c_349]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL240-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.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 22:32:21 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 7.77/2.28 % SZS status Started for theBenchmark.p
% 7.77/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 7.77/2.28
% 7.77/2.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.77/2.28
% 7.77/2.28 % ------ iProver source info
% 7.77/2.28
% 7.77/2.28 % git: date: 2026-07-19 20:42:38 +0200
% 7.77/2.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.77/2.28 % git: non_committed_changes: false
% 7.77/2.28
% 7.77/2.28 % ------ Parsing...% successful
% 7.77/2.28
% 7.77/2.28
% 7.77/2.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.77/2.28
% 7.77/2.28 % ------ 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 %
% 7.77/2.28
% 7.77/2.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.77/2.28
% 7.77/2.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.77/2.28 % ------ Proving...
% 7.77/2.28 % ------ Problem Properties
% 7.77/2.28
% 7.77/2.28 %
% 7.77/2.28 % clauses 13
% 7.77/2.28 % conjectures 1
% 7.77/2.28 % EPR 1
% 7.77/2.28 % Horn 13
% 7.77/2.28 % unary 12
% 7.77/2.28 % binary 0
% 7.77/2.28 % lits 15
% 7.77/2.28 % lits eq 6
% 7.77/2.28 % fd_pure 0
% 7.77/2.28 % fd_pseudo 0
% 7.77/2.28 % fd_cond 0
% 7.77/2.28 % fd_pseudo_cond 0
% 7.77/2.28 % AC symbols 0
% 7.77/2.28
% 7.77/2.28 % ------ Schedule dynamic 5 is on
% 7.77/2.28
% 7.77/2.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.77/2.28
% 7.77/2.28
% 7.77/2.28 % ------
% 7.77/2.28 % Current options:
% 7.77/2.28 % ------
% 7.77/2.28
% 7.77/2.28
% 7.77/2.28 %
% 7.77/2.28
% 7.77/2.28 % ------ Proving...
% 7.77/2.28 %
% 7.77/2.28
% 7.77/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 7.77/2.28
% 7.77/2.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.77/2.28
% 7.77/2.28
%------------------------------------------------------------------------------