TSTP Solution File: SWV006-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV006-1 : TPTP v8.1.0. Released v1.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 : n022.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 18:55:12 EDT 2022
% Result : Unsatisfiable 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 55 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 25 ~; 21 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f214,plain,
$false,
inference(avatar_sat_refutation,[],[f130,f156,f212]) ).
fof(f212,plain,
~ spl5_6,
inference(avatar_contradiction_clause,[],[f211]) ).
fof(f211,plain,
( $false
| ~ spl5_6 ),
inference(subsumption_resolution,[],[f209,f51]) ).
fof(f51,plain,
~ less_than(sF1,n),
inference(resolution,[],[f10,f39]) ).
fof(f39,plain,
less_than(n,sF1),
inference(superposition,[],[f6,f24]) ).
fof(f24,plain,
successor(n) = sF1,
introduced(function_definition,[]) ).
fof(f6,axiom,
! [X0] : less_than(X0,successor(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_than_successor) ).
fof(f10,axiom,
! [X0,X1] :
( ~ less_than(X1,X0)
| ~ less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',anti_symmetry_of_less_than) ).
fof(f209,plain,
( less_than(sF1,n)
| ~ spl5_6 ),
inference(resolution,[],[f74,f128]) ).
fof(f128,plain,
( less_than(sF1,i)
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f126]) ).
fof(f126,plain,
( spl5_6
<=> less_than(sF1,i) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).
fof(f74,plain,
! [X6] :
( ~ less_than(X6,i)
| less_than(X6,n) ),
inference(resolution,[],[f7,f15]) ).
fof(f15,axiom,
less_than(i,n),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f7,axiom,
! [X2,X0,X1] :
( ~ less_than(X1,X2)
| less_than(X0,X2)
| ~ less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less_than) ).
fof(f156,plain,
~ spl5_5,
inference(avatar_contradiction_clause,[],[f155]) ).
fof(f155,plain,
( $false
| ~ spl5_5 ),
inference(subsumption_resolution,[],[f135,f15]) ).
fof(f135,plain,
( ~ less_than(i,n)
| ~ spl5_5 ),
inference(backward_demodulation,[],[f51,f124]) ).
fof(f124,plain,
( i = sF1
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f122,plain,
( spl5_5
<=> i = sF1 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
fof(f130,plain,
( spl5_5
| spl5_6 ),
inference(avatar_split_clause,[],[f119,f126,f122]) ).
fof(f119,plain,
( less_than(sF1,i)
| i = sF1 ),
inference(resolution,[],[f112,f8]) ).
fof(f8,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_related) ).
fof(f112,plain,
~ less_than(i,sF1),
inference(subsumption_resolution,[],[f111,f30]) ).
fof(f30,plain,
less_than(sF4,sF0),
inference(definition_folding,[],[f17,f23,f29]) ).
fof(f29,plain,
a(i) = sF4,
introduced(function_definition,[]) ).
fof(f23,plain,
a(m) = sF0,
introduced(function_definition,[]) ).
fof(f17,axiom,
less_than(a(i),a(m)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f111,plain,
( ~ less_than(i,sF1)
| ~ less_than(sF4,sF0) ),
inference(subsumption_resolution,[],[f110,f9]) ).
fof(f9,axiom,
! [X0] : ~ less_than(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_not_less_than_x) ).
fof(f110,plain,
( less_than(i,i)
| ~ less_than(i,sF1)
| ~ less_than(sF4,sF0) ),
inference(superposition,[],[f25,f29]) ).
fof(f25,plain,
! [X0] :
( ~ less_than(a(X0),sF0)
| less_than(X0,i)
| ~ less_than(X0,sF1) ),
inference(definition_folding,[],[f18,f24,f23]) ).
fof(f18,axiom,
! [X0] :
( less_than(X0,i)
| ~ less_than(a(X0),a(m))
| ~ less_than(X0,successor(n)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/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 : n022.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 18:59:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 % (12386)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.46 % (12386)First to succeed.
% 0.19/0.46 % (12378)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.47 % (12386)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (12386)------------------------------
% 0.19/0.47 % (12386)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (12386)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (12386)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (12386)Memory used [KB]: 5500
% 0.19/0.47 % (12386)Time elapsed: 0.072 s
% 0.19/0.47 % (12386)Instructions burned: 7 (million)
% 0.19/0.47 % (12386)------------------------------
% 0.19/0.47 % (12386)------------------------------
% 0.19/0.47 % (12361)Success in time 0.133 s
%------------------------------------------------------------------------------