TSTP Solution File: LCL081-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL081-1 : TPTP v8.1.0. Released v1.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 : n006.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:46:48 EDT 2022
% Result : Unsatisfiable 1.77s 0.58s
% Output : Refutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 15 unt; 0 def)
% Number of atoms : 79 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 35 ~; 29 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f208,plain,
$false,
inference(avatar_sat_refutation,[],[f48,f96,f136,f146,f182,f186,f207]) ).
fof(f207,plain,
~ spl1_13,
inference(avatar_contradiction_clause,[],[f200]) ).
fof(f200,plain,
( $false
| ~ spl1_13 ),
inference(resolution,[],[f135,f53]) ).
fof(f53,plain,
! [X6,X7,X5] : is_a_theorem(implies(implies(implies(implies(X5,a),implies(X6,a)),sF0),implies(X7,sF0))),
inference(resolution,[],[f7,f8]) ).
fof(f8,plain,
! [X0,X1] : is_a_theorem(implies(implies(sF0,X0),implies(implies(X0,a),implies(X1,a)))),
inference(superposition,[],[f2,f4]) ).
fof(f4,plain,
implies(a,a) = sF0,
introduced(function_definition,[]) ).
fof(f2,axiom,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
fof(f7,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X3),X0))
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[],[f2,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f135,plain,
( ! [X4] : ~ is_a_theorem(implies(implies(X4,sF0),implies(sF0,sF0)))
| ~ spl1_13 ),
inference(avatar_component_clause,[],[f134]) ).
fof(f134,plain,
( spl1_13
<=> ! [X4] : ~ is_a_theorem(implies(implies(X4,sF0),implies(sF0,sF0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_13])]) ).
fof(f186,plain,
( spl1_7
| ~ spl1_10 ),
inference(avatar_split_clause,[],[f183,f121,f69]) ).
fof(f69,plain,
( spl1_7
<=> ! [X2] : is_a_theorem(implies(X2,sF0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
fof(f121,plain,
( spl1_10
<=> is_a_theorem(implies(sF0,sF0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_10])]) ).
fof(f183,plain,
( ! [X0] : is_a_theorem(implies(X0,sF0))
| ~ spl1_10 ),
inference(resolution,[],[f122,f110]) ).
fof(f110,plain,
! [X3,X4] :
( ~ is_a_theorem(implies(sF0,X3))
| is_a_theorem(implies(X4,X3)) ),
inference(duplicate_literal_removal,[],[f108]) ).
fof(f108,plain,
! [X3,X4] :
( ~ is_a_theorem(implies(sF0,X3))
| is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(implies(sF0,X3)) ),
inference(resolution,[],[f60,f1]) ).
fof(f60,plain,
! [X21,X22] :
( is_a_theorem(implies(implies(sF0,X21),implies(X22,X21)))
| ~ is_a_theorem(implies(sF0,X21)) ),
inference(resolution,[],[f7,f33]) ).
fof(f33,plain,
! [X0] :
( is_a_theorem(implies(implies(X0,a),sF0))
| ~ is_a_theorem(implies(sF0,X0)) ),
inference(resolution,[],[f13,f1]) ).
fof(f13,plain,
! [X0] : is_a_theorem(implies(implies(sF0,X0),implies(implies(X0,a),sF0))),
inference(superposition,[],[f8,f4]) ).
fof(f122,plain,
( is_a_theorem(implies(sF0,sF0))
| ~ spl1_10 ),
inference(avatar_component_clause,[],[f121]) ).
fof(f182,plain,
~ spl1_9,
inference(avatar_contradiction_clause,[],[f150]) ).
fof(f150,plain,
( $false
| ~ spl1_9 ),
inference(resolution,[],[f95,f62]) ).
fof(f62,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,sF0),implies(sF0,sF0)),implies(X1,implies(sF0,sF0)))),
inference(resolution,[],[f56,f7]) ).
fof(f56,plain,
! [X13] : is_a_theorem(implies(implies(implies(sF0,sF0),sF0),implies(X13,sF0))),
inference(resolution,[],[f7,f15]) ).
fof(f15,plain,
is_a_theorem(implies(implies(sF0,a),implies(sF0,sF0))),
inference(superposition,[],[f12,f4]) ).
fof(f12,plain,
! [X0] : is_a_theorem(implies(implies(sF0,a),implies(sF0,implies(X0,a)))),
inference(superposition,[],[f8,f4]) ).
fof(f95,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl1_9 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f94,plain,
( spl1_9
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_9])]) ).
fof(f146,plain,
( spl1_10
| spl1_9
| ~ spl1_12 ),
inference(avatar_split_clause,[],[f141,f131,f94,f121]) ).
fof(f131,plain,
( spl1_12
<=> ! [X3] : is_a_theorem(implies(X3,implies(sF0,sF0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_12])]) ).
fof(f141,plain,
( ! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(sF0,sF0)) )
| ~ spl1_12 ),
inference(resolution,[],[f132,f1]) ).
fof(f132,plain,
( ! [X3] : is_a_theorem(implies(X3,implies(sF0,sF0)))
| ~ spl1_12 ),
inference(avatar_component_clause,[],[f131]) ).
fof(f136,plain,
( spl1_12
| spl1_13 ),
inference(avatar_split_clause,[],[f129,f134,f131]) ).
fof(f129,plain,
! [X3,X4] :
( ~ is_a_theorem(implies(implies(X4,sF0),implies(sF0,sF0)))
| is_a_theorem(implies(X3,implies(sF0,sF0))) ),
inference(resolution,[],[f62,f1]) ).
fof(f96,plain,
( spl1_4
| spl1_9
| ~ spl1_7 ),
inference(avatar_split_clause,[],[f87,f69,f94,f40]) ).
fof(f40,plain,
( spl1_4
<=> is_a_theorem(sF0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
fof(f87,plain,
( ! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(sF0) )
| ~ spl1_7 ),
inference(resolution,[],[f70,f1]) ).
fof(f70,plain,
( ! [X2] : is_a_theorem(implies(X2,sF0))
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f48,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f47]) ).
fof(f47,plain,
( $false
| ~ spl1_4 ),
inference(resolution,[],[f42,f5]) ).
fof(f5,plain,
~ is_a_theorem(sF0),
inference(definition_folding,[],[f3,f4]) ).
fof(f3,axiom,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_1) ).
fof(f42,plain,
( is_a_theorem(sF0)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL081-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/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 : n006.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 01:32:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54 % (6310)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.56 % (6317)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 1.50/0.56 % (6317)First to succeed.
% 1.50/0.57 % (6312)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)
% 1.50/0.57 TRYING [1]
% 1.50/0.57 % (6309)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)
% 1.50/0.57 TRYING [2]
% 1.50/0.57 % (6327)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 1.50/0.57 % (6319)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 1.77/0.58 % (6317)Refutation found. Thanks to Tanya!
% 1.77/0.58 % SZS status Unsatisfiable for theBenchmark
% 1.77/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.77/0.58 % (6317)------------------------------
% 1.77/0.58 % (6317)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.77/0.58 % (6317)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.77/0.58 % (6317)Termination reason: Refutation
% 1.77/0.58
% 1.77/0.58 % (6317)Memory used [KB]: 5500
% 1.77/0.58 % (6317)Time elapsed: 0.151 s
% 1.77/0.58 % (6317)Instructions burned: 6 (million)
% 1.77/0.58 % (6317)------------------------------
% 1.77/0.58 % (6317)------------------------------
% 1.77/0.58 % (6305)Success in time 0.23 s
%------------------------------------------------------------------------------