%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL174-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 : 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:05:50 PM UTC 2026
% Result : Unsatisfiable 2.34s 1.18s
% Output : CNFRefutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 36 ( 30 unt; 9 def)
% Number of atoms : 89 ( 10 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 23 ( 14 ~; 9 |; 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 : 13 ( 11 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
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,negated_conjecture,
~ theorem(implies(implies(p,q),implies(implies(q,r),implies(p,r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,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(f15,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))),
inference(definition_unfolding,[],[f9,f6,f6,f6,f6,f6]) ).
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,[],[f13]) ).
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,[],[f14]) ).
tcf(c_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_65,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_109,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_63,c_61]) ).
tcf(c_114,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_63,c_62]) ).
tcf(c_142,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_143,definition,
iPr_def_11 = or(iPr_def_10,q),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_144,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_145,definition,
iPr_def_13 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_146,definition,
iPr_def_14 = or(iPr_def_13,r),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_147,definition,
iPr_def_15 = not(iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_148,definition,
iPr_def_16 = or(iPr_def_10,r),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_149,definition,
iPr_def_17 = or(iPr_def_15,iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_150,definition,
iPr_def_18 = or(iPr_def_12,iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_151,negated_conjecture,
~ theorem(iPr_def_18),
inference(demodulation,[status(thm)],[c_65,c_148,c_145,c_146,c_147,c_149,c_142,c_143,c_144,c_150]) ).
tcf(c_439,plain,
! [X0: $i] : theorem(or(not(or(iPr_def_15,or(X0,iPr_def_16))),or(X0,iPr_def_17))),
inference(superposition,[status(thm)],[c_149,c_109]) ).
tcf(c_619,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_143,c_114]) ).
tcf(c_632,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_619,c_144,c_145]) ).
tcf(c_1217,plain,
theorem(or(not(or(iPr_def_15,or(iPr_def_12,iPr_def_16))),iPr_def_18)),
inference(superposition,[status(thm)],[c_150,c_439]) ).
tcf(c_1224,plain,
( theorem(iPr_def_18)
| ~ theorem(or(iPr_def_15,or(iPr_def_12,iPr_def_16))) ),
inference(superposition,[status(thm)],[c_1217,c_64]) ).
tcf(c_1226,plain,
~ theorem(or(iPr_def_15,or(iPr_def_12,iPr_def_16))),
inference(forward_subsumption_resolution,[status(thm)],[c_1224,c_151]) ).
tcf(c_1268,plain,
theorem(or(not(or(iPr_def_13,r)),or(iPr_def_12,iPr_def_16))),
inference(superposition,[status(thm)],[c_148,c_632]) ).
tcf(c_1271,plain,
theorem(or(iPr_def_15,or(iPr_def_12,iPr_def_16))),
inference(light_normalisation,[status(thm)],[c_1268,c_146,c_147]) ).
tcf(c_1272,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1271,c_1226]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL174-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.09/0.38 % Computer : n002.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Wed Sep 23 22:12:49 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/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.09/0.43
% 0.09/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 2.34/1.18 % SZS status Started for theBenchmark.p
% 2.34/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.34/1.18
% 2.34/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.34/1.18
% 2.34/1.18 % ------ iProver source info
% 2.34/1.18
% 2.34/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.34/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.34/1.18 % git: non_committed_changes: false
% 2.34/1.18
% 2.34/1.18 % ------ Parsing...% successful
% 2.34/1.18
% 2.34/1.18
% 2.34/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.34/1.18
% 2.34/1.18 % ------ 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.34/1.18
% 2.34/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.34/1.18
% 2.34/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.34/1.18 % ------ Proving...
% 2.34/1.18 % ------ Problem Properties
% 2.34/1.18
% 2.34/1.18 %
% 2.34/1.18 % clauses 16
% 2.34/1.18 % conjectures 1
% 2.34/1.18 % EPR 1
% 2.34/1.18 % Horn 16
% 2.34/1.18 % unary 15
% 2.34/1.18 % binary 0
% 2.34/1.18 % lits 18
% 2.34/1.18 % lits eq 9
% 2.34/1.18 % fd_pure 0
% 2.34/1.18 % fd_pseudo 0
% 2.34/1.18 % fd_cond 0
% 2.34/1.18 % fd_pseudo_cond 0
% 2.34/1.18 % AC symbols 0
% 2.34/1.18
% 2.34/1.18 % ------ Schedule dynamic 5 is on
% 2.34/1.18
% 2.34/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.34/1.18
% 2.34/1.18
% 2.34/1.18 % ------
% 2.34/1.18 % Current options:
% 2.34/1.18 % ------
% 2.34/1.18
% 2.34/1.18
% 2.34/1.18 %
% 2.34/1.18
% 2.34/1.18 % ------ Proving...
% 2.34/1.18 %
% 2.34/1.18
% 2.34/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.34/1.18
% 2.34/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.34/1.18
% 2.34/1.18
%------------------------------------------------------------------------------