%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL274-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:14 PM UTC 2026
% Result : Unsatisfiable 1.77s 1.20s
% Output : CNFRefutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 48 ( 37 unt; 10 def)
% Number of atoms : 110 ( 14 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 36 ( 20 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 14 ( 12 usr; 11 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 45 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(or(p,q),or(q,p))),
file('/export/starexec/sandbox/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(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(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(p,q)),or(q,p))),not(or(not(or(q,p)),or(p,q)))))),
inference(definition_unfolding,[],[f11,f12]) ).
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_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(p,q)),or(q,p))),not(or(not(or(q,p)),or(p,q)))))),
inference(cnf_transformation,[],[f19]) ).
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_144,definition,
iPr_def_10 = or(p,q),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_145,definition,
iPr_def_11 = not(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_146,definition,
iPr_def_12 = or(q,p),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_147,definition,
iPr_def_13 = or(iPr_def_11,iPr_def_12),
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 = not(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_150,definition,
iPr_def_16 = or(iPr_def_15,iPr_def_10),
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 = or(iPr_def_14,iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_153,definition,
iPr_def_19 = not(iPr_def_18),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_154,negated_conjecture,
~ theorem(iPr_def_19),
inference(demodulation,[status(thm)],[c_67,c_149,c_150,c_151,c_146,c_144,c_145,c_147,c_148,c_152,c_153]) ).
tcf(c_296,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(iPr_def_13)
| ~ theorem(or(iPr_def_14,X0)) ),
inference(superposition,[status(thm)],[c_148,c_66]) ).
tcf(c_298,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_371,plain,
theorem(or(not(iPr_def_18),or(iPr_def_17,iPr_def_14))),
inference(superposition,[status(thm)],[c_152,c_106]) ).
tcf(c_372,plain,
theorem(or(not(or(q,p)),iPr_def_10)),
inference(superposition,[status(thm)],[c_144,c_106]) ).
tcf(c_373,plain,
theorem(or(not(or(p,q)),iPr_def_12)),
inference(superposition,[status(thm)],[c_146,c_106]) ).
tcf(c_377,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_106,c_66]) ).
tcf(c_378,plain,
theorem(iPr_def_13),
inference(light_normalisation,[status(thm)],[c_373,c_144,c_145,c_147]) ).
tcf(c_379,plain,
theorem(iPr_def_16),
inference(light_normalisation,[status(thm)],[c_372,c_146,c_149,c_150]) ).
tcf(c_380,plain,
theorem(or(iPr_def_19,or(iPr_def_17,iPr_def_14))),
inference(light_normalisation,[status(thm)],[c_371,c_153]) ).
tcf(c_554,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_706,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(iPr_def_14,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_296,c_296,c_378]) ).
tcf(c_857,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(iPr_def_17,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_298,c_298,c_379]) ).
tcf(c_1345,plain,
theorem(or(iPr_def_17,or(iPr_def_19,iPr_def_14))),
inference(superposition,[status(thm)],[c_380,c_554]) ).
tcf(c_1643,plain,
theorem(or(iPr_def_19,iPr_def_14)),
inference(superposition,[status(thm)],[c_1345,c_857]) ).
tcf(c_1646,plain,
theorem(or(iPr_def_14,iPr_def_19)),
inference(superposition,[status(thm)],[c_1643,c_377]) ).
tcf(c_1667,plain,
theorem(iPr_def_19),
inference(superposition,[status(thm)],[c_1646,c_706]) ).
tcf(c_1669,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1667,c_154]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL274-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n007.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 22:39:22 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 1.77/1.20 % SZS status Started for theBenchmark.p
% 1.77/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 1.77/1.20
% 1.77/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.77/1.20
% 1.77/1.20 % ------ iProver source info
% 1.77/1.20
% 1.77/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 1.77/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.77/1.20 % git: non_committed_changes: false
% 1.77/1.20
% 1.77/1.20 % ------ Parsing...% successful
% 1.77/1.20
% 1.77/1.20
% 1.77/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.77/1.20
% 1.77/1.20 % ------ 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 %
% 1.77/1.20
% 1.77/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.77/1.20
% 1.77/1.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.77/1.20 % ------ Proving...
% 1.77/1.20 % ------ Problem Properties
% 1.77/1.20
% 1.77/1.20 %
% 1.77/1.20 % clauses 17
% 1.77/1.20 % conjectures 1
% 1.77/1.20 % EPR 1
% 1.77/1.20 % Horn 17
% 1.77/1.20 % unary 16
% 1.77/1.20 % binary 0
% 1.77/1.20 % lits 19
% 1.77/1.20 % lits eq 10
% 1.77/1.20 % fd_pure 0
% 1.77/1.20 % fd_pseudo 0
% 1.77/1.20 % fd_cond 0
% 1.77/1.20 % fd_pseudo_cond 0
% 1.77/1.20 % AC symbols 0
% 1.77/1.20
% 1.77/1.20 % ------ Schedule dynamic 5 is on
% 1.77/1.20
% 1.77/1.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.77/1.20
% 1.77/1.20
% 1.77/1.20 % ------
% 1.77/1.20 % Current options:
% 1.77/1.20 % ------
% 1.77/1.20
% 1.77/1.20
% 1.77/1.20 %
% 1.77/1.20
% 1.77/1.20 % ------ Proving...
% 1.77/1.20 %
% 1.77/1.20
% 1.77/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 1.77/1.20
% 1.77/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.77/1.20
% 1.77/1.20
%------------------------------------------------------------------------------