TSTP Solution File: NUM906_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM906_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 : n014.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:07:10 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 2 unt; 2 typ; 0 def)
% Number of atoms : 111 ( 23 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 124 ( 49 ~; 54 |; 12 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 76 ( 52 atm; 0 fun; 0 num; 24 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 24 ( 14 !; 10 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_4,type,
sK0: $rat ).
tff(func_def_5,type,
sK1: $rat ).
tff(f80,plain,
$false,
inference(avatar_sat_refutation,[],[f37,f38,f39,f42,f75,f79]) ).
tff(f79,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f77]) ).
tff(f77,plain,
( $false
| ~ spl2_2
| ~ spl2_3 ),
inference(unit_resulting_resolution,[],[f9,f32,f35,f10]) ).
tff(f10,plain,
! [X2: $rat,X0: $rat,X1: $rat] :
( ~ $less(X1,X2)
| ~ $less(X0,X1)
| $less(X0,X2) ),
introduced(theory_axiom_148,[]) ).
tff(f35,plain,
( $less(sK1,sK0)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f34]) ).
tff(f34,plain,
( spl2_3
<=> $less(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
tff(f32,plain,
( $less(sK0,sK1)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f30]) ).
tff(f30,plain,
( spl2_2
<=> $less(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f9,plain,
! [X0: $rat] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f75,plain,
( spl2_1
| spl2_2
| spl2_3 ),
inference(avatar_contradiction_clause,[],[f72]) ).
tff(f72,plain,
( $false
| spl2_1
| spl2_2
| spl2_3 ),
inference(unit_resulting_resolution,[],[f27,f31,f36,f11]) ).
tff(f11,plain,
! [X0: $rat,X1: $rat] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
tff(f36,plain,
( ~ $less(sK1,sK0)
| spl2_3 ),
inference(avatar_component_clause,[],[f34]) ).
tff(f31,plain,
( ~ $less(sK0,sK1)
| spl2_2 ),
inference(avatar_component_clause,[],[f30]) ).
tff(f27,plain,
( ( sK0 != sK1 )
| spl2_1 ),
inference(avatar_component_clause,[],[f26]) ).
tff(f26,plain,
( spl2_1
<=> ( sK0 = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f42,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f41]) ).
tff(f41,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f40,f9]) ).
tff(f40,plain,
( $less(sK0,sK0)
| ~ spl2_1
| ~ spl2_3 ),
inference(backward_demodulation,[],[f35,f28]) ).
tff(f28,plain,
( ( sK0 = sK1 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f26]) ).
tff(f39,plain,
( spl2_3
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f23,f26,f34]) ).
tff(f23,plain,
( ( sK0 != sK1 )
| $less(sK1,sK0) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
( ( ( ~ $less(sK0,sK1)
& ( sK0 != sK1 ) )
| $less(sK1,sK0) )
& ( $less(sK0,sK1)
| ( sK0 = sK1 )
| ~ $less(sK1,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f19,f20]) ).
tff(f20,plain,
( ? [X0: $rat,X1: $rat] :
( ( ( ~ $less(X0,X1)
& ( X0 != X1 ) )
| $less(X1,X0) )
& ( $less(X0,X1)
| ( X0 = X1 )
| ~ $less(X1,X0) ) )
=> ( ( ( ~ $less(sK0,sK1)
& ( sK0 != sK1 ) )
| $less(sK1,sK0) )
& ( $less(sK0,sK1)
| ( sK0 = sK1 )
| ~ $less(sK1,sK0) ) ) ),
introduced(choice_axiom,[]) ).
tff(f19,plain,
? [X0: $rat,X1: $rat] :
( ( ( ~ $less(X0,X1)
& ( X0 != X1 ) )
| $less(X1,X0) )
& ( $less(X0,X1)
| ( X0 = X1 )
| ~ $less(X1,X0) ) ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
? [X1: $rat,X0: $rat] :
( ( ( ~ $less(X1,X0)
& ( X0 != X1 ) )
| $less(X0,X1) )
& ( $less(X1,X0)
| ( X0 = X1 )
| ~ $less(X0,X1) ) ),
inference(flattening,[],[f17]) ).
tff(f17,plain,
? [X1: $rat,X0: $rat] :
( ( ( ~ $less(X1,X0)
& ( X0 != X1 ) )
| $less(X0,X1) )
& ( $less(X1,X0)
| ( X0 = X1 )
| ~ $less(X0,X1) ) ),
inference(nnf_transformation,[],[f16]) ).
tff(f16,plain,
? [X1: $rat,X0: $rat] :
( ~ $less(X0,X1)
<~> ( $less(X1,X0)
| ( X0 = X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
tff(f15,plain,
~ ! [X0: $rat,X1: $rat] :
( ( $less(X1,X0)
| ( X0 = X1 ) )
<=> ~ $less(X0,X1) ),
inference(rectify,[],[f3]) ).
tff(f3,plain,
~ ! [X1: $rat,X0: $rat] :
( ( $less(X0,X1)
| ( X0 = X1 ) )
<=> ~ $less(X1,X0) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X1: $rat,X0: $rat] :
( ( $less(X0,X1)
| ( X0 = X1 ) )
<=> $lesseq(X0,X1) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X1: $rat,X0: $rat] :
( ( $less(X0,X1)
| ( X0 = X1 ) )
<=> $lesseq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rat_combined_problem_1) ).
tff(f38,plain,
( spl2_3
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f24,f30,f34]) ).
tff(f24,plain,
( ~ $less(sK0,sK1)
| $less(sK1,sK0) ),
inference(cnf_transformation,[],[f21]) ).
tff(f37,plain,
( spl2_1
| spl2_2
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f22,f34,f30,f26]) ).
tff(f22,plain,
( ~ $less(sK1,sK0)
| $less(sK0,sK1)
| ( sK0 = sK1 ) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM906=1 : TPTP v8.1.0. Released v5.0.0.
% 0.13/0.14 % 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.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 09:44:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (25431)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.50 % (25454)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.20/0.50 % (25445)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.20/0.50 % (25439)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 (3000ds/51Mi)
% 0.20/0.50 % (25431)First to succeed.
% 0.20/0.51 % (25431)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 % (25431)------------------------------
% 0.20/0.51 % (25431)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (25431)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (25431)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (25431)Memory used [KB]: 5500
% 0.20/0.51 % (25431)Time elapsed: 0.104 s
% 0.20/0.51 % (25431)Instructions burned: 3 (million)
% 0.20/0.51 % (25431)------------------------------
% 0.20/0.51 % (25431)------------------------------
% 0.20/0.51 % (25428)Success in time 0.148 s
%------------------------------------------------------------------------------