%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL262-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:13 PM UTC 2026
% Result : Unsatisfiable 3.92s 3.36s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 24
% Syntax : Number of formulae : 90 ( 64 unt; 13 def)
% Number of atoms : 242 ( 17 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 77 ( 43 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 14 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 92 !; 0 ?; 57 :)
% 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,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(p,q),implies(not(q),not(p)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,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(f18,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q)))))),
inference(definition_unfolding,[],[f11,f12,f6,f6]) ).
tcf(c_60,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f14]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f15]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_64,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,[],[f17]) ).
tcf(c_65,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_67,negated_conjecture,
~ theorem(not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q)))))),
inference(cnf_transformation,[],[f19]) ).
tcf(c_96,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_65,c_60]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_65,c_61]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_65,c_62]) ).
tcf(c_111,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_65,c_63]) ).
tcf(c_116,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_65,c_64]) ).
tcf(c_144,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_145,definition,
iPr_def_11 = or(iPr_def_10,q),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_146,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_147,definition,
iPr_def_13 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_148,definition,
iPr_def_14 = not(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_149,definition,
iPr_def_15 = or(iPr_def_14,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_150,definition,
iPr_def_16 = or(iPr_def_12,iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_151,definition,
iPr_def_17 = not(iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_152,definition,
iPr_def_18 = not(iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_153,definition,
iPr_def_19 = or(iPr_def_18,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_154,definition,
iPr_def_20 = not(iPr_def_19),
introduced(definition,[new_symbols(definition,[iPr_def_20])],[]) ).
tcf(c_155,definition,
iPr_def_21 = or(iPr_def_17,iPr_def_20),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_156,definition,
iPr_def_22 = not(iPr_def_21),
introduced(definition,[new_symbols(definition,[iPr_def_22])],[]) ).
tcf(c_157,negated_conjecture,
~ theorem(iPr_def_22),
inference(demodulation,[status(thm)],[c_67,c_152,c_153,c_154,c_147,c_148,c_149,c_144,c_145,c_146,c_150,c_151,c_155,c_156]) ).
tcf(c_306,plain,
! [X0: $i] : theorem(or(iPr_def_13,or(X0,q))),
inference(superposition,[status(thm)],[c_147,c_101]) ).
tcf(c_309,plain,
! [X0: $i] : theorem(or(iPr_def_14,or(X0,iPr_def_13))),
inference(superposition,[status(thm)],[c_148,c_101]) ).
tcf(c_336,plain,
theorem(or(not(iPr_def_21),or(iPr_def_20,iPr_def_17))),
inference(superposition,[status(thm)],[c_155,c_106]) ).
tcf(c_337,plain,
theorem(or(not(or(q,iPr_def_10)),iPr_def_11)),
inference(superposition,[status(thm)],[c_145,c_106]) ).
tcf(c_338,plain,
theorem(or(not(or(iPr_def_10,iPr_def_14)),iPr_def_15)),
inference(superposition,[status(thm)],[c_149,c_106]) ).
tcf(c_342,plain,
theorem(or(iPr_def_22,or(iPr_def_20,iPr_def_17))),
inference(light_normalisation,[status(thm)],[c_336,c_156]) ).
tcf(c_354,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_96,c_66]) ).
tcf(c_356,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_106,c_66]) ).
tcf(c_363,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(iPr_def_16)
| ~ theorem(or(iPr_def_17,X0)) ),
inference(superposition,[status(thm)],[c_151,c_66]) ).
tcf(c_365,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(iPr_def_19)
| ~ theorem(or(iPr_def_20,X0)) ),
inference(superposition,[status(thm)],[c_154,c_66]) ).
tcf(c_464,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_111,c_66]) ).
tcf(c_615,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_145,c_116]) ).
tcf(c_622,plain,
! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_15)),or(not(or(iPr_def_12,X0)),iPr_def_16))),
inference(superposition,[status(thm)],[c_150,c_116]) ).
tcf(c_623,plain,
! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_11)),or(not(or(iPr_def_18,X0)),iPr_def_19))),
inference(superposition,[status(thm)],[c_153,c_116]) ).
tcf(c_630,plain,
! [X0: $i] : theorem(or(not(or(iPr_def_13,X0)),or(iPr_def_12,or(iPr_def_10,X0)))),
inference(light_normalisation,[status(thm)],[c_615,c_146,c_147]) ).
tcf(c_1936,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(superposition,[status(thm)],[c_116,c_464]) ).
tcf(c_1937,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_13,q))),
inference(superposition,[status(thm)],[c_306,c_464]) ).
tcf(c_1940,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_14,iPr_def_13))),
inference(superposition,[status(thm)],[c_309,c_464]) ).
tcf(c_1945,plain,
theorem(or(iPr_def_20,or(iPr_def_22,iPr_def_17))),
inference(superposition,[status(thm)],[c_342,c_464]) ).
tcf(c_2146,plain,
theorem(or(iPr_def_13,q)),
inference(superposition,[status(thm)],[c_1937,c_354]) ).
tcf(c_2162,plain,
theorem(or(q,iPr_def_13)),
inference(superposition,[status(thm)],[c_2146,c_356]) ).
tcf(c_2242,plain,
theorem(or(iPr_def_14,iPr_def_13)),
inference(superposition,[status(thm)],[c_1940,c_354]) ).
tcf(c_2271,plain,
! [X0: $i] :
( theorem(or(iPr_def_12,or(iPr_def_10,X0)))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_630,c_66]) ).
tcf(c_2375,plain,
theorem(or(iPr_def_13,iPr_def_14)),
inference(superposition,[status(thm)],[c_2242,c_356]) ).
tcf(c_2606,plain,
( theorem(or(iPr_def_22,iPr_def_17))
| ~ theorem(iPr_def_19) ),
inference(superposition,[status(thm)],[c_1945,c_365]) ).
tcf(c_3135,plain,
( theorem(or(iPr_def_17,iPr_def_22))
| ~ theorem(iPr_def_19) ),
inference(superposition,[status(thm)],[c_2606,c_356]) ).
tcf(c_3362,plain,
( theorem(iPr_def_22)
| ~ theorem(iPr_def_19)
| ~ theorem(iPr_def_16) ),
inference(superposition,[status(thm)],[c_3135,c_363]) ).
tcf(c_3363,plain,
( ~ theorem(iPr_def_19)
| ~ theorem(iPr_def_16) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3362,c_157]) ).
tcf(c_4406,plain,
! [X0: $i] :
( theorem(or(not(or(iPr_def_12,X0)),iPr_def_16))
| ~ theorem(or(not(X0),iPr_def_15)) ),
inference(superposition,[status(thm)],[c_622,c_66]) ).
tcf(c_4713,plain,
! [X0: $i] :
( theorem(or(not(or(iPr_def_18,X0)),iPr_def_19))
| ~ theorem(or(not(X0),iPr_def_11)) ),
inference(superposition,[status(thm)],[c_623,c_66]) ).
tcf(c_9456,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(not(X1),X2)),or(X0,X2)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_1936,c_66]) ).
tcf(c_10275,plain,
! [X0: $i] :
( theorem(iPr_def_16)
| ~ theorem(or(iPr_def_12,X0))
| ~ theorem(or(not(X0),iPr_def_15)) ),
inference(superposition,[status(thm)],[c_4406,c_66]) ).
tcf(c_10290,plain,
! [X0: $i] :
( theorem(iPr_def_19)
| ~ theorem(or(iPr_def_18,X0))
| ~ theorem(or(not(X0),iPr_def_11)) ),
inference(superposition,[status(thm)],[c_4713,c_66]) ).
tcf(c_12804,plain,
( theorem(iPr_def_16)
| ~ theorem(or(iPr_def_12,or(iPr_def_10,iPr_def_14))) ),
inference(superposition,[status(thm)],[c_338,c_10275]) ).
tcf(c_20401,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(iPr_def_14,X1)),or(X0,X1)))
| ~ theorem(or(X0,iPr_def_13)) ),
inference(superposition,[status(thm)],[c_148,c_9456]) ).
tcf(c_21991,plain,
( theorem(iPr_def_16)
| ~ theorem(or(iPr_def_13,iPr_def_14)) ),
inference(superposition,[status(thm)],[c_2271,c_12804]) ).
tcf(c_21993,plain,
theorem(iPr_def_16),
inference(forward_subsumption_resolution,[status(thm)],[c_21991,c_2375]) ).
tcf(c_22000,plain,
~ theorem(iPr_def_19),
inference(backward_subsumption_resolution,[status(thm)],[c_3363,c_21993]) ).
tcf(c_22041,plain,
! [X0: $i] :
( ~ theorem(or(iPr_def_18,X0))
| ~ theorem(or(not(X0),iPr_def_11)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_10290,c_22000]) ).
tcf(c_22382,plain,
~ theorem(or(iPr_def_18,or(q,iPr_def_10))),
inference(superposition,[status(thm)],[c_337,c_22041]) ).
tcf(c_23864,plain,
! [X0: $i] :
( theorem(or(not(iPr_def_15),or(X0,iPr_def_10)))
| ~ theorem(or(X0,iPr_def_13)) ),
inference(superposition,[status(thm)],[c_149,c_20401]) ).
tcf(c_23876,plain,
! [X0: $i] :
( theorem(or(iPr_def_18,or(X0,iPr_def_10)))
| ~ theorem(or(X0,iPr_def_13)) ),
inference(light_normalisation,[status(thm)],[c_23864,c_152]) ).
tcf(c_23899,plain,
~ theorem(or(q,iPr_def_13)),
inference(superposition,[status(thm)],[c_23876,c_22382]) ).
tcf(c_23902,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_23899,c_2162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL262-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.13/0.37 % Computer : n006.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Wed Sep 23 22:38:27 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 3.92/3.36 % SZS status Started for theBenchmark.p
% 3.92/3.36 % SZS status Unsatisfiable for theBenchmark.p
% 3.92/3.36
% 3.92/3.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.92/3.36
% 3.92/3.36 % ------ iProver source info
% 3.92/3.36
% 3.92/3.36 % git: date: 2026-07-19 20:42:38 +0200
% 3.92/3.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.92/3.36 % git: non_committed_changes: false
% 3.92/3.36
% 3.92/3.36 % ------ Parsing...% successful
% 3.92/3.36
% 3.92/3.36
% 3.92/3.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.92/3.36
% 3.92/3.36 % ------ 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.92/3.36
% 3.92/3.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.92/3.36
% 3.92/3.36 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.92/3.36 % ------ Proving...
% 3.92/3.36 % ------ Problem Properties
% 3.92/3.36
% 3.92/3.36 %
% 3.92/3.36 % clauses 20
% 3.92/3.36 % conjectures 1
% 3.92/3.36 % EPR 1
% 3.92/3.36 % Horn 20
% 3.92/3.36 % unary 19
% 3.92/3.36 % binary 0
% 3.92/3.36 % lits 22
% 3.92/3.36 % lits eq 13
% 3.92/3.36 % fd_pure 0
% 3.92/3.36 % fd_pseudo 0
% 3.92/3.36 % fd_cond 0
% 3.92/3.36 % fd_pseudo_cond 0
% 3.92/3.36 % AC symbols 0
% 3.92/3.36
% 3.92/3.36 % ------ Schedule dynamic 5 is on
% 3.92/3.36
% 3.92/3.36 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.92/3.36
% 3.92/3.36
% 3.92/3.36 % ------
% 3.92/3.36 % Current options:
% 3.92/3.36 % ------
% 3.92/3.36
% 3.92/3.36
% 3.92/3.36 %
% 3.92/3.36
% 3.92/3.36 % ------ Proving...
% 3.92/3.36 %
% 3.92/3.36
% 3.92/3.36 % SZS status Unsatisfiable for theBenchmark.p
% 3.92/3.36
% 3.92/3.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.92/3.36
% 3.92/3.36
%------------------------------------------------------------------------------