TSTP Solution File: MGT058+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT058+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 17:51:40 EDT 2022
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 92 ( 9 unt; 0 def)
% Number of atoms : 264 ( 42 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 251 ( 79 ~; 87 |; 48 &)
% ( 15 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 93 ( 81 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f263,plain,
$false,
inference(avatar_sat_refutation,[],[f71,f80,f205,f216,f218,f227,f248,f261]) ).
fof(f261,plain,
( ~ spl3_4
| spl3_5 ),
inference(avatar_contradiction_clause,[],[f260]) ).
fof(f260,plain,
( $false
| ~ spl3_4
| spl3_5 ),
inference(subsumption_resolution,[],[f259,f56]) ).
fof(f56,plain,
! [X1] : smaller_or_equal(X1,X1),
inference(equality_resolution,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( smaller_or_equal(X1,X0)
| X0 != X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( smaller_or_equal(X1,X0)
| ( ~ smaller(X1,X0)
& X0 != X1 ) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
! [X1,X0] :
( smaller_or_equal(X0,X1)
| ( ~ smaller(X0,X1)
& X0 != X1 ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
! [X1,X0] :
( ( smaller(X0,X1)
| X0 = X1 )
=> smaller_or_equal(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( smaller_or_equal(X0,X1)
<=> ( smaller(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_smaller_or_equal) ).
fof(f259,plain,
( ~ smaller_or_equal(tau,tau)
| ~ spl3_4
| spl3_5 ),
inference(forward_demodulation,[],[f203,f79]) ).
fof(f79,plain,
( tau = zero
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f77,plain,
( spl3_4
<=> tau = zero ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f203,plain,
( ~ smaller_or_equal(zero,tau)
| spl3_5 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f202,plain,
( spl3_5
<=> smaller_or_equal(zero,tau) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f248,plain,
( ~ spl3_2
| spl3_7 ),
inference(avatar_contradiction_clause,[],[f247]) ).
fof(f247,plain,
( $false
| ~ spl3_2
| spl3_7 ),
inference(subsumption_resolution,[],[f246,f56]) ).
fof(f246,plain,
( ~ smaller_or_equal(sigma,sigma)
| ~ spl3_2
| spl3_7 ),
inference(superposition,[],[f215,f70]) ).
fof(f70,plain,
( sigma = zero
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f68,plain,
( spl3_2
<=> sigma = zero ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f215,plain,
( ~ smaller_or_equal(zero,sigma)
| spl3_7 ),
inference(avatar_component_clause,[],[f213]) ).
fof(f213,plain,
( spl3_7
<=> smaller_or_equal(zero,sigma) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_7])]) ).
fof(f227,plain,
( spl3_2
| ~ spl3_1
| spl3_7 ),
inference(avatar_split_clause,[],[f226,f213,f64,f68]) ).
fof(f64,plain,
( spl3_1
<=> greater(sigma,zero) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f226,plain,
( sigma = zero
| ~ spl3_1
| spl3_7 ),
inference(subsumption_resolution,[],[f219,f215]) ).
fof(f219,plain,
( sigma = zero
| smaller_or_equal(zero,sigma)
| ~ spl3_1 ),
inference(resolution,[],[f66,f119]) ).
fof(f119,plain,
! [X3,X4] :
( ~ greater(X4,X3)
| X3 = X4
| smaller_or_equal(X3,X4) ),
inference(resolution,[],[f111,f43]) ).
fof(f43,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
~ ( greater(X0,X1)
& greater(X1,X0) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
~ ( greater(X0,X1)
& greater(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meaning_postulate_greater_strict) ).
fof(f111,plain,
! [X2,X3] :
( greater(X2,X3)
| X2 = X3
| smaller_or_equal(X2,X3) ),
inference(resolution,[],[f107,f41]) ).
fof(f41,plain,
! [X0,X1] :
( ~ smaller(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( greater(X1,X0)
| ~ smaller(X0,X1) )
& ( smaller(X0,X1)
| ~ greater(X1,X0) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( greater(X1,X0)
<=> smaller(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_smaller) ).
fof(f107,plain,
! [X0,X1] :
( smaller(X0,X1)
| smaller_or_equal(X1,X0)
| X0 = X1 ),
inference(resolution,[],[f60,f45]) ).
fof(f45,plain,
! [X0,X1] :
( ~ smaller(X1,X0)
| smaller_or_equal(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f60,plain,
! [X2,X3] :
( smaller(X3,X2)
| smaller(X2,X3)
| X2 = X3 ),
inference(resolution,[],[f39,f40]) ).
fof(f40,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| smaller(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f39,plain,
! [X0,X1] :
( greater(X0,X1)
| smaller(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| smaller(X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( greater(X1,X0)
| X0 = X1
| smaller(X1,X0) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( smaller(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meaning_postulate_greater_comparable) ).
fof(f66,plain,
( greater(sigma,zero)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f218,plain,
( ~ spl3_5
| ~ spl3_6 ),
inference(avatar_split_clause,[],[f101,f209,f202]) ).
fof(f209,plain,
( spl3_6
<=> positional_advantage(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f101,plain,
( ~ positional_advantage(sK0,sK1)
| ~ smaller_or_equal(zero,tau) ),
inference(forward_demodulation,[],[f100,f58]) ).
fof(f58,plain,
zero = sF2,
inference(definition_folding,[],[f52,f57]) ).
fof(f57,plain,
age(sK0,sK1) = sF2,
introduced(function_definition,[]) ).
fof(f52,plain,
zero = age(sK0,sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& zero = age(sK0,sK1)
& fragile_position(sK0)
& robust_position(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f30,f37,f36]) ).
fof(f36,plain,
( ? [X0] :
( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X1] : zero = age(X0,X1)
& fragile_position(X0)
& robust_position(X0) )
=> ( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X1] : zero = age(sK0,X1)
& fragile_position(sK0)
& robust_position(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
( ? [X1] : zero = age(sK0,X1)
=> zero = age(sK0,sK1) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
? [X0] :
( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X1] : zero = age(X0,X1)
& fragile_position(X0)
& robust_position(X0) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
? [X0] :
( fragile_position(X0)
& robust_position(X0)
& ? [X1] : zero = age(X0,X1)
& greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
~ ! [X0] :
( ( ? [X1] : zero = age(X0,X1)
& greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero) )
=> ~ ( fragile_position(X0)
& robust_position(X0) ) ),
inference(pure_predicate_removal,[],[f15]) ).
fof(f15,plain,
~ ! [X0] :
( ( organization(X0)
& ? [X1] : zero = age(X0,X1)
& greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero) )
=> ~ ( fragile_position(X0)
& robust_position(X0) ) ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0] :
( ( organization(X0)
& ? [X4] : age(X0,X4) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero) )
=> ~ ( fragile_position(X0)
& robust_position(X0) ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0] :
( ( organization(X0)
& ? [X4] : age(X0,X4) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero) )
=> ~ ( fragile_position(X0)
& robust_position(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_10) ).
fof(f100,plain,
( ~ positional_advantage(sK0,sK1)
| ~ smaller_or_equal(sF2,tau) ),
inference(subsumption_resolution,[],[f99,f50]) ).
fof(f50,plain,
robust_position(sK0),
inference(cnf_transformation,[],[f38]) ).
fof(f99,plain,
( ~ smaller_or_equal(sF2,tau)
| ~ positional_advantage(sK0,sK1)
| ~ robust_position(sK0) ),
inference(superposition,[],[f46,f57]) ).
fof(f46,plain,
! [X0,X1] :
( ~ smaller_or_equal(age(X0,X1),tau)
| ~ robust_position(X0)
| ~ positional_advantage(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0] :
( ~ robust_position(X0)
| ! [X1] :
( ( ~ greater(age(X0,X1),tau)
| positional_advantage(X0,X1) )
& ( ~ smaller_or_equal(age(X0,X1),tau)
| ~ positional_advantage(X0,X1) ) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0] :
( robust_position(X0)
=> ! [X1] :
( ( smaller_or_equal(age(X0,X1),tau)
=> ~ positional_advantage(X0,X1) )
& ( greater(age(X0,X1),tau)
=> positional_advantage(X0,X1) ) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f11,plain,
! [X0] :
( robust_position(X0)
<=> ! [X1] :
( ( smaller_or_equal(age(X0,X1),tau)
=> ~ positional_advantage(X0,X1) )
& ( greater(age(X0,X1),tau)
=> positional_advantage(X0,X1) ) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( robust_position(X0)
<=> ! [X3] :
( ( smaller_or_equal(age(X0,X3),tau)
=> ~ positional_advantage(X0,X3) )
& ( greater(age(X0,X3),tau)
=> positional_advantage(X0,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_4) ).
fof(f216,plain,
( spl3_6
| ~ spl3_7 ),
inference(avatar_split_clause,[],[f207,f213,f209]) ).
fof(f207,plain,
( ~ smaller_or_equal(zero,sigma)
| positional_advantage(sK0,sK1) ),
inference(forward_demodulation,[],[f206,f58]) ).
fof(f206,plain,
( positional_advantage(sK0,sK1)
| ~ smaller_or_equal(sF2,sigma) ),
inference(subsumption_resolution,[],[f194,f51]) ).
fof(f51,plain,
fragile_position(sK0),
inference(cnf_transformation,[],[f38]) ).
fof(f194,plain,
( positional_advantage(sK0,sK1)
| ~ fragile_position(sK0)
| ~ smaller_or_equal(sF2,sigma) ),
inference(superposition,[],[f48,f57]) ).
fof(f48,plain,
! [X0,X1] :
( ~ smaller_or_equal(age(X0,X1),sigma)
| positional_advantage(X0,X1)
| ~ fragile_position(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] :
( ! [X1] :
( ( ~ positional_advantage(X0,X1)
| ~ greater(age(X0,X1),sigma) )
& ( ~ smaller_or_equal(age(X0,X1),sigma)
| positional_advantage(X0,X1) ) )
| ~ fragile_position(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0] :
( fragile_position(X0)
=> ! [X1] :
( ( smaller_or_equal(age(X0,X1),sigma)
=> positional_advantage(X0,X1) )
& ( greater(age(X0,X1),sigma)
=> ~ positional_advantage(X0,X1) ) ) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f16,plain,
! [X0] :
( ! [X1] :
( ( smaller_or_equal(age(X0,X1),sigma)
=> positional_advantage(X0,X1) )
& ( greater(age(X0,X1),sigma)
=> ~ positional_advantage(X0,X1) ) )
<=> fragile_position(X0) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ! [X3] :
( ( smaller_or_equal(age(X0,X3),sigma)
=> positional_advantage(X0,X3) )
& ( greater(age(X0,X3),sigma)
=> ~ positional_advantage(X0,X3) ) )
<=> fragile_position(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_3) ).
fof(f205,plain,
( spl3_4
| spl3_5
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f147,f73,f202,f77]) ).
fof(f73,plain,
( spl3_3
<=> greater(tau,zero) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f147,plain,
( smaller_or_equal(zero,tau)
| tau = zero
| ~ spl3_3 ),
inference(resolution,[],[f119,f75]) ).
fof(f75,plain,
( greater(tau,zero)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f80,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f62,f77,f73]) ).
fof(f62,plain,
( tau = zero
| greater(tau,zero) ),
inference(resolution,[],[f42,f54]) ).
fof(f54,plain,
greater_or_equal(tau,zero),
inference(cnf_transformation,[],[f38]) ).
fof(f42,plain,
! [X0,X1] :
( ~ greater_or_equal(X1,X0)
| greater(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( X0 = X1
| greater(X1,X0)
| ~ greater_or_equal(X1,X0) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( greater(X1,X0)
| X0 = X1
| ~ greater_or_equal(X1,X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( greater_or_equal(X1,X0)
=> ( greater(X1,X0)
| X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( greater_or_equal(X1,X0)
<=> ( greater(X1,X0)
| X0 = X1 ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( greater_or_equal(X0,X1)
<=> ( X0 = X1
| greater(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_greater_or_equal) ).
fof(f71,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f61,f68,f64]) ).
fof(f61,plain,
( sigma = zero
| greater(sigma,zero) ),
inference(resolution,[],[f42,f53]) ).
fof(f53,plain,
greater_or_equal(sigma,zero),
inference(cnf_transformation,[],[f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT058+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 03:43:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 % (13155)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.18/0.46 % (13146)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.18/0.46 % (13146)First to succeed.
% 0.18/0.46 % (13147)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.18/0.47 % (13138)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.18/0.48 % (13139)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.18/0.48 TRYING [1]
% 0.18/0.48 TRYING [2]
% 0.18/0.48 TRYING [3]
% 0.18/0.48 TRYING [4]
% 0.18/0.49 TRYING [5]
% 0.18/0.49 % (13146)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (13146)------------------------------
% 0.18/0.49 % (13146)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (13146)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (13146)Termination reason: Refutation
% 0.18/0.49
% 0.18/0.49 % (13146)Memory used [KB]: 5500
% 0.18/0.49 % (13146)Time elapsed: 0.085 s
% 0.18/0.49 % (13146)Instructions burned: 6 (million)
% 0.18/0.49 % (13146)------------------------------
% 0.18/0.49 % (13146)------------------------------
% 0.18/0.49 % (13132)Success in time 0.153 s
%------------------------------------------------------------------------------