%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT058-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.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:12:58 PM UTC 2026
% Result : Unsatisfiable 3.25s 1.27s
% Output : CNFRefutation 3.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 22 unt; 1 def)
% Number of atoms : 134 ( 31 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 82 ( 36 ~; 46 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 28 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( smaller_or_equal(X0,X1)
| ~ smaller(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_2) ).
fof(f3,axiom,
! [X0,X1] :
( smaller_or_equal(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_3) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| ~ greater_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_greater_or_equal_4) ).
fof(f8,axiom,
! [X0,X1] :
( smaller(X1,X0)
| ~ greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_8) ).
fof(f12,axiom,
! [X0,X1] :
( positional_advantage(X0,X1)
| ~ smaller_or_equal(age(X0,X1),sigma)
| ~ fragile_position(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_3_30) ).
fof(f18,axiom,
! [X0,X1] :
( ~ positional_advantage(X0,X1)
| ~ smaller_or_equal(age(X0,X1),tau)
| ~ robust_position(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_4_36) ).
fof(f25,negated_conjecture,
age(sk3,sk4) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_43) ).
fof(f26,negated_conjecture,
greater_or_equal(sigma,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_44) ).
fof(f27,negated_conjecture,
greater_or_equal(tau,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_45) ).
fof(f28,negated_conjecture,
fragile_position(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_46) ).
fof(f29,negated_conjecture,
robust_position(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_47) ).
fof(f30,plain,
! [X1] : smaller_or_equal(X1,X1),
inference(equality_resolution,[],[f3]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( smaller_or_equal(X0,X1)
| ~ smaller(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_80,plain,
! [X0: $i] : smaller_or_equal(X0,X0),
inference(cnf_transformation,[],[f30]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ( X0 = X1 )
| ~ greater_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] :
( smaller(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i] :
( positional_advantage(X0,X1)
| ~ fragile_position(X0)
| ~ smaller_or_equal(age(X0,X1),sigma) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i] :
( ~ robust_position(X0)
| ~ positional_advantage(X0,X1)
| ~ smaller_or_equal(age(X0,X1),tau) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_99,negated_conjecture,
age(sk3,sk4) = zero,
inference(cnf_transformation,[],[f25]) ).
tcf(c_100,negated_conjecture,
greater_or_equal(sigma,zero),
inference(cnf_transformation,[],[f26]) ).
tcf(c_101,negated_conjecture,
greater_or_equal(tau,zero),
inference(cnf_transformation,[],[f27]) ).
tcf(c_102,negated_conjecture,
fragile_position(sk3),
inference(cnf_transformation,[],[f28]) ).
tcf(c_103,negated_conjecture,
robust_position(sk3),
inference(cnf_transformation,[],[f29]) ).
tcf(c_354,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ( X0 = X1 )
| ( X1 != zero )
| ( X0 != sigma ) ),
inference(resolution_lifted,[status(thm)],[c_100,c_81]) ).
tcf(c_355,plain,
( greater(sigma,zero)
| ( sigma = zero ) ),
inference(unflattening,[status(thm)],[c_354]) ).
tcf(c_362,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ( X0 = X1 )
| ( X1 != zero )
| ( X0 != tau ) ),
inference(resolution_lifted,[status(thm)],[c_101,c_81]) ).
tcf(c_363,plain,
( greater(tau,zero)
| ( tau = zero ) ),
inference(unflattening,[status(thm)],[c_362]) ).
tcf(c_2234,definition,
iPr_def_10 = age(sk3,sk4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2235,plain,
( greater(tau,zero)
| ( tau = zero ) ),
inference(demodulation,[status(thm)],[c_363]) ).
tcf(c_2236,plain,
( greater(sigma,zero)
| ( sigma = zero ) ),
inference(demodulation,[status(thm)],[c_355]) ).
tcf(c_2237,negated_conjecture,
robust_position(sk3),
inference(demodulation,[status(thm)],[c_103]) ).
tcf(c_2238,negated_conjecture,
fragile_position(sk3),
inference(demodulation,[status(thm)],[c_102]) ).
tcf(c_2239,negated_conjecture,
iPr_def_10 = zero,
inference(demodulation,[status(thm)],[c_99,c_2234]) ).
tcf(c_2574,plain,
( greater(tau,iPr_def_10)
| ( tau = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_2235,c_2239]) ).
tcf(c_2577,plain,
( greater(sigma,iPr_def_10)
| ( sigma = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_2236,c_2239]) ).
tcf(c_2602,plain,
( smaller(iPr_def_10,tau)
| ( tau = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2574,c_85]) ).
tcf(c_2603,plain,
( smaller(iPr_def_10,sigma)
| ( sigma = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2577,c_85]) ).
tcf(c_2637,plain,
( smaller_or_equal(iPr_def_10,tau)
| ( tau = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2602,c_79]) ).
tcf(c_2645,plain,
( smaller_or_equal(iPr_def_10,sigma)
| ( sigma = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2603,c_79]) ).
tcf(c_2764,plain,
( positional_advantage(sk3,sk4)
| ~ fragile_position(sk3)
| ~ smaller_or_equal(iPr_def_10,sigma) ),
inference(superposition,[status(thm)],[c_2234,c_89]) ).
tcf(c_2765,plain,
( positional_advantage(sk3,sk4)
| ~ smaller_or_equal(iPr_def_10,sigma) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2764,c_2238]) ).
tcf(c_2836,plain,
( positional_advantage(sk3,sk4)
| ( sigma = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2645,c_2765]) ).
tcf(c_3065,plain,
( ~ robust_position(sk3)
| ~ positional_advantage(sk3,sk4)
| ~ smaller_or_equal(iPr_def_10,tau) ),
inference(superposition,[status(thm)],[c_2234,c_94]) ).
tcf(c_3066,plain,
( ~ positional_advantage(sk3,sk4)
| ~ smaller_or_equal(iPr_def_10,tau) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3065,c_2237]) ).
tcf(c_3109,plain,
( ( tau = iPr_def_10 )
| ~ positional_advantage(sk3,sk4) ),
inference(superposition,[status(thm)],[c_2637,c_3066]) ).
tcf(c_3116,plain,
( ( tau = iPr_def_10 )
| ( sigma = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2836,c_3109]) ).
tcf(c_3123,plain,
( ( sigma = iPr_def_10 )
| ~ positional_advantage(sk3,sk4)
| ~ smaller_or_equal(iPr_def_10,iPr_def_10) ),
inference(superposition,[status(thm)],[c_3116,c_3066]) ).
tcf(c_3136,plain,
( ( sigma = iPr_def_10 )
| ~ positional_advantage(sk3,sk4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3123,c_80]) ).
tcf(c_3170,plain,
sigma = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_3136,c_2836,c_3136]) ).
tcf(c_3177,plain,
( positional_advantage(sk3,sk4)
| ~ smaller_or_equal(iPr_def_10,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_2765,c_3170]) ).
tcf(c_3183,plain,
positional_advantage(sk3,sk4),
inference(forward_subsumption_resolution,[status(thm)],[c_3177,c_80]) ).
tcf(c_3200,plain,
tau = iPr_def_10,
inference(backward_subsumption_resolution,[status(thm)],[c_3109,c_3183]) ).
tcf(c_3201,plain,
~ smaller_or_equal(iPr_def_10,tau),
inference(backward_subsumption_resolution,[status(thm)],[c_3066,c_3183]) ).
tcf(c_3232,plain,
~ smaller_or_equal(iPr_def_10,iPr_def_10),
inference(light_normalisation,[status(thm)],[c_3201,c_3200]) ).
tcf(c_3233,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3232,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT058-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 01:18:25 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 3.25/1.27 % SZS status Started for theBenchmark.p
% 3.25/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.25/1.27
% 3.25/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.25/1.27
% 3.25/1.27 % ------ iProver source info
% 3.25/1.27
% 3.25/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.25/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.25/1.27 % git: non_committed_changes: false
% 3.25/1.27
% 3.25/1.27 % ------ Parsing...% successful
% 3.25/1.27
% 3.25/1.27
% 3.25/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.25/1.27
% 3.25/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.25/1.27
% 3.25/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.25/1.27
% 3.25/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.25/1.27 % ------ Proving...
% 3.25/1.27 % ------ Problem Properties
% 3.25/1.27
% 3.25/1.27 %
% 3.25/1.27 % clauses 24
% 3.25/1.27 % conjectures 3
% 3.25/1.27 % EPR 13
% 3.25/1.27 % Horn 14
% 3.25/1.27 % unary 5
% 3.25/1.27 % binary 6
% 3.25/1.27 % lits 56
% 3.25/1.27 % lits eq 6
% 3.25/1.27 % fd_pure 0
% 3.25/1.27 % fd_pseudo 0
% 3.25/1.27 % fd_cond 0
% 3.25/1.27 % fd_pseudo_cond 2
% 3.25/1.27 % AC symbols 0
% 3.25/1.27
% 3.25/1.27 % ------ Schedule dynamic 5 is on
% 3.25/1.27
% 3.25/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.25/1.27
% 3.25/1.27
% 3.25/1.27 % ------
% 3.25/1.27 % Current options:
% 3.25/1.27 % ------
% 3.25/1.27
% 3.25/1.27
% 3.25/1.27 %
% 3.25/1.27
% 3.25/1.27 % ------ Proving...
% 3.25/1.27 %
% 3.25/1.27
% 3.25/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 3.25/1.27
% 3.25/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.25/1.27
% 3.25/1.27
%------------------------------------------------------------------------------