TSTP Solution File: LCL311-3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL311-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 : n015.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:52 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of formulae : 67 ( 48 unt; 0 def)
% Number of atoms : 90 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 25 ~; 21 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 11 con; 0-2 aty)
% Number of variables : 49 ( 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f604,plain,
$false,
inference(avatar_sat_refutation,[],[f489,f582,f603]) ).
fof(f603,plain,
~ spl10_12,
inference(avatar_contradiction_clause,[],[f602]) ).
fof(f602,plain,
( $false
| ~ spl10_12 ),
inference(subsumption_resolution,[],[f600,f30]) ).
fof(f30,plain,
~ theorem(sF9),
inference(definition_folding,[],[f13,f29,f28,f27,f26,f21,f20,f20,f25,f20,f24,f23,f20,f22,f21,f20,f20]) ).
fof(f22,plain,
not(sF1) = sF2,
introduced(function_definition,[]) ).
fof(f23,plain,
sF3 = or(sF2,sF0),
introduced(function_definition,[]) ).
fof(f24,plain,
sF4 = not(sF3),
introduced(function_definition,[]) ).
fof(f25,plain,
sF5 = not(sF0),
introduced(function_definition,[]) ).
fof(f20,plain,
not(p) = sF0,
introduced(function_definition,[]) ).
fof(f21,plain,
sF1 = or(sF0,sF0),
introduced(function_definition,[]) ).
fof(f26,plain,
or(sF5,sF1) = sF6,
introduced(function_definition,[]) ).
fof(f27,plain,
not(sF6) = sF7,
introduced(function_definition,[]) ).
fof(f28,plain,
sF8 = or(sF4,sF7),
introduced(function_definition,[]) ).
fof(f29,plain,
not(sF8) = sF9,
introduced(function_definition,[]) ).
fof(f13,plain,
~ theorem(not(or(not(or(not(or(not(p),not(p))),not(p))),not(or(not(not(p)),or(not(p),not(p))))))),
inference(definition_unfolding,[],[f11,f12,f6]) ).
fof(f6,axiom,
! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X6,X5] : equivalent(X5,X6) = and(implies(X5,X6),implies(X6,X5)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,axiom,
~ theorem(equivalent(implies(p,not(p)),not(p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f600,plain,
( theorem(sF9)
| ~ spl10_12 ),
inference(resolution,[],[f585,f90]) ).
fof(f90,plain,
! [X4] :
( ~ theorem(or(sF7,X4))
| theorem(X4) ),
inference(subsumption_resolution,[],[f80,f46]) ).
fof(f46,plain,
theorem(sF6),
inference(resolution,[],[f43,f7]) ).
fof(f7,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f43,plain,
axiom(sF6),
inference(forward_demodulation,[],[f42,f26]) ).
fof(f42,plain,
axiom(or(sF5,sF1)),
inference(forward_demodulation,[],[f38,f25]) ).
fof(f38,plain,
axiom(or(not(sF0),sF1)),
inference(superposition,[],[f15,f21]) ).
fof(f15,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(f80,plain,
! [X4] :
( theorem(X4)
| ~ theorem(sF6)
| ~ theorem(or(sF7,X4)) ),
inference(superposition,[],[f16,f27]) ).
fof(f16,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(implies(X4,X3))
| ~ theorem(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f585,plain,
( theorem(or(sF7,sF9))
| ~ spl10_12 ),
inference(resolution,[],[f583,f206]) ).
fof(f206,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f56,f16]) ).
fof(f56,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f14,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(f583,plain,
( theorem(or(sF9,sF7))
| ~ spl10_12 ),
inference(resolution,[],[f484,f570]) ).
fof(f570,plain,
! [X0] :
( ~ theorem(or(X0,sF8))
| theorem(or(X0,sF7)) ),
inference(resolution,[],[f567,f99]) ).
fof(f99,plain,
! [X3] :
( ~ theorem(or(sF4,X3))
| theorem(X3) ),
inference(subsumption_resolution,[],[f79,f54]) ).
fof(f54,plain,
theorem(sF3),
inference(resolution,[],[f53,f7]) ).
fof(f53,plain,
axiom(sF3),
inference(forward_demodulation,[],[f52,f23]) ).
fof(f52,plain,
axiom(or(sF2,sF0)),
inference(forward_demodulation,[],[f51,f22]) ).
fof(f51,plain,
axiom(or(not(sF1),sF0)),
inference(superposition,[],[f19,f21]) ).
fof(f19,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(f79,plain,
! [X3] :
( ~ theorem(or(sF4,X3))
| ~ theorem(sF3)
| theorem(X3) ),
inference(superposition,[],[f16,f24]) ).
fof(f567,plain,
! [X0] :
( theorem(or(sF4,or(X0,sF7)))
| ~ theorem(or(X0,sF8)) ),
inference(resolution,[],[f324,f16]) ).
fof(f324,plain,
! [X0] : theorem(or(not(or(X0,sF8)),or(sF4,or(X0,sF7)))),
inference(resolution,[],[f125,f7]) ).
fof(f125,plain,
! [X3] : axiom(or(not(or(X3,sF8)),or(sF4,or(X3,sF7)))),
inference(superposition,[],[f17,f28]) ).
fof(f17,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(f484,plain,
( theorem(or(sF9,sF8))
| ~ spl10_12 ),
inference(avatar_component_clause,[],[f482]) ).
fof(f482,plain,
( spl10_12
<=> theorem(or(sF9,sF8)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_12])]) ).
fof(f582,plain,
spl10_13,
inference(avatar_split_clause,[],[f575,f486]) ).
fof(f486,plain,
( spl10_13
<=> theorem(or(not(sF7),sF7)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_13])]) ).
fof(f575,plain,
theorem(or(not(sF7),sF7)),
inference(resolution,[],[f570,f49]) ).
fof(f49,plain,
theorem(or(not(sF7),sF8)),
inference(resolution,[],[f41,f7]) ).
fof(f41,plain,
axiom(or(not(sF7),sF8)),
inference(superposition,[],[f15,f28]) ).
fof(f489,plain,
( spl10_12
| ~ spl10_13 ),
inference(avatar_split_clause,[],[f479,f486,f482]) ).
fof(f479,plain,
( ~ theorem(or(not(sF7),sF7))
| theorem(or(sF9,sF8)) ),
inference(resolution,[],[f478,f16]) ).
fof(f478,plain,
theorem(or(not(or(not(sF7),sF7)),or(sF9,sF8))),
inference(resolution,[],[f451,f7]) ).
fof(f451,plain,
axiom(or(not(or(not(sF7),sF7)),or(sF9,sF8))),
inference(superposition,[],[f157,f28]) ).
fof(f157,plain,
! [X3] : axiom(or(not(or(not(sF7),X3)),or(sF9,or(sF4,X3)))),
inference(forward_demodulation,[],[f148,f29]) ).
fof(f148,plain,
! [X3] : axiom(or(not(or(not(sF7),X3)),or(not(sF8),or(sF4,X3)))),
inference(superposition,[],[f18,f28]) ).
fof(f18,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL311-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.34 % Computer : n015.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:04:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (6500)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.47 % (6508)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.49 % (6524)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.49 % (6516)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.50 % (6504)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (6508)First to succeed.
% 0.19/0.50 % (6508)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 % (6508)------------------------------
% 0.19/0.50 % (6508)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (6508)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (6508)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (6508)Memory used [KB]: 5756
% 0.19/0.50 % (6508)Time elapsed: 0.126 s
% 0.19/0.50 % (6508)Instructions burned: 18 (million)
% 0.19/0.50 % (6508)------------------------------
% 0.19/0.50 % (6508)------------------------------
% 0.19/0.50 % (6494)Success in time 0.156 s
%------------------------------------------------------------------------------