TSTP Solution File: LCL321-3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL321-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 : n023.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:54 EDT 2022
% Result : Unsatisfiable 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 41 ( 27 unt; 0 def)
% Number of atoms : 57 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 17 ~; 14 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f279,plain,
$false,
inference(avatar_sat_refutation,[],[f270,f276,f278]) ).
fof(f278,plain,
~ spl5_3,
inference(avatar_contradiction_clause,[],[f277]) ).
fof(f277,plain,
( $false
| ~ spl5_3 ),
inference(resolution,[],[f62,f22]) ).
fof(f22,plain,
~ theorem(sF4),
inference(definition_folding,[],[f15,f21,f20,f19,f17,f18,f17]) ).
fof(f18,plain,
or(sF0,q) = sF1,
introduced(function_definition,[]) ).
fof(f17,plain,
sF0 = not(p),
introduced(function_definition,[]) ).
fof(f19,plain,
not(q) = sF2,
introduced(function_definition,[]) ).
fof(f20,plain,
sF3 = or(sF0,sF2),
introduced(function_definition,[]) ).
fof(f21,plain,
or(sF1,sF3) = sF4,
introduced(function_definition,[]) ).
fof(f15,plain,
~ theorem(or(or(not(p),q),or(not(p),not(q)))),
inference(definition_unfolding,[],[f9,f6,f6]) ).
fof(f6,axiom,
! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f9,axiom,
~ theorem(or(implies(p,q),implies(p,not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f62,plain,
( theorem(sF4)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f60,plain,
( spl5_3
<=> theorem(sF4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f276,plain,
spl5_14,
inference(avatar_contradiction_clause,[],[f273]) ).
fof(f273,plain,
( $false
| spl5_14 ),
inference(resolution,[],[f272,f147]) ).
fof(f147,plain,
theorem(or(sF1,sF2)),
inference(resolution,[],[f127,f31]) ).
fof(f31,plain,
theorem(or(sF2,sF1)),
inference(resolution,[],[f30,f7]) ).
fof(f7,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f30,plain,
axiom(or(sF2,sF1)),
inference(forward_demodulation,[],[f27,f19]) ).
fof(f27,plain,
axiom(or(not(q),sF1)),
inference(superposition,[],[f14,f18]) ).
fof(f14,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(f127,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f85,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(implies(X4,X3))
| ~ theorem(X4)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f85,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f13,f7]) ).
fof(f13,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(f272,plain,
( ~ theorem(or(sF1,sF2))
| spl5_14 ),
inference(resolution,[],[f269,f45]) ).
fof(f45,plain,
! [X2,X1] :
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(resolution,[],[f12,f24]) ).
fof(f24,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f269,plain,
( ~ theorem(or(sF0,or(sF1,sF2)))
| spl5_14 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f267,plain,
( spl5_14
<=> theorem(or(sF0,or(sF1,sF2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_14])]) ).
fof(f270,plain,
( spl5_3
| ~ spl5_14 ),
inference(avatar_split_clause,[],[f264,f267,f60]) ).
fof(f264,plain,
( ~ theorem(or(sF0,or(sF1,sF2)))
| theorem(sF4) ),
inference(resolution,[],[f263,f12]) ).
fof(f263,plain,
theorem(or(not(or(sF0,or(sF1,sF2))),sF4)),
inference(resolution,[],[f262,f7]) ).
fof(f262,plain,
axiom(or(not(or(sF0,or(sF1,sF2))),sF4)),
inference(superposition,[],[f233,f21]) ).
fof(f233,plain,
! [X1] : axiom(or(not(or(sF0,or(X1,sF2))),or(X1,sF3))),
inference(superposition,[],[f10,f20]) ).
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/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL321-3 : TPTP v8.1.0. Released v2.3.0.
% 0.10/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 : n023.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:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (23114)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.50 % (23112)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.50 % (23106)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.51 % (23098)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.51 % (23104)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51 % (23087)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.51 % (23087)First to succeed.
% 0.19/0.51 % (23087)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (23087)------------------------------
% 0.19/0.51 % (23087)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (23087)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (23087)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (23087)Memory used [KB]: 5500
% 0.19/0.51 % (23087)Time elapsed: 0.106 s
% 0.19/0.51 % (23087)Instructions burned: 8 (million)
% 0.19/0.51 % (23087)------------------------------
% 0.19/0.51 % (23087)------------------------------
% 0.19/0.51 % (23081)Success in time 0.162 s
%------------------------------------------------------------------------------