TSTP Solution File: LCL035-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL035-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 : n007.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:38 EDT 2022
% Result : Unsatisfiable 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 15 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f85,plain,
$false,
inference(avatar_sat_refutation,[],[f37,f66,f74,f84]) ).
fof(f84,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f82]) ).
fof(f82,plain,
( $false
| ~ spl0_7 ),
inference(resolution,[],[f73,f3]) ).
fof(f3,axiom,
~ is_a_theorem(implies(falsehood,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_4) ).
fof(f73,plain,
( ! [X0] : is_a_theorem(implies(falsehood,X0))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f72,plain,
( spl0_7
<=> ! [X0] : is_a_theorem(implies(falsehood,X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
fof(f74,plain,
( spl0_2
| spl0_7
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f67,f64,f72,f22]) ).
fof(f22,plain,
( spl0_2
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f64,plain,
( spl0_6
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(falsehood,X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f67,plain,
( ! [X0,X1] :
( is_a_theorem(implies(falsehood,X0))
| ~ is_a_theorem(X1) )
| ~ spl0_6 ),
inference(resolution,[],[f65,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(f65,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(falsehood,X1)))
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f66,plain,
( spl0_2
| spl0_6 ),
inference(avatar_split_clause,[],[f59,f64,f22]) ).
fof(f59,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(falsehood,X1)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f27,f1]) ).
fof(f27,plain,
! [X8,X9,X7] : is_a_theorem(implies(X7,implies(X8,implies(falsehood,X9)))),
inference(resolution,[],[f9,f6]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(falsehood,X1)),X2),implies(X3,X2))),
inference(resolution,[],[f5,f4]) ).
fof(f4,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(implies(X1,X3),implies(X2,falsehood)),X4),X0))
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[],[f2,f1]) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_CAMerideth) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(resolution,[],[f4,f2]) ).
fof(f9,plain,
! [X3,X6,X4,X5] :
( ~ is_a_theorem(implies(implies(X5,implies(falsehood,X6)),X4))
| is_a_theorem(implies(X3,X4)) ),
inference(resolution,[],[f6,f1]) ).
fof(f37,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f36]) ).
fof(f36,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f26,f23]) ).
fof(f23,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f26,plain,
! [X6,X4,X5] : is_a_theorem(implies(X4,implies(X5,implies(falsehood,X6)))),
inference(resolution,[],[f9,f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL035-1 : TPTP v8.1.0. Released v1.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 : n007.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 01:15:45 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.53 % (5383)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.21/0.53 % (5383)First to succeed.
% 0.21/0.53 % (5375)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.21/0.54 % (5383)Refutation found. Thanks to Tanya!
% 0.21/0.54 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54 % (5383)------------------------------
% 0.21/0.54 % (5383)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (5383)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (5383)Termination reason: Refutation
% 0.21/0.54
% 0.21/0.54 % (5383)Memory used [KB]: 5373
% 0.21/0.54 % (5383)Time elapsed: 0.121 s
% 0.21/0.54 % (5383)Instructions burned: 3 (million)
% 0.21/0.54 % (5383)------------------------------
% 0.21/0.54 % (5383)------------------------------
% 0.21/0.54 % (5361)Success in time 0.186 s
%------------------------------------------------------------------------------