%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL239-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 : n012.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 2.56s 1.07s
% Output : CNFRefutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 49 ( 38 unt; 5 def)
% Number of atoms : 100 ( 7 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 34 ( 19 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 56 !; 0 ?; 31 :)
% 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(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(not(and(p,not(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(f16,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f17,plain,
~ theorem(not(not(or(not(p),not(not(p)))))),
inference(definition_unfolding,[],[f10,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_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(not(not(or(not(p),not(not(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_143,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_144,definition,
iPr_def_11 = not(iPr_def_10),
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,negated_conjecture,
~ theorem(iPr_def_14),
inference(demodulation,[status(thm)],[c_66,c_144,c_143,c_145,c_146,c_147]) ).
tcf(c_266,plain,
! [X0: $i] : theorem(or(iPr_def_11,or(X0,iPr_def_10))),
inference(superposition,[status(thm)],[c_144,c_100]) ).
tcf(c_268,plain,
! [X0: $i] : theorem(or(iPr_def_14,or(X0,iPr_def_13))),
inference(superposition,[status(thm)],[c_147,c_100]) ).
tcf(c_275,plain,
theorem(or(not(or(iPr_def_11,iPr_def_10)),iPr_def_12)),
inference(superposition,[status(thm)],[c_145,c_105]) ).
tcf(c_280,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_95,c_65]) ).
tcf(c_282,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_105,c_65]) ).
tcf(c_285,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(iPr_def_12)
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_146,c_65]) ).
tcf(c_317,plain,
( theorem(iPr_def_12)
| ~ theorem(or(iPr_def_11,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_275,c_65]) ).
tcf(c_393,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_869,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_11,iPr_def_10))),
inference(superposition,[status(thm)],[c_266,c_393]) ).
tcf(c_871,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_14,iPr_def_13))),
inference(superposition,[status(thm)],[c_268,c_393]) ).
tcf(c_1003,plain,
theorem(or(iPr_def_11,iPr_def_10)),
inference(superposition,[status(thm)],[c_869,c_280]) ).
tcf(c_1010,plain,
theorem(iPr_def_12),
inference(backward_subsumption_resolution,[status(thm)],[c_317,c_1003]) ).
tcf(c_1015,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(iPr_def_13,X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_285,c_1010]) ).
tcf(c_1126,plain,
theorem(or(iPr_def_14,iPr_def_13)),
inference(superposition,[status(thm)],[c_871,c_280]) ).
tcf(c_1132,plain,
theorem(or(iPr_def_13,iPr_def_14)),
inference(superposition,[status(thm)],[c_1126,c_282]) ).
tcf(c_1369,plain,
theorem(iPr_def_14),
inference(superposition,[status(thm)],[c_1132,c_1015]) ).
tcf(c_1372,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1369,c_148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL239-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.29 % Computer : n012.cluster.edu
% 0.04/0.29 % Model : x86_64 x86_64
% 0.04/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.29 % Memory : 8046.5625MB
% 0.04/0.29 % OS : Linux 6.8.0-71-generic
% 0.04/0.29 % CPULimit : 300
% 0.04/0.29 % WCLimit : 300
% 0.04/0.29 % DateTime : Wed Sep 23 22:31:21 UTC 2026
% 0.04/0.29 % CPUTime :
% 0.04/0.29 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.31 Running first-order theorem proving
% 0.04/0.31 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.04/0.32
% 0.04/0.32 % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.32
% 0.04/0.32 % Detected problem language: tptp
% 0.07/0.33 % Proving...
% 2.56/1.07 % SZS status Started for theBenchmark.p
% 2.56/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 2.56/1.07
% 2.56/1.07 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.56/1.07
% 2.56/1.07 % ------ iProver source info
% 2.56/1.07
% 2.56/1.07 % git: date: 2026-07-19 20:42:38 +0200
% 2.56/1.07 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.56/1.07 % git: non_committed_changes: false
% 2.56/1.07
% 2.56/1.07 % ------ Parsing...% successful
% 2.56/1.07
% 2.56/1.07
% 2.56/1.07 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.56/1.07
% 2.56/1.07 % ------ 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 %
% 2.56/1.07
% 2.56/1.07 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.56/1.07
% 2.56/1.07 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.56/1.07 % ------ Proving...
% 2.56/1.07 % ------ Problem Properties
% 2.56/1.07
% 2.56/1.07 %
% 2.56/1.07 % clauses 12
% 2.56/1.07 % conjectures 1
% 2.56/1.07 % EPR 1
% 2.56/1.07 % Horn 12
% 2.56/1.07 % unary 11
% 2.56/1.07 % binary 0
% 2.56/1.07 % lits 14
% 2.56/1.07 % lits eq 5
% 2.56/1.07 % fd_pure 0
% 2.56/1.07 % fd_pseudo 0
% 2.56/1.07 % fd_cond 0
% 2.56/1.07 % fd_pseudo_cond 0
% 2.56/1.07 % AC symbols 0
% 2.56/1.07
% 2.56/1.07 % ------ Schedule dynamic 5 is on
% 2.56/1.07
% 2.56/1.07 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.56/1.07
% 2.56/1.07
% 2.56/1.07 % ------
% 2.56/1.07 % Current options:
% 2.56/1.07 % ------
% 2.56/1.07
% 2.56/1.07
% 2.56/1.07 %
% 2.56/1.07
% 2.56/1.07 % ------ Proving...
% 2.56/1.07 %
% 2.56/1.07
% 2.56/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 2.56/1.07
% 2.56/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.56/1.07
% 2.56/1.07
%------------------------------------------------------------------------------