TSTP Solution File: MGT059+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : MGT059+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_uns --cores 0 -t %d %s
% Computer : n021.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:13 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 140 ( 46 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 158 ( 47 ~; 41 |; 52 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 33 ( 21 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f87,plain,
$false,
inference(subsumption_resolution,[],[f82,f86]) ).
fof(f86,plain,
very_low != sF3,
inference(backward_demodulation,[],[f43,f78]) ).
fof(f78,plain,
very_low = sF4,
inference(subsumption_resolution,[],[f77,f30]) ).
fof(f30,plain,
has_immunity(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( has_immunity(sK0,sK2)
& hazard_of_mortality(sK0,sK2) != hazard_of_mortality(sK0,sK1)
& has_immunity(sK0,sK1)
& organization(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f23,f24]) ).
fof(f24,plain,
( ? [X0,X1,X2] :
( has_immunity(X0,X2)
& hazard_of_mortality(X0,X2) != hazard_of_mortality(X0,X1)
& has_immunity(X0,X1)
& organization(X0) )
=> ( has_immunity(sK0,sK2)
& hazard_of_mortality(sK0,sK2) != hazard_of_mortality(sK0,sK1)
& has_immunity(sK0,sK1)
& organization(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1,X2] :
( has_immunity(X0,X2)
& hazard_of_mortality(X0,X2) != hazard_of_mortality(X0,X1)
& has_immunity(X0,X1)
& organization(X0) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
? [X2,X1,X0] :
( has_immunity(X2,X0)
& hazard_of_mortality(X2,X0) != hazard_of_mortality(X2,X1)
& has_immunity(X2,X1)
& organization(X2) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
? [X2,X1,X0] :
( hazard_of_mortality(X2,X0) != hazard_of_mortality(X2,X1)
& organization(X2)
& has_immunity(X2,X0)
& has_immunity(X2,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
~ ! [X2,X1,X0] :
( ( organization(X2)
& has_immunity(X2,X0)
& has_immunity(X2,X1) )
=> hazard_of_mortality(X2,X0) = hazard_of_mortality(X2,X1) ),
inference(rectify,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X4,X3,X0] :
( ( has_immunity(X0,X4)
& organization(X0)
& has_immunity(X0,X3) )
=> hazard_of_mortality(X0,X3) = hazard_of_mortality(X0,X4) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X4,X3,X0] :
( ( has_immunity(X0,X4)
& organization(X0)
& has_immunity(X0,X3) )
=> hazard_of_mortality(X0,X3) = hazard_of_mortality(X0,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_2) ).
fof(f77,plain,
( ~ has_immunity(sK0,sK1)
| very_low = sF4 ),
inference(subsumption_resolution,[],[f76,f29]) ).
fof(f29,plain,
organization(sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f76,plain,
( ~ organization(sK0)
| ~ has_immunity(sK0,sK1)
| very_low = sF4 ),
inference(superposition,[],[f42,f35]) ).
fof(f35,plain,
! [X0,X1] :
( very_low = hazard_of_mortality(X0,X1)
| ~ has_immunity(X0,X1)
| ~ organization(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ~ organization(X0)
| ( ( has_immunity(X0,X1)
| ( ( low = hazard_of_mortality(X0,X1)
| ~ positional_advantage(X0,X1)
| ~ is_aligned(X0,X1) )
& ( ~ positional_advantage(X0,X1)
| mod1 = hazard_of_mortality(X0,X1)
| is_aligned(X0,X1) )
& ( mod2 = hazard_of_mortality(X0,X1)
| positional_advantage(X0,X1)
| ~ is_aligned(X0,X1) )
& ( positional_advantage(X0,X1)
| is_aligned(X0,X1)
| high = hazard_of_mortality(X0,X1) ) ) )
& ( ~ has_immunity(X0,X1)
| very_low = hazard_of_mortality(X0,X1) ) ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( ~ organization(X1)
| ( ( has_immunity(X1,X0)
| ( ( low = hazard_of_mortality(X1,X0)
| ~ positional_advantage(X1,X0)
| ~ is_aligned(X1,X0) )
& ( ~ positional_advantage(X1,X0)
| mod1 = hazard_of_mortality(X1,X0)
| is_aligned(X1,X0) )
& ( mod2 = hazard_of_mortality(X1,X0)
| positional_advantage(X1,X0)
| ~ is_aligned(X1,X0) )
& ( positional_advantage(X1,X0)
| is_aligned(X1,X0)
| high = hazard_of_mortality(X1,X0) ) ) )
& ( ~ has_immunity(X1,X0)
| very_low = hazard_of_mortality(X1,X0) ) ) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
! [X1,X0] :
( ( ( ( ( mod1 = hazard_of_mortality(X1,X0)
| is_aligned(X1,X0)
| ~ positional_advantage(X1,X0) )
& ( high = hazard_of_mortality(X1,X0)
| is_aligned(X1,X0)
| positional_advantage(X1,X0) )
& ( mod2 = hazard_of_mortality(X1,X0)
| positional_advantage(X1,X0)
| ~ is_aligned(X1,X0) )
& ( low = hazard_of_mortality(X1,X0)
| ~ is_aligned(X1,X0)
| ~ positional_advantage(X1,X0) ) )
| has_immunity(X1,X0) )
& ( ~ has_immunity(X1,X0)
| very_low = hazard_of_mortality(X1,X0) ) )
| ~ organization(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
! [X1,X0] :
( organization(X1)
=> ( ( ~ has_immunity(X1,X0)
=> ( ( ( ~ is_aligned(X1,X0)
& positional_advantage(X1,X0) )
=> mod1 = hazard_of_mortality(X1,X0) )
& ( ( ~ is_aligned(X1,X0)
& ~ positional_advantage(X1,X0) )
=> high = hazard_of_mortality(X1,X0) )
& ( ( ~ positional_advantage(X1,X0)
& is_aligned(X1,X0) )
=> mod2 = hazard_of_mortality(X1,X0) )
& ( ( is_aligned(X1,X0)
& positional_advantage(X1,X0) )
=> low = hazard_of_mortality(X1,X0) ) ) )
& ( has_immunity(X1,X0)
=> very_low = hazard_of_mortality(X1,X0) ) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X3,X0] :
( organization(X0)
=> ( ( ~ has_immunity(X0,X3)
=> ( ( ( positional_advantage(X0,X3)
& is_aligned(X0,X3) )
=> hazard_of_mortality(X0,X3) = low )
& ( ( ~ positional_advantage(X0,X3)
& ~ is_aligned(X0,X3) )
=> hazard_of_mortality(X0,X3) = high )
& ( ( ~ positional_advantage(X0,X3)
& is_aligned(X0,X3) )
=> hazard_of_mortality(X0,X3) = mod2 )
& ( ( positional_advantage(X0,X3)
& ~ is_aligned(X0,X3) )
=> hazard_of_mortality(X0,X3) = mod1 ) ) )
& ( has_immunity(X0,X3)
=> hazard_of_mortality(X0,X3) = very_low ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_17) ).
fof(f42,plain,
hazard_of_mortality(sK0,sK1) = sF4,
introduced(function_definition,[]) ).
fof(f43,plain,
sF3 != sF4,
inference(definition_folding,[],[f31,f42,f41]) ).
fof(f41,plain,
sF3 = hazard_of_mortality(sK0,sK2),
introduced(function_definition,[]) ).
fof(f31,plain,
hazard_of_mortality(sK0,sK2) != hazard_of_mortality(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f82,plain,
very_low = sF3,
inference(subsumption_resolution,[],[f81,f29]) ).
fof(f81,plain,
( ~ organization(sK0)
| very_low = sF3 ),
inference(subsumption_resolution,[],[f73,f32]) ).
fof(f32,plain,
has_immunity(sK0,sK2),
inference(cnf_transformation,[],[f25]) ).
fof(f73,plain,
( ~ has_immunity(sK0,sK2)
| ~ organization(sK0)
| very_low = sF3 ),
inference(superposition,[],[f35,f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT059+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_uns --cores 0 -t %d %s
% 0.13/0.33 % Computer : n021.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:19:10 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.49 % (11205)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.49 % (11198)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.50 % (11202)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50 % (11202)Refutation not found, incomplete strategy% (11202)------------------------------
% 0.20/0.50 % (11202)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (11202)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (11202)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50
% 0.20/0.50 % (11202)Memory used [KB]: 5884
% 0.20/0.50 % (11202)Time elapsed: 0.109 s
% 0.20/0.50 % (11202)------------------------------
% 0.20/0.50 % (11202)------------------------------
% 0.20/0.50 % (11200)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50 % (11198)First to succeed.
% 0.20/0.50 % (11221)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.50 % (11205)Also succeeded, but the first one will report.
% 0.20/0.50 % (11198)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (11198)------------------------------
% 0.20/0.50 % (11198)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (11198)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (11198)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (11198)Memory used [KB]: 6012
% 0.20/0.50 % (11198)Time elapsed: 0.101 s
% 0.20/0.50 % (11198)Instructions burned: 4 (million)
% 0.20/0.50 % (11198)------------------------------
% 0.20/0.50 % (11198)------------------------------
% 0.20/0.50 % (11197)Success in time 0.163 s
%------------------------------------------------------------------------------