TSTP Solution File: SYN979+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN979+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 : n002.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:15 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 24 ( 8 avg)
% Number of connectives : 114 ( 24 ~; 16 |; 61 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 32 ( 20 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,plain,
$false,
inference(resolution,[],[f17,f12]) ).
fof(f12,plain,
~ p(sK1,sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
! [X2,X3] :
( ( ~ r(X3)
| p(sK0,X3) )
& ( p(X2,X3)
| ~ s(sK1) )
& q(sK1)
& r(sK0)
& ~ p(sK1,sK0)
& q(sK0)
& s(sK1)
& ( p(X2,sK1)
| ~ q(X2) )
& r(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f6]) ).
fof(f6,plain,
( ? [X0,X1] :
! [X2,X3] :
( ( ~ r(X3)
| p(X0,X3) )
& ( p(X2,X3)
| ~ s(X1) )
& q(X1)
& r(X0)
& ~ p(X1,X0)
& q(X0)
& s(X1)
& ( p(X2,X1)
| ~ q(X2) )
& r(X1) )
=> ! [X3,X2] :
( ( ~ r(X3)
| p(sK0,X3) )
& ( p(X2,X3)
| ~ s(sK1) )
& q(sK1)
& r(sK0)
& ~ p(sK1,sK0)
& q(sK0)
& s(sK1)
& ( p(X2,sK1)
| ~ q(X2) )
& r(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
( ( ~ r(X3)
| p(X0,X3) )
& ( p(X2,X3)
| ~ s(X1) )
& q(X1)
& r(X0)
& ~ p(X1,X0)
& q(X0)
& s(X1)
& ( p(X2,X1)
| ~ q(X2) )
& r(X1) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
? [X1,X0] :
! [X2,X3] :
( ~ p(X1,X0)
& ( p(X2,X3)
| ~ s(X1) )
& r(X1)
& ( p(X2,X1)
| ~ q(X2) )
& ( ~ r(X3)
| p(X0,X3) )
& r(X0)
& q(X1)
& s(X1)
& q(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X1,X0] :
? [X2,X3] :
( ( ( s(X1)
=> p(X2,X3) )
& r(X1)
& ( q(X2)
=> p(X2,X1) )
& ( r(X3)
=> p(X0,X3) )
& r(X0)
& q(X1)
& s(X1)
& q(X0) )
=> p(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X1,X0] :
? [X2,X3] :
( ( r(X1)
& ( r(X3)
=> p(X1,X3) )
& q(X1)
& r(X0)
& q(X0)
& s(X0)
& ( s(X0)
=> p(X2,X3) )
& ( q(X2)
=> p(X2,X0) ) )
=> p(X0,X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X1,X0] :
? [X2,X3] :
( ( r(X1)
& ( r(X3)
=> p(X1,X3) )
& q(X1)
& r(X0)
& q(X0)
& s(X0)
& ( s(X0)
=> p(X2,X3) )
& ( q(X2)
=> p(X2,X0) ) )
=> p(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f17,plain,
! [X2,X3] : p(X2,X3),
inference(subsumption_resolution,[],[f15,f10]) ).
fof(f10,plain,
s(sK1),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X2,X3] :
( ~ s(sK1)
| p(X2,X3) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.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.34 % Computer : n002.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 22:45:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 % (2805)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.20/0.46 % (2797)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.20/0.46 % (2797)First to succeed.
% 0.20/0.47 % (2797)Refutation found. Thanks to Tanya!
% 0.20/0.47 % SZS status Theorem for theBenchmark
% 0.20/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.47 % (2797)------------------------------
% 0.20/0.47 % (2797)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.47 % (2797)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.47 % (2797)Termination reason: Refutation
% 0.20/0.47
% 0.20/0.47 % (2797)Memory used [KB]: 5373
% 0.20/0.47 % (2797)Time elapsed: 0.057 s
% 0.20/0.47 % (2797)Instructions burned: 2 (million)
% 0.20/0.47 % (2797)------------------------------
% 0.20/0.47 % (2797)------------------------------
% 0.20/0.47 % (2783)Success in time 0.113 s
%------------------------------------------------------------------------------