TSTP Solution File: LCL294-3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL294-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 : n016.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:47 EDT 2022
% Result : Unsatisfiable 1.67s 0.57s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 35 ( 25 unt; 0 def)
% Number of atoms : 47 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 15 ~; 11 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f103,plain,
$false,
inference(avatar_sat_refutation,[],[f93,f102]) ).
fof(f102,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f99]) ).
fof(f99,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f83,f55]) ).
fof(f55,plain,
~ theorem(or(not(or(not(p),q)),or(not(p),q))),
inference(resolution,[],[f52,f16]) ).
fof(f16,plain,
~ theorem(not(or(not(or(not(or(not(p),q)),or(not(p),q))),not(or(not(or(not(p),q)),or(not(p),q)))))),
inference(definition_unfolding,[],[f11,f12,f6]) ).
fof(f6,axiom,
! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f12,plain,
! [X6,X5] : equivalent(X5,X6) = not(or(not(or(not(X5),X6)),not(or(not(X6),X5)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f9,axiom,
! [X6,X5] : and(X5,X6) = not(or(not(X5),not(X6))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X6,X5] : equivalent(X5,X6) = and(implies(X5,X6),implies(X6,X5)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,axiom,
~ theorem(equivalent(implies(p,q),or(not(p),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f52,plain,
! [X0] :
( theorem(not(or(not(X0),not(X0))))
| ~ theorem(X0) ),
inference(resolution,[],[f31,f17]) ).
fof(f17,plain,
! [X3,X4] :
( ~ theorem(or(not(X4),X3))
| theorem(X3)
| ~ theorem(X4) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f8,axiom,
! [X3,X4] :
( ~ theorem(X4)
| ~ theorem(implies(X4,X3))
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f31,plain,
! [X2] : theorem(or(X2,not(or(X2,X2)))),
inference(resolution,[],[f27,f21]) ).
fof(f21,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f18,f7]) ).
fof(f7,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f18,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/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f27,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f22,f17]) ).
fof(f22,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f15,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/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f83,plain,
( ! [X0] : theorem(or(not(X0),X0))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f82,plain,
( spl0_4
<=> ! [X0] : theorem(or(not(X0),X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f93,plain,
spl0_4,
inference(avatar_split_clause,[],[f76,f82]) ).
fof(f76,plain,
! [X4] : theorem(or(not(X4),X4)),
inference(resolution,[],[f63,f24]) ).
fof(f24,plain,
! [X2] :
( ~ theorem(or(X2,X2))
| theorem(X2) ),
inference(resolution,[],[f17,f21]) ).
fof(f63,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f49,f20]) ).
fof(f20,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f13,f7]) ).
fof(f13,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/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f25,f17]) ).
fof(f25,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f14,f7]) ).
fof(f14,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/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL294-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/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 : n016.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 02:14:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.55 % (1390)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.55 % (1405)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.55 % (1398)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.19/0.56 % (1406)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 (2999ds/467Mi)
% 0.19/0.56 % (1397)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.56 % (1390)First to succeed.
% 0.19/0.57 % (1389)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.57 TRYING [1]
% 0.19/0.57 TRYING [2]
% 1.67/0.57 TRYING [3]
% 1.67/0.57 % (1390)Refutation found. Thanks to Tanya!
% 1.67/0.57 % SZS status Unsatisfiable for theBenchmark
% 1.67/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.67/0.57 % (1390)------------------------------
% 1.67/0.57 % (1390)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.67/0.57 % (1390)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.67/0.57 % (1390)Termination reason: Refutation
% 1.67/0.57
% 1.67/0.57 % (1390)Memory used [KB]: 5500
% 1.67/0.57 % (1390)Time elapsed: 0.114 s
% 1.67/0.57 % (1390)Instructions burned: 4 (million)
% 1.67/0.57 % (1390)------------------------------
% 1.67/0.57 % (1390)------------------------------
% 1.67/0.57 % (1382)Success in time 0.221 s
%------------------------------------------------------------------------------