TSTP Solution File: SYN399+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN399+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 : n004.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:48 EDT 2022
% Result : Theorem 0.15s 0.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 74 ( 28 ~; 24 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 25 ( 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,plain,
$false,
inference(subsumption_resolution,[],[f20,f18]) ).
fof(f18,plain,
! [X2] : f(X2),
inference(subsumption_resolution,[],[f13,f17]) ).
fof(f17,plain,
p,
inference(subsumption_resolution,[],[f15,f14]) ).
fof(f14,plain,
! [X2] :
( ~ f(X2)
| p ),
inference(literal_reordering,[],[f10]) ).
fof(f10,plain,
! [X2] :
( p
| ~ f(X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ( ~ f(sK0)
| ~ p )
& ( ! [X1] : f(X1)
| p )
& ! [X2] :
( ( p
| ~ f(X2) )
& ( f(X2)
| ~ p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
( ? [X0] : ~ f(X0)
=> ~ f(sK0) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ? [X0] : ~ f(X0)
| ~ p )
& ( ! [X1] : f(X1)
| p )
& ! [X2] :
( ( p
| ~ f(X2) )
& ( f(X2)
| ~ p ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ? [X1] : ~ f(X1)
| ~ p )
& ( ! [X1] : f(X1)
| p )
& ! [X0] :
( ( p
| ~ f(X0) )
& ( f(X0)
| ~ p ) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ( ? [X1] : ~ f(X1)
| ~ p )
& ( ! [X1] : f(X1)
| p )
& ! [X0] :
( ( p
| ~ f(X0) )
& ( f(X0)
| ~ p ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
( ( p
<~> ! [X1] : f(X1) )
& ! [X0] :
( p
<=> f(X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( p
<=> f(X0) )
=> ( p
<=> ! [X1] : f(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( p
<=> f(X0) )
=> ( p
<=> ! [X1] : f(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish223) ).
fof(f15,plain,
! [X1] :
( f(X1)
| p ),
inference(literal_reordering,[],[f11]) ).
fof(f11,plain,
! [X1] :
( f(X1)
| p ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X2] :
( ~ p
| f(X2) ),
inference(literal_reordering,[],[f9]) ).
fof(f9,plain,
! [X2] :
( f(X2)
| ~ p ),
inference(cnf_transformation,[],[f8]) ).
fof(f20,plain,
~ f(sK0),
inference(subsumption_resolution,[],[f16,f17]) ).
fof(f16,plain,
( ~ p
| ~ f(sK0) ),
inference(literal_reordering,[],[f12]) ).
fof(f12,plain,
( ~ p
| ~ f(sK0) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SYN399+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.09/0.29 % Computer : n004.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Aug 30 21:48:04 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.15/0.45 % (17085)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.15/0.47 % (17085)First to succeed.
% 0.15/0.47 % (17094)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.15/0.47 % (17077)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.15/0.47 % (17086)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.15/0.47 % (17094)Also succeeded, but the first one will report.
% 0.15/0.47 % (17085)Refutation found. Thanks to Tanya!
% 0.15/0.47 % SZS status Theorem for theBenchmark
% 0.15/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47 % (17085)------------------------------
% 0.15/0.47 % (17085)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47 % (17085)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47 % (17085)Termination reason: Refutation
% 0.15/0.47
% 0.15/0.47 % (17085)Memory used [KB]: 5628
% 0.15/0.47 % (17085)Time elapsed: 0.005 s
% 0.15/0.47 % (17085)Instructions burned: 3 (million)
% 0.15/0.47 % (17085)------------------------------
% 0.15/0.47 % (17085)------------------------------
% 0.15/0.47 % (17070)Success in time 0.168 s
%------------------------------------------------------------------------------