TSTP Solution File: SYN411+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.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 : n006.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 19:26:31 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 1 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 60 ( 29 ~; 19 |; 3 &)
% ( 6 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 72 ( 45 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f29,plain,
$false,
inference(avatar_sat_refutation,[],[f20,f24,f26,f28]) ).
fof(f28,plain,
( spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f27]) ).
fof(f27,plain,
( $false
| spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f19,f23]) ).
fof(f23,plain,
( ! [X8,X6,X7] : f(X8,X7,X6)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f22,plain,
( spl6_3
<=> ! [X6,X7,X8] : f(X8,X7,X6) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f19,plain,
( ~ f(sK4,sK5,sK3)
| spl6_2 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f17,plain,
( spl6_2
<=> f(sK4,sK5,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f26,plain,
( spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f25]) ).
fof(f25,plain,
( $false
| spl6_1
| ~ spl6_3 ),
inference(resolution,[],[f23,f15]) ).
fof(f15,plain,
( ~ f(sK2,sK1,sK0)
| spl6_1 ),
inference(avatar_component_clause,[],[f13]) ).
fof(f13,plain,
( spl6_1
<=> f(sK2,sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f24,plain,
( spl6_3
| spl6_3 ),
inference(avatar_split_clause,[],[f10,f22,f22]) ).
fof(f10,plain,
! [X10,X11,X8,X6,X9,X7] :
( f(X10,X11,X9)
| f(X8,X7,X6) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ( ~ f(sK2,sK1,sK0)
| ~ f(sK4,sK5,sK3) )
& ( ! [X6,X7,X8] : f(X8,X7,X6)
| ! [X9,X10,X11] : f(X10,X11,X9) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0,X1,X2] : ~ f(X2,X1,X0)
=> ~ f(sK2,sK1,sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X3,X4,X5] : ~ f(X4,X5,X3)
=> ~ f(sK4,sK5,sK3) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ? [X0,X1,X2] : ~ f(X2,X1,X0)
| ? [X3,X4,X5] : ~ f(X4,X5,X3) )
& ( ! [X6,X7,X8] : f(X8,X7,X6)
| ! [X9,X10,X11] : f(X10,X11,X9) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ? [X4,X5,X3] : ~ f(X3,X5,X4)
| ? [X1,X0,X2] : ~ f(X0,X2,X1) )
& ( ! [X4,X5,X3] : f(X3,X5,X4)
| ! [X1,X0,X2] : f(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ! [X1,X0,X2] : f(X0,X2,X1)
<~> ! [X4,X5,X3] : f(X3,X5,X4) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X1,X0,X2] : f(X0,X2,X1)
<=> ~ ? [X5,X4,X3] : ~ f(X3,X5,X4) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0,X2,X1] : f(X0,X1,X2)
<=> ~ ? [X3,X5,X4] : ~ f(X3,X4,X5) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0,X2,X1] : f(X0,X1,X2)
<=> ~ ? [X3,X5,X4] : ~ f(X3,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish250) ).
fof(f20,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f11,f17,f13]) ).
fof(f11,plain,
( ~ f(sK4,sK5,sK3)
| ~ f(sK2,sK1,sK0) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % 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.34 % Computer : n006.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 21:51:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (24340)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.19/0.50 % (24324)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.19/0.50 % (24327)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.50 % (24327)First to succeed.
% 0.19/0.50 % (24327)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (24327)------------------------------
% 0.19/0.50 % (24327)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (24327)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (24327)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (24327)Memory used [KB]: 5884
% 0.19/0.50 % (24327)Time elapsed: 0.089 s
% 0.19/0.50 % (24327)Instructions burned: 2 (million)
% 0.19/0.50 % (24327)------------------------------
% 0.19/0.50 % (24327)------------------------------
% 0.19/0.50 % (24316)Success in time 0.155 s
%------------------------------------------------------------------------------