TSTP Solution File: NUM913_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM913_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:11 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 2 unt; 2 typ; 0 def)
% Number of atoms : 96 ( 20 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 108 ( 44 ~; 46 |; 10 &)
% ( 6 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 69 ( 48 atm; 0 fun; 0 num; 21 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 : 21 ( 13 !; 8 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_4,type,
sK0: $real ).
tff(func_def_5,type,
sK1: $real ).
tff(f49,plain,
$false,
inference(avatar_sat_refutation,[],[f31,f36,f38,f43,f48]) ).
tff(f48,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f47]) ).
tff(f47,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f46,f9]) ).
tff(f9,plain,
! [X0: $real] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f46,plain,
( $less(sK0,sK0)
| ~ spl2_1
| ~ spl2_3 ),
inference(backward_demodulation,[],[f26,f34]) ).
tff(f34,plain,
( ( sK0 = sK1 )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f33]) ).
tff(f33,plain,
( spl2_3
<=> ( sK0 = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
tff(f26,plain,
( $less(sK1,sK0)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f24]) ).
tff(f24,plain,
( spl2_1
<=> $less(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f43,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f42]) ).
tff(f42,plain,
( $false
| ~ spl2_1
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f41,f9]) ).
tff(f41,plain,
( $less(sK1,sK1)
| ~ spl2_1
| ~ spl2_2 ),
inference(resolution,[],[f39,f29]) ).
tff(f29,plain,
( $less(sK0,sK1)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f28]) ).
tff(f28,plain,
( spl2_2
<=> $less(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f39,plain,
( ! [X0: $real] :
( ~ $less(sK0,X0)
| $less(sK1,X0) )
| ~ spl2_1 ),
inference(resolution,[],[f10,f26]) ).
tff(f10,plain,
! [X2: $real,X0: $real,X1: $real] :
( ~ $less(X0,X1)
| ~ $less(X1,X2)
| $less(X0,X2) ),
introduced(theory_axiom_148,[]) ).
tff(f38,plain,
( spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f37,f33,f28]) ).
tff(f37,plain,
( ( sK0 = sK1 )
| $less(sK0,sK1) ),
inference(subsumption_resolution,[],[f20,f11]) ).
tff(f11,plain,
! [X0: $real,X1: $real] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(theory_axiom_149,[]) ).
tff(f20,plain,
( ~ $less(sK1,sK0)
| ( sK0 = sK1 )
| $less(sK0,sK1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
( ( $less(sK1,sK0)
| ( ( sK0 != sK1 )
& ~ $less(sK0,sK1) ) )
& ( ~ $less(sK1,sK0)
| ( sK0 = sK1 )
| $less(sK0,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f18]) ).
tff(f18,plain,
( ? [X0: $real,X1: $real] :
( ( $less(X1,X0)
| ( ( X0 != X1 )
& ~ $less(X0,X1) ) )
& ( ~ $less(X1,X0)
| ( X0 = X1 )
| $less(X0,X1) ) )
=> ( ( $less(sK1,sK0)
| ( ( sK0 != sK1 )
& ~ $less(sK0,sK1) ) )
& ( ~ $less(sK1,sK0)
| ( sK0 = sK1 )
| $less(sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f17,plain,
? [X0: $real,X1: $real] :
( ( $less(X1,X0)
| ( ( X0 != X1 )
& ~ $less(X0,X1) ) )
& ( ~ $less(X1,X0)
| ( X0 = X1 )
| $less(X0,X1) ) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
? [X0: $real,X1: $real] :
( ( $less(X1,X0)
| ( ( X0 != X1 )
& ~ $less(X0,X1) ) )
& ( ~ $less(X1,X0)
| ( X0 = X1 )
| $less(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
tff(f15,plain,
? [X0: $real,X1: $real] :
( ( ( X0 = X1 )
| $less(X0,X1) )
<~> ~ $less(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ! [X1: $real,X0: $real] :
( ( ( X0 = X1 )
| $less(X0,X1) )
<=> ~ $less(X1,X0) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $real,X1: $real] :
( $lesseq(X0,X1)
<=> ( ( X0 = X1 )
| $less(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X0: $real,X1: $real] :
( $lesseq(X0,X1)
<=> ( ( X0 = X1 )
| $less(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_combined_problem_1) ).
tff(f36,plain,
( spl2_1
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f22,f33,f24]) ).
tff(f22,plain,
( ( sK0 != sK1 )
| $less(sK1,sK0) ),
inference(cnf_transformation,[],[f19]) ).
tff(f31,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f21,f28,f24]) ).
tff(f21,plain,
( ~ $less(sK0,sK1)
| $less(sK1,sK0) ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM913=1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/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.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:16:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (27134)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (27134)First to succeed.
% 0.20/0.51 % (27134)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 % (27134)------------------------------
% 0.20/0.51 % (27134)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (27134)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (27134)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (27134)Memory used [KB]: 5373
% 0.20/0.51 % (27134)Time elapsed: 0.095 s
% 0.20/0.51 % (27134)Instructions burned: 2 (million)
% 0.20/0.51 % (27134)------------------------------
% 0.20/0.51 % (27134)------------------------------
% 0.20/0.51 % (27129)Success in time 0.149 s
%------------------------------------------------------------------------------