TSTP Solution File: SYN944+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN944+1 : TPTP v8.1.0. Released v3.1.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 19:46:10 EDT 2022
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 113 ( 35 ~; 23 |; 45 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 75 ( 57 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,plain,
$false,
inference(subsumption_resolution,[],[f17,f10]) ).
fof(f10,plain,
s(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( s(sK2)
& ! [X3,X4] :
( q(X3,X4)
| ~ r(X3,X4) )
& ! [X5] :
( ~ s(X5)
| p(X5) )
& r(sK0,sK1)
& s(sK0)
& ! [X6,X7] :
( ~ q(X7,X6)
| ~ p(X7) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
fof(f7,plain,
( ? [X0,X1,X2] :
( s(X2)
& ! [X3,X4] :
( q(X3,X4)
| ~ r(X3,X4) )
& ! [X5] :
( ~ s(X5)
| p(X5) )
& r(X0,X1)
& s(X0)
& ! [X6,X7] :
( ~ q(X7,X6)
| ~ p(X7) ) )
=> ( s(sK2)
& ! [X3,X4] :
( q(X3,X4)
| ~ r(X3,X4) )
& ! [X5] :
( ~ s(X5)
| p(X5) )
& r(sK0,sK1)
& s(sK0)
& ! [X6,X7] :
( ~ q(X7,X6)
| ~ p(X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0,X1,X2] :
( s(X2)
& ! [X3,X4] :
( q(X3,X4)
| ~ r(X3,X4) )
& ! [X5] :
( ~ s(X5)
| p(X5) )
& r(X0,X1)
& s(X0)
& ! [X6,X7] :
( ~ q(X7,X6)
| ~ p(X7) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
? [X1,X2,X0] :
( s(X0)
& ! [X4,X3] :
( q(X4,X3)
| ~ r(X4,X3) )
& ! [X5] :
( ~ s(X5)
| p(X5) )
& r(X1,X2)
& s(X1)
& ! [X7,X6] :
( ~ q(X6,X7)
| ~ p(X6) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
? [X2,X1,X0] :
( ! [X7,X6] :
( ~ q(X6,X7)
| ~ p(X6) )
& s(X1)
& s(X0)
& ! [X5] :
( ~ s(X5)
| p(X5) )
& r(X1,X2)
& ! [X4,X3] :
( q(X4,X3)
| ~ r(X4,X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X2,X1,X0] :
( ( s(X1)
& s(X0)
& ! [X5] :
( s(X5)
=> p(X5) )
& r(X1,X2)
& ! [X3,X4] :
( r(X4,X3)
=> q(X4,X3) ) )
=> ? [X7,X6] :
( p(X6)
& q(X6,X7) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1,X2] :
( ( s(X1)
& s(X0)
& ! [X4,X3] :
( r(X3,X4)
=> q(X3,X4) )
& r(X1,X2)
& ! [X3] :
( s(X3)
=> p(X3) ) )
=> ? [X3,X4] :
( q(X3,X4)
& p(X3) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1,X2] :
( ( s(X1)
& s(X0)
& ! [X4,X3] :
( r(X3,X4)
=> q(X3,X4) )
& r(X1,X2)
& ! [X3] :
( s(X3)
=> p(X3) ) )
=> ? [X3,X4] :
( q(X3,X4)
& p(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f17,plain,
~ s(sK0),
inference(resolution,[],[f16,f11]) ).
fof(f11,plain,
r(sK0,sK1),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
! [X0,X1] :
( ~ r(X0,X1)
| ~ s(X0) ),
inference(resolution,[],[f15,f12]) ).
fof(f12,plain,
! [X5] :
( p(X5)
| ~ s(X5) ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( ~ p(X0)
| ~ r(X0,X1) ),
inference(resolution,[],[f13,f9]) ).
fof(f9,plain,
! [X6,X7] :
( ~ q(X7,X6)
| ~ p(X7) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X3,X4] :
( q(X3,X4)
| ~ r(X3,X4) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN944+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/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 : n014.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 22:33:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.49 % (10355)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.18/0.49 % (10355)First to succeed.
% 0.18/0.50 % (10353)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.18/0.50 % (10355)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (10355)------------------------------
% 0.18/0.50 % (10355)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (10355)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (10355)Termination reason: Refutation
% 0.18/0.50
% 0.18/0.50 % (10355)Memory used [KB]: 895
% 0.18/0.50 % (10355)Time elapsed: 0.107 s
% 0.18/0.50 % (10355)Instructions burned: 2 (million)
% 0.18/0.50 % (10355)------------------------------
% 0.18/0.50 % (10355)------------------------------
% 0.18/0.50 % (10339)Success in time 0.155 s
%------------------------------------------------------------------------------