TSTP Solution File: LCL197-3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL197-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 : n022.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:16 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 57 ( 33 unt; 0 def)
% Number of atoms : 83 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 28 ~; 24 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f556,plain,
$false,
inference(avatar_sat_refutation,[],[f523,f539,f555]) ).
fof(f555,plain,
~ spl4_16,
inference(avatar_contradiction_clause,[],[f554]) ).
fof(f554,plain,
( $false
| ~ spl4_16 ),
inference(subsumption_resolution,[],[f553,f21]) ).
fof(f21,plain,
~ theorem(sF3),
inference(definition_folding,[],[f15,f20,f17,f19,f18,f17]) ).
fof(f18,plain,
sF1 = or(q,sF0),
introduced(function_definition,[]) ).
fof(f19,plain,
sF2 = not(sF1),
introduced(function_definition,[]) ).
fof(f17,plain,
or(p,q) = sF0,
introduced(function_definition,[]) ).
fof(f20,plain,
or(sF2,sF0) = sF3,
introduced(function_definition,[]) ).
fof(f15,plain,
~ theorem(or(not(or(q,or(p,q))),or(p,q))),
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(or(q,or(p,q)),or(p,q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f553,plain,
( theorem(sF3)
| ~ spl4_16 ),
inference(resolution,[],[f51,f533]) ).
fof(f533,plain,
( theorem(or(sF3,sF3))
| ~ spl4_16 ),
inference(avatar_component_clause,[],[f531]) ).
fof(f531,plain,
( spl4_16
<=> theorem(or(sF3,sF3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_16])]) ).
fof(f51,plain,
! [X2] :
( ~ theorem(or(X2,X2))
| theorem(X2) ),
inference(resolution,[],[f13,f31]) ).
fof(f31,plain,
! [X0] : theorem(or(not(or(X0,X0)),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] : 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(f13,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(X3)
| ~ theorem(implies(X4,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f539,plain,
( spl4_16
| ~ spl4_6 ),
inference(avatar_split_clause,[],[f538,f191,f531]) ).
fof(f191,plain,
( spl4_6
<=> theorem(or(sF2,sF1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f538,plain,
( theorem(or(sF3,sF3))
| ~ spl4_6 ),
inference(subsumption_resolution,[],[f394,f192]) ).
fof(f192,plain,
( theorem(or(sF2,sF1))
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f191]) ).
fof(f394,plain,
( ~ theorem(or(sF2,sF1))
| theorem(or(sF3,sF3)) ),
inference(superposition,[],[f373,f20]) ).
fof(f373,plain,
! [X2] :
( theorem(or(or(X2,sF0),sF3))
| ~ theorem(or(X2,sF1)) ),
inference(resolution,[],[f368,f291]) ).
fof(f291,plain,
! [X2] :
( theorem(or(or(X2,sF0),sF0))
| ~ theorem(or(X2,sF1)) ),
inference(resolution,[],[f287,f264]) ).
fof(f264,plain,
! [X0] :
( theorem(or(or(X0,sF0),q))
| ~ theorem(or(X0,sF1)) ),
inference(resolution,[],[f260,f86]) ).
fof(f86,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f36,f13]) ).
fof(f36,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f11,f7]) ).
fof(f11,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(f260,plain,
! [X0] :
( theorem(or(q,or(X0,sF0)))
| ~ theorem(or(X0,sF1)) ),
inference(resolution,[],[f181,f13]) ).
fof(f181,plain,
! [X0] : theorem(or(not(or(X0,sF1)),or(q,or(X0,sF0)))),
inference(resolution,[],[f160,f7]) ).
fof(f160,plain,
! [X1] : axiom(or(not(or(X1,sF1)),or(q,or(X1,sF0)))),
inference(superposition,[],[f10,f18]) ).
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) ).
fof(f287,plain,
! [X2] :
( ~ theorem(or(X2,q))
| theorem(or(X2,sF0)) ),
inference(resolution,[],[f280,f50]) ).
fof(f50,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f13,f22]) ).
fof(f22,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f12,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(f280,plain,
! [X0] :
( ~ theorem(or(p,or(X0,q)))
| theorem(or(X0,sF0)) ),
inference(resolution,[],[f218,f13]) ).
fof(f218,plain,
! [X0] : theorem(or(not(or(p,or(X0,q))),or(X0,sF0))),
inference(resolution,[],[f162,f7]) ).
fof(f162,plain,
! [X0] : axiom(or(not(or(p,or(X0,q))),or(X0,sF0))),
inference(superposition,[],[f10,f17]) ).
fof(f368,plain,
! [X2] :
( ~ theorem(or(X2,sF0))
| theorem(or(X2,sF3)) ),
inference(resolution,[],[f362,f50]) ).
fof(f362,plain,
! [X0] :
( ~ theorem(or(sF2,or(X0,sF0)))
| theorem(or(X0,sF3)) ),
inference(resolution,[],[f243,f13]) ).
fof(f243,plain,
! [X0] : theorem(or(not(or(sF2,or(X0,sF0))),or(X0,sF3))),
inference(resolution,[],[f164,f7]) ).
fof(f164,plain,
! [X2] : axiom(or(not(or(sF2,or(X2,sF0))),or(X2,sF3))),
inference(superposition,[],[f10,f20]) ).
fof(f523,plain,
spl4_6,
inference(avatar_split_clause,[],[f485,f191]) ).
fof(f485,plain,
theorem(or(sF2,sF1)),
inference(resolution,[],[f472,f51]) ).
fof(f472,plain,
! [X26] : theorem(or(X26,or(sF2,sF1))),
inference(resolution,[],[f438,f30]) ).
fof(f30,plain,
! [X0] : theorem(or(sF2,or(X0,sF1))),
inference(resolution,[],[f23,f7]) ).
fof(f23,plain,
! [X0] : axiom(or(sF2,or(X0,sF1))),
inference(superposition,[],[f12,f19]) ).
fof(f438,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f158,f13]) ).
fof(f158,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f10,f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL197-3 : TPTP v8.1.0. Released v2.3.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 01:44:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 % (16817)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.47 % (16809)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.48 % (16825)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.49 % (16817)First to succeed.
% 0.19/0.49 % (16813)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.49 % (16810)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.50 % (16833)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 % (16815)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.50 % (16817)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (16817)------------------------------
% 0.19/0.50 % (16817)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (16817)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (16817)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (16817)Memory used [KB]: 5756
% 0.19/0.50 % (16817)Time elapsed: 0.111 s
% 0.19/0.50 % (16817)Instructions burned: 24 (million)
% 0.19/0.50 % (16817)------------------------------
% 0.19/0.50 % (16817)------------------------------
% 0.19/0.50 % (16804)Success in time 0.162 s
%------------------------------------------------------------------------------