TSTP Solution File: LCL362-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL362-1 : TPTP v8.1.0. Released v2.3.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 17:48:02 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 36 ( 18 unt; 0 def)
% Number of atoms : 59 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 27 ~; 20 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f305,plain,
$false,
inference(avatar_sat_refutation,[],[f92,f285,f302,f304]) ).
fof(f304,plain,
~ spl5_30,
inference(avatar_contradiction_clause,[],[f303]) ).
fof(f303,plain,
( $false
| ~ spl5_30 ),
inference(resolution,[],[f284,f11]) ).
fof(f11,plain,
~ is_a_theorem(sF4),
inference(definition_folding,[],[f5,f10,f8,f7,f6,f9,f8,f7,f6]) ).
fof(f9,plain,
sF3 = implies(x,sF2),
introduced(function_definition,[]) ).
fof(f6,plain,
not(y) = sF0,
introduced(function_definition,[]) ).
fof(f7,plain,
sF1 = implies(sF0,y),
introduced(function_definition,[]) ).
fof(f8,plain,
implies(sF1,y) = sF2,
introduced(function_definition,[]) ).
fof(f10,plain,
sF4 = implies(sF3,sF2),
introduced(function_definition,[]) ).
fof(f5,axiom,
~ is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_11) ).
fof(f284,plain,
( is_a_theorem(sF4)
| ~ spl5_30 ),
inference(avatar_component_clause,[],[f282]) ).
fof(f282,plain,
( spl5_30
<=> is_a_theorem(sF4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_30])]) ).
fof(f302,plain,
( ~ spl5_5
| ~ spl5_29 ),
inference(avatar_split_clause,[],[f301,f279,f44]) ).
fof(f44,plain,
( spl5_5
<=> is_a_theorem(sF2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
fof(f279,plain,
( spl5_29
<=> ! [X0] :
( ~ is_a_theorem(implies(sF3,X0))
| ~ is_a_theorem(implies(X0,sF2)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_29])]) ).
fof(f301,plain,
( ~ is_a_theorem(sF2)
| ~ spl5_29 ),
inference(resolution,[],[f298,f18]) ).
fof(f18,plain,
! [X2,X1] :
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f1,f4]) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f298,plain,
( ~ is_a_theorem(implies(not(sF2),x))
| ~ spl5_29 ),
inference(resolution,[],[f288,f3]) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
fof(f288,plain,
( ! [X1] :
( ~ is_a_theorem(implies(implies(X1,sF2),sF2))
| ~ is_a_theorem(implies(X1,x)) )
| ~ spl5_29 ),
inference(resolution,[],[f280,f163]) ).
fof(f163,plain,
! [X0] :
( is_a_theorem(implies(sF3,implies(X0,sF2)))
| ~ is_a_theorem(implies(X0,x)) ),
inference(resolution,[],[f76,f1]) ).
fof(f76,plain,
! [X2] : is_a_theorem(implies(implies(X2,x),implies(sF3,implies(X2,sF2)))),
inference(superposition,[],[f2,f9]) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
fof(f280,plain,
( ! [X0] :
( ~ is_a_theorem(implies(sF3,X0))
| ~ is_a_theorem(implies(X0,sF2)) )
| ~ spl5_29 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f285,plain,
( spl5_29
| spl5_30 ),
inference(avatar_split_clause,[],[f275,f282,f279]) ).
fof(f275,plain,
! [X0] :
( is_a_theorem(sF4)
| ~ is_a_theorem(implies(sF3,X0))
| ~ is_a_theorem(implies(X0,sF2)) ),
inference(resolution,[],[f217,f1]) ).
fof(f217,plain,
! [X0] :
( is_a_theorem(implies(implies(X0,sF2),sF4))
| ~ is_a_theorem(implies(sF3,X0)) ),
inference(resolution,[],[f81,f1]) ).
fof(f81,plain,
! [X3] : is_a_theorem(implies(implies(sF3,X3),implies(implies(X3,sF2),sF4))),
inference(superposition,[],[f2,f10]) ).
fof(f92,plain,
spl5_5,
inference(avatar_contradiction_clause,[],[f91]) ).
fof(f91,plain,
( $false
| spl5_5 ),
inference(resolution,[],[f46,f14]) ).
fof(f14,plain,
is_a_theorem(sF2),
inference(forward_demodulation,[],[f13,f8]) ).
fof(f13,plain,
is_a_theorem(implies(sF1,y)),
inference(forward_demodulation,[],[f12,f7]) ).
fof(f12,plain,
is_a_theorem(implies(implies(sF0,y),y)),
inference(superposition,[],[f3,f6]) ).
fof(f46,plain,
( ~ is_a_theorem(sF2)
| spl5_5 ),
inference(avatar_component_clause,[],[f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL362-1 : TPTP v8.1.0. Released v2.3.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.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 02:20:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 % (2349)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.46 % (2364)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.46 % (2349)First to succeed.
% 0.19/0.47 % (2372)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 (2999ds/68Mi)
% 0.19/0.48 % (2357)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.48 % (2349)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (2349)------------------------------
% 0.19/0.48 % (2349)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (2349)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (2349)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (2349)Memory used [KB]: 5628
% 0.19/0.48 % (2349)Time elapsed: 0.098 s
% 0.19/0.48 % (2349)Instructions burned: 8 (million)
% 0.19/0.48 % (2349)------------------------------
% 0.19/0.48 % (2349)------------------------------
% 0.19/0.48 % (2345)Success in time 0.139 s
%------------------------------------------------------------------------------