TSTP Solution File: LCL178-3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL178-3 : 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 : n009.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:47:08 EDT 2022
% Result : Unsatisfiable 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 20 unt; 0 def)
% Number of atoms : 42 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 11 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 43 ( 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f80,plain,
$false,
inference(avatar_sat_refutation,[],[f71,f79]) ).
fof(f79,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f76]) ).
fof(f76,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f73,f14]) ).
fof(f14,plain,
~ theorem(or(not(p),not(not(p)))),
inference(definition_unfolding,[],[f9,f6]) ).
fof(f6,axiom,
! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f9,axiom,
~ theorem(implies(p,not(not(p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f73,plain,
( ! [X1] : theorem(or(X1,not(X1)))
| ~ spl0_4 ),
inference(resolution,[],[f69,f26]) ).
fof(f26,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f20,f12]) ).
fof(f12,plain,
! [X3,X4] :
( ~ theorem(or(not(X4),X3))
| theorem(X3)
| ~ theorem(X4) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f8,axiom,
! [X3,X4] :
( theorem(X3)
| ~ theorem(X4)
| ~ theorem(implies(X4,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f20,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f16,f7]) ).
fof(f7,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f16,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f69,plain,
( ! [X0] : theorem(or(not(X0),X0))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f68,plain,
( spl0_4
<=> ! [X0] : theorem(or(not(X0),X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f71,plain,
spl0_4,
inference(avatar_split_clause,[],[f62,f68]) ).
fof(f62,plain,
! [X4] : theorem(or(not(X4),X4)),
inference(resolution,[],[f47,f25]) ).
fof(f25,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f18,f12]) ).
fof(f18,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f47,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f28,f17]) ).
fof(f17,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f11,f7]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f21,f12]) ).
fof(f21,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f10,f7]) ).
fof(f10,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL178-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/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.32 % Computer : n009.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % 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 01:38:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.45 % (12694)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 (2999ds/75Mi)
% 0.18/0.45 % (12686)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.47 % (12686)First to succeed.
% 0.18/0.47 % (12686)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (12686)------------------------------
% 0.18/0.47 % (12686)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.47 % (12686)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.47 % (12686)Termination reason: Refutation
% 0.18/0.47
% 0.18/0.47 % (12686)Memory used [KB]: 5373
% 0.18/0.47 % (12686)Time elapsed: 0.077 s
% 0.18/0.47 % (12686)Instructions burned: 3 (million)
% 0.18/0.47 % (12686)------------------------------
% 0.18/0.47 % (12686)------------------------------
% 0.18/0.47 % (12678)Success in time 0.138 s
%------------------------------------------------------------------------------