TSTP Solution File: KRS003_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KRS003_1 : TPTP v8.1.0. Released v5.0.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 : n009.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:30:34 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 24
% Syntax : Number of formulae : 57 ( 8 unt; 15 typ; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 98 ( 47 ~; 37 |; 6 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 14 ( 12 >; 2 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 44 ( 44 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
unreal: $tType ).
tff(type_def_6,type,
real: $tType ).
tff(func_def_0,type,
u1r1: unreal > real ).
tff(func_def_1,type,
u1r2: unreal > real ).
tff(func_def_2,type,
u3r1: unreal > real ).
tff(func_def_3,type,
u3r2: unreal > real ).
tff(func_def_4,type,
exist: unreal ).
tff(pred_def_1,type,
f: unreal > $o ).
tff(pred_def_2,type,
d: unreal > $o ).
tff(pred_def_3,type,
e: unreal > $o ).
tff(pred_def_4,type,
s1most: unreal > $o ).
tff(pred_def_5,type,
s: ( unreal * real ) > $o ).
tff(pred_def_6,type,
c: unreal > $o ).
tff(pred_def_7,type,
equalish: ( real * real ) > $o ).
tff(pred_def_8,type,
s2least: unreal > $o ).
tff(f75,plain,
$false,
inference(subsumption_resolution,[],[f73,f56]) ).
tff(f56,plain,
s1most(exist),
inference(resolution,[],[f51,f52]) ).
tff(f52,plain,
d(exist),
inference(resolution,[],[f42,f38]) ).
tff(f38,plain,
f(exist),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
( e(exist)
& f(exist) ),
inference(ennf_transformation,[],[f16]) ).
tff(f16,negated_conjecture,
~ ( ~ e(exist)
| ~ f(exist) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
( ~ e(exist)
| ~ f(exist) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1__clause_2) ).
tff(f42,plain,
! [X0: unreal] :
( ~ f(X0)
| d(X0) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
! [X0: unreal] :
( d(X0)
| ~ f(X0) ),
inference(ennf_transformation,[],[f14]) ).
tff(f14,axiom,
! [X0: unreal] :
( f(X0)
=> d(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
tff(f51,plain,
! [X0: unreal] :
( ~ d(X0)
| s1most(X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
! [X0: unreal] :
( ~ d(X0)
| s1most(X0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,axiom,
! [X0: unreal] :
( d(X0)
=> s1most(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
tff(f73,plain,
~ s1most(exist),
inference(resolution,[],[f71,f54]) ).
tff(f54,plain,
s2least(exist),
inference(resolution,[],[f53,f44]) ).
tff(f44,plain,
! [X0: unreal] :
( ~ c(X0)
| s2least(X0) ),
inference(cnf_transformation,[],[f29]) ).
tff(f29,plain,
! [X0: unreal] :
( ~ c(X0)
| s2least(X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: unreal] :
( c(X0)
=> s2least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
tff(f53,plain,
c(exist),
inference(resolution,[],[f48,f39]) ).
tff(f39,plain,
e(exist),
inference(cnf_transformation,[],[f26]) ).
tff(f48,plain,
! [X0: unreal] :
( ~ e(X0)
| c(X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: unreal] :
( c(X0)
| ~ e(X0) ),
inference(ennf_transformation,[],[f13]) ).
tff(f13,axiom,
! [X0: unreal] :
( e(X0)
=> c(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
tff(f71,plain,
! [X0: unreal] :
( ~ s2least(X0)
| ~ s1most(X0) ),
inference(subsumption_resolution,[],[f70,f50]) ).
tff(f50,plain,
! [X0: unreal] :
( s(X0,u1r2(X0))
| ~ s2least(X0) ),
inference(cnf_transformation,[],[f27]) ).
tff(f27,plain,
! [X0: unreal] :
( ~ s2least(X0)
| s(X0,u1r2(X0)) ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,axiom,
! [X0: unreal] :
( s2least(X0)
=> s(X0,u1r2(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
tff(f70,plain,
! [X0: unreal] :
( ~ s2least(X0)
| ~ s1most(X0)
| ~ s(X0,u1r2(X0)) ),
inference(duplicate_literal_removal,[],[f69]) ).
tff(f69,plain,
! [X0: unreal] :
( ~ s2least(X0)
| ~ s1most(X0)
| ~ s2least(X0)
| ~ s(X0,u1r2(X0)) ),
inference(resolution,[],[f62,f36]) ).
tff(f36,plain,
! [X0: unreal] :
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ s2least(X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: unreal] :
( ~ s2least(X0)
| ~ equalish(u1r2(X0),u1r1(X0)) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,axiom,
! [X0: unreal] :
~ ( s2least(X0)
& equalish(u1r2(X0),u1r1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
tff(f62,plain,
! [X0: unreal,X1: real] :
( equalish(X1,u1r1(X0))
| ~ s2least(X0)
| ~ s(X0,X1)
| ~ s1most(X0) ),
inference(resolution,[],[f49,f43]) ).
tff(f43,plain,
! [X0: unreal] :
( s(X0,u1r1(X0))
| ~ s2least(X0) ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
! [X0: unreal] :
( s(X0,u1r1(X0))
| ~ s2least(X0) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0: unreal] :
( s2least(X0)
=> s(X0,u1r1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
tff(f49,plain,
! [X2: unreal,X0: real,X1: real] :
( ~ s(X2,X1)
| ~ s(X2,X0)
| equalish(X0,X1)
| ~ s1most(X2) ),
inference(cnf_transformation,[],[f35]) ).
tff(f35,plain,
! [X0: real,X1: real,X2: unreal] :
( equalish(X0,X1)
| ~ s(X2,X1)
| ~ s(X2,X0)
| ~ s1most(X2) ),
inference(rectify,[],[f25]) ).
tff(f25,plain,
! [X1: real,X0: real,X2: unreal] :
( equalish(X1,X0)
| ~ s(X2,X0)
| ~ s(X2,X1)
| ~ s1most(X2) ),
inference(flattening,[],[f24]) ).
tff(f24,plain,
! [X0: real,X1: real,X2: unreal] :
( equalish(X1,X0)
| ~ s(X2,X0)
| ~ s1most(X2)
| ~ s(X2,X1) ),
inference(ennf_transformation,[],[f18]) ).
tff(f18,plain,
! [X0: real,X1: real,X2: unreal] :
( ( s(X2,X0)
& s1most(X2)
& s(X2,X1) )
=> equalish(X1,X0) ),
inference(rectify,[],[f9]) ).
tff(f9,axiom,
! [X1: real,X2: real,X0: unreal] :
( ( s(X0,X2)
& s(X0,X1)
& s1most(X0) )
=> equalish(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS003_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.13 % 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.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 00:27:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51 % (6428)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.19/0.51 % (6428)Instruction limit reached!
% 0.19/0.51 % (6428)------------------------------
% 0.19/0.51 % (6428)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (6428)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (6428)Termination reason: Unknown
% 0.19/0.51 % (6428)Termination phase: Blocked clause elimination
% 0.19/0.51
% 0.19/0.51 % (6428)Memory used [KB]: 895
% 0.19/0.51 % (6428)Time elapsed: 0.002 s
% 0.19/0.51 % (6428)Instructions burned: 2 (million)
% 0.19/0.51 % (6428)------------------------------
% 0.19/0.51 % (6428)------------------------------
% 0.19/0.52 % (6421)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.19/0.52 % (6421)Refutation not found, incomplete strategy% (6421)------------------------------
% 0.19/0.52 % (6421)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (6421)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (6421)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.52
% 0.19/0.52 % (6421)Memory used [KB]: 5373
% 0.19/0.52 % (6421)Time elapsed: 0.077 s
% 0.19/0.52 % (6421)Instructions burned: 1 (million)
% 0.19/0.52 % (6421)------------------------------
% 0.19/0.52 % (6421)------------------------------
% 0.19/0.52 % (6444)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.52 % (6444)First to succeed.
% 0.19/0.52 % (6445)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.52 % (6444)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (6444)------------------------------
% 0.19/0.52 % (6444)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (6444)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (6444)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (6444)Memory used [KB]: 5373
% 0.19/0.52 % (6444)Time elapsed: 0.107 s
% 0.19/0.52 % (6444)Instructions burned: 2 (million)
% 0.19/0.52 % (6444)------------------------------
% 0.19/0.52 % (6444)------------------------------
% 0.19/0.52 % (6419)Success in time 0.173 s
%------------------------------------------------------------------------------