TSTP Solution File: MGT044+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT044+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 : n006.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:35 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 13 unt; 3 typ; 0 def)
% Number of atoms : 145 ( 25 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 151 ( 55 ~; 44 |; 33 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 95 ( 83 !; 12 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_7,type,
sQ4_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_8,type,
sQ5_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_9,type,
sQ6_eqProxy: ( $real * $real ) > $o ).
fof(f188,plain,
$false,
inference(resolution,[],[f164,f70]) ).
fof(f70,plain,
! [X1] : smaller_or_equal(X1,X1),
inference(literal_reordering,[],[f57]) ).
fof(f57,plain,
! [X1] : smaller_or_equal(X1,X1),
inference(equality_resolution,[],[f51]) ).
fof(f51,plain,
! [X0,X1] :
( smaller_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1] :
( smaller_or_equal(X0,X1)
| ( X0 != X1
& ~ smaller(X0,X1) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X1,X0] :
( smaller_or_equal(X1,X0)
| ( X0 != X1
& ~ smaller(X1,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ( smaller(X1,X0)
| X0 = X1 )
=> smaller_or_equal(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( smaller_or_equal(X1,X0)
<=> ( smaller(X1,X0)
| X0 = X1 ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( ( X0 = X1
| smaller(X0,X1) )
<=> smaller_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_smaller_or_equal) ).
fof(f164,plain,
! [X0] : ~ smaller_or_equal(internal_friction(sK1,X0),internal_friction(sK1,sK0)),
inference(superposition,[],[f137,f108]) ).
fof(f108,plain,
! [X0,X1] : internal_friction(sK1,X0) = internal_friction(sK1,X1),
inference(resolution,[],[f66,f68]) ).
fof(f68,plain,
organization(sK1),
inference(literal_reordering,[],[f44]) ).
fof(f44,plain,
organization(sK1),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
( greater(age(sK1,sK2),age(sK1,sK0))
& ~ greater(capability(sK1,sK2),capability(sK1,sK0))
& organization(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f34,f35]) ).
fof(f35,plain,
( ? [X0,X1,X2] :
( greater(age(X1,X2),age(X1,X0))
& ~ greater(capability(X1,X2),capability(X1,X0))
& organization(X1) )
=> ( greater(age(sK1,sK2),age(sK1,sK0))
& ~ greater(capability(sK1,sK2),capability(sK1,sK0))
& organization(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
? [X0,X1,X2] :
( greater(age(X1,X2),age(X1,X0))
& ~ greater(capability(X1,X2),capability(X1,X0))
& organization(X1) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
? [X2,X0,X1] :
( greater(age(X0,X1),age(X0,X2))
& ~ greater(capability(X0,X1),capability(X0,X2))
& organization(X0) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
? [X2,X1,X0] :
( ~ greater(capability(X0,X1),capability(X0,X2))
& organization(X0)
& greater(age(X0,X1),age(X0,X2)) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
~ ! [X2,X1,X0] :
( ( organization(X0)
& greater(age(X0,X1),age(X0,X2)) )
=> greater(capability(X0,X1),capability(X0,X2)) ),
inference(rectify,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X4,X3] :
( ( greater(age(X0,X4),age(X0,X3))
& organization(X0) )
=> greater(capability(X0,X4),capability(X0,X3)) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X4,X3] :
( ( greater(age(X0,X4),age(X0,X3))
& organization(X0) )
=> greater(capability(X0,X4),capability(X0,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3) ).
fof(f66,plain,
! [X2,X0,X1] :
( ~ organization(X0)
| internal_friction(X0,X1) = internal_friction(X0,X2) ),
inference(literal_reordering,[],[f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( internal_friction(X0,X1) = internal_friction(X0,X2)
| ~ organization(X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ~ organization(X0)
| internal_friction(X0,X1) = internal_friction(X0,X2) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
! [X0,X2,X1] :
( ~ organization(X0)
| internal_friction(X0,X1) = internal_friction(X0,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
! [X2,X0,X1] :
( organization(X0)
=> internal_friction(X0,X1) = internal_friction(X0,X2) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X0,X4,X3] :
( organization(X0)
=> internal_friction(X0,X4) = internal_friction(X0,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_9) ).
fof(f137,plain,
~ smaller_or_equal(internal_friction(sK1,sK2),internal_friction(sK1,sK0)),
inference(subsumption_resolution,[],[f136,f71]) ).
fof(f71,plain,
~ greater(capability(sK1,sK2),capability(sK1,sK0)),
inference(literal_reordering,[],[f45]) ).
fof(f45,plain,
~ greater(capability(sK1,sK2),capability(sK1,sK0)),
inference(cnf_transformation,[],[f36]) ).
fof(f136,plain,
( greater(capability(sK1,sK2),capability(sK1,sK0))
| ~ smaller_or_equal(internal_friction(sK1,sK2),internal_friction(sK1,sK0)) ),
inference(subsumption_resolution,[],[f132,f68]) ).
fof(f132,plain,
( ~ organization(sK1)
| greater(capability(sK1,sK2),capability(sK1,sK0))
| ~ smaller_or_equal(internal_friction(sK1,sK2),internal_friction(sK1,sK0)) ),
inference(resolution,[],[f113,f59]) ).
fof(f59,plain,
! [X2,X0,X1] :
( ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X0))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X0))
| ~ organization(X1)
| greater(capability(X1,X2),capability(X1,X0)) ),
inference(literal_reordering,[],[f54]) ).
fof(f54,plain,
! [X2,X0,X1] :
( ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X0))
| greater(capability(X1,X2),capability(X1,X0))
| ~ organization(X1)
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X0)) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ~ organization(X1)
| ( ( greater(capability(X1,X2),capability(X1,X0))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X0))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X0)) )
& ( ~ greater(internal_friction(X1,X2),internal_friction(X1,X0))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X0))
| smaller(capability(X1,X2),capability(X1,X0)) )
& ( internal_friction(X1,X2) != internal_friction(X1,X0)
| capability(X1,X2) = capability(X1,X0)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X0) ) ) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
! [X1,X2,X0] :
( ( ( smaller(capability(X1,X2),capability(X1,X0))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X0))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X0)) )
& ( greater(capability(X1,X2),capability(X1,X0))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X0))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X0)) )
& ( capability(X1,X2) = capability(X1,X0)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X0)
| internal_friction(X1,X2) != internal_friction(X1,X0) ) )
| ~ organization(X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
! [X1,X2,X0] :
( organization(X1)
=> ( ( ( greater(internal_friction(X1,X2),internal_friction(X1,X0))
& smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X0)) )
=> smaller(capability(X1,X2),capability(X1,X0)) )
& ( ( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X0))
& smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X0)) )
=> greater(capability(X1,X2),capability(X1,X0)) )
& ( ( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X0)
& internal_friction(X1,X2) = internal_friction(X1,X0) )
=> capability(X1,X2) = capability(X1,X0) ) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X3,X0,X4] :
( organization(X0)
=> ( ( ( greater(internal_friction(X0,X4),internal_friction(X0,X3))
& smaller_or_equal(stock_of_knowledge(X0,X4),stock_of_knowledge(X0,X3)) )
=> smaller(capability(X0,X4),capability(X0,X3)) )
& ( ( smaller_or_equal(internal_friction(X0,X4),internal_friction(X0,X3))
& greater(stock_of_knowledge(X0,X4),stock_of_knowledge(X0,X3)) )
=> greater(capability(X0,X4),capability(X0,X3)) )
& ( ( internal_friction(X0,X4) = internal_friction(X0,X3)
& stock_of_knowledge(X0,X4) = stock_of_knowledge(X0,X3) )
=> capability(X0,X4) = capability(X0,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_5) ).
fof(f113,plain,
greater(stock_of_knowledge(sK1,sK2),stock_of_knowledge(sK1,sK0)),
inference(subsumption_resolution,[],[f112,f68]) ).
fof(f112,plain,
( ~ organization(sK1)
| greater(stock_of_knowledge(sK1,sK2),stock_of_knowledge(sK1,sK0)) ),
inference(resolution,[],[f61,f64]) ).
fof(f64,plain,
greater(age(sK1,sK2),age(sK1,sK0)),
inference(literal_reordering,[],[f46]) ).
fof(f46,plain,
greater(age(sK1,sK2),age(sK1,sK0)),
inference(cnf_transformation,[],[f36]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ greater(age(X2,X1),age(X2,X0))
| greater(stock_of_knowledge(X2,X1),stock_of_knowledge(X2,X0))
| ~ organization(X2) ),
inference(literal_reordering,[],[f56]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ greater(age(X2,X1),age(X2,X0))
| greater(stock_of_knowledge(X2,X1),stock_of_knowledge(X2,X0))
| ~ organization(X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ~ greater(age(X2,X1),age(X2,X0))
| greater(stock_of_knowledge(X2,X1),stock_of_knowledge(X2,X0))
| ~ organization(X2) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X1,X2,X0] :
( ~ greater(age(X0,X2),age(X0,X1))
| greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
| ~ organization(X0) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X1,X2,X0] :
( greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
| ~ greater(age(X0,X2),age(X0,X1))
| ~ organization(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X2,X0] :
( ( greater(age(X0,X2),age(X0,X1))
& organization(X0) )
=> greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1)) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X0,X3,X4] :
( ( greater(age(X0,X4),age(X0,X3))
& organization(X0) )
=> greater(stock_of_knowledge(X0,X4),stock_of_knowledge(X0,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_7) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT044+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.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 03:17:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.48 % (1373)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 (2999ds/68Mi)
% 0.20/0.49 % (1381)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 (2999ds/498Mi)
% 0.20/0.49 % (1365)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.49 TRYING [1]
% 0.20/0.49 TRYING [2]
% 0.20/0.49 TRYING [3]
% 0.20/0.49 % (1367)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.49 % (1367)Instruction limit reached!
% 0.20/0.49 % (1367)------------------------------
% 0.20/0.49 % (1367)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (1367)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (1367)Termination reason: Unknown
% 0.20/0.49 % (1367)Termination phase: Preprocessing 3
% 0.20/0.49
% 0.20/0.49 % (1367)Memory used [KB]: 895
% 0.20/0.49 % (1367)Time elapsed: 0.002 s
% 0.20/0.49 % (1367)Instructions burned: 2 (million)
% 0.20/0.49 % (1367)------------------------------
% 0.20/0.49 % (1367)------------------------------
% 0.20/0.50 % (1366)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50 % (1369)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50 % (1368)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (1370)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.50 TRYING [4]
% 0.20/0.50 % (1360)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (1380)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.51 TRYING [5]
% 0.20/0.51 % (1360)Refutation not found, incomplete strategy% (1360)------------------------------
% 0.20/0.51 % (1360)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (1360)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (1360)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (1360)Memory used [KB]: 5373
% 0.20/0.51 % (1360)Time elapsed: 0.122 s
% 0.20/0.51 % (1360)Instructions burned: 3 (million)
% 0.20/0.51 % (1360)------------------------------
% 0.20/0.51 % (1360)------------------------------
% 0.20/0.51 % (1373)First to succeed.
% 0.20/0.51 % (1373)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (1373)------------------------------
% 0.20/0.51 % (1373)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (1373)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (1373)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (1373)Memory used [KB]: 5756
% 0.20/0.51 % (1373)Time elapsed: 0.009 s
% 0.20/0.51 % (1373)Instructions burned: 8 (million)
% 0.20/0.51 % (1373)------------------------------
% 0.20/0.51 % (1373)------------------------------
% 0.20/0.51 % (1358)Success in time 0.17 s
%------------------------------------------------------------------------------