TSTP Solution File: SYN355+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN355+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_sat --cores 0 -t %d %s
% Computer : n021.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:37:40 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 65 ( 25 ~; 13 |; 17 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 23 ( 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,plain,
$false,
inference(subsumption_resolution,[],[f14,f13]) ).
fof(f13,plain,
~ big_r(sK0),
inference(resolution,[],[f9,f11]) ).
fof(f11,plain,
~ big_p(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ~ big_q(sK0)
& ~ big_p(sK0)
& ! [X1] :
( big_q(X1)
| big_r(X1) )
& ! [X2] :
( ~ big_r(X2)
| big_p(X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
( ? [X0] :
( ~ big_q(X0)
& ~ big_p(X0) )
=> ( ~ big_q(sK0)
& ~ big_p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ? [X0] :
( ~ big_q(X0)
& ~ big_p(X0) )
& ! [X1] :
( big_q(X1)
| big_r(X1) )
& ! [X2] :
( ~ big_r(X2)
| big_p(X2) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ? [X2] :
( ~ big_q(X2)
& ~ big_p(X2) )
& ! [X1] :
( big_q(X1)
| big_r(X1) )
& ! [X0] :
( ~ big_r(X0)
| big_p(X0) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X2] :
( ~ big_q(X2)
& ~ big_p(X2) )
& ! [X0] :
( ~ big_r(X0)
| big_p(X0) )
& ! [X1] :
( big_q(X1)
| big_r(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( big_r(X0)
=> big_p(X0) )
& ! [X1] :
( ~ big_q(X1)
=> big_r(X1) ) )
=> ! [X2] :
( big_p(X2)
| big_q(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X0] :
( big_r(X0)
=> big_p(X0) )
& ! [X0] :
( ~ big_q(X0)
=> big_r(X0) ) )
=> ! [X0] :
( big_q(X0)
| big_p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X0] :
( big_r(X0)
=> big_p(X0) )
& ! [X0] :
( ~ big_q(X0)
=> big_r(X0) ) )
=> ! [X0] :
( big_q(X0)
| big_p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2106) ).
fof(f9,plain,
! [X2] :
( big_p(X2)
| ~ big_r(X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
big_r(sK0),
inference(resolution,[],[f10,f12]) ).
fof(f12,plain,
~ big_q(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X1] :
( big_q(X1)
| big_r(X1) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN355+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 21:43:56 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.49 % (2208)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.50 % (2222)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.50 % (2208)Instruction limit reached!
% 0.20/0.50 % (2208)------------------------------
% 0.20/0.50 % (2208)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (2214)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.20/0.50 % (2208)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (2208)Termination reason: Unknown
% 0.20/0.50 % (2208)Termination phase: Saturation
% 0.20/0.50
% 0.20/0.50 % (2208)Memory used [KB]: 5373
% 0.20/0.50 % (2208)Time elapsed: 0.088 s
% 0.20/0.50 % (2208)Instructions burned: 2 (million)
% 0.20/0.50 % (2208)------------------------------
% 0.20/0.50 % (2208)------------------------------
% 0.20/0.50 % (2222)First to succeed.
% 0.20/0.50 % (2203)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.50 % (2203)Also succeeded, but the first one will report.
% 0.20/0.51 % (2222)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 % (2222)------------------------------
% 0.20/0.51 % (2222)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (2222)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (2222)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (2222)Memory used [KB]: 895
% 0.20/0.51 % (2222)Time elapsed: 0.099 s
% 0.20/0.51 % (2222)Instructions burned: 1 (million)
% 0.20/0.51 % (2222)------------------------------
% 0.20/0.51 % (2222)------------------------------
% 0.20/0.51 % (2199)Success in time 0.151 s
%------------------------------------------------------------------------------