TSTP Solution File: LCL174-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL174-1 : TPTP v8.1.0. Released v1.1.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 : n018.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:07 EDT 2022
% Result : Unsatisfiable 0.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 27 ( 24 unt; 0 def)
% Number of atoms : 31 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 11 ( 7 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 13 ( 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f526,plain,
$false,
inference(subsumption_resolution,[],[f525,f476]) ).
fof(f476,plain,
~ theorem(or(sF5,or(sF2,sF6))),
inference(subsumption_resolution,[],[f474,f19]) ).
fof(f19,plain,
~ theorem(sF8),
inference(definition_folding,[],[f9,f18,f17,f16,f10,f15,f14,f13,f12,f11,f10]) ).
fof(f11,plain,
or(sF0,q) = sF1,
introduced(function_definition,[]) ).
fof(f12,plain,
not(sF1) = sF2,
introduced(function_definition,[]) ).
fof(f13,plain,
not(q) = sF3,
introduced(function_definition,[]) ).
fof(f14,plain,
or(sF3,r) = sF4,
introduced(function_definition,[]) ).
fof(f15,plain,
not(sF4) = sF5,
introduced(function_definition,[]) ).
fof(f10,plain,
not(p) = sF0,
introduced(function_definition,[]) ).
fof(f16,plain,
sF6 = or(sF0,r),
introduced(function_definition,[]) ).
fof(f17,plain,
or(sF5,sF6) = sF7,
introduced(function_definition,[]) ).
fof(f18,plain,
sF8 = or(sF2,sF7),
introduced(function_definition,[]) ).
fof(f9,axiom,
~ theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f474,plain,
( ~ theorem(or(sF5,or(sF2,sF6)))
| theorem(sF8) ),
inference(resolution,[],[f473,f7]) ).
fof(f7,axiom,
! [X3,X4] :
( ~ axiom(or(not(X4),X3))
| ~ theorem(X4)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f473,plain,
axiom(or(not(or(sF5,or(sF2,sF6))),sF8)),
inference(superposition,[],[f210,f18]) ).
fof(f210,plain,
! [X4] : axiom(or(not(or(sF5,or(X4,sF6))),or(X4,sF7))),
inference(superposition,[],[f4,f17]) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f525,plain,
theorem(or(sF5,or(sF2,sF6))),
inference(resolution,[],[f522,f6]) ).
fof(f6,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f522,plain,
axiom(or(sF5,or(sF2,sF6))),
inference(forward_demodulation,[],[f521,f15]) ).
fof(f521,plain,
axiom(or(not(sF4),or(sF2,sF6))),
inference(forward_demodulation,[],[f518,f16]) ).
fof(f518,plain,
axiom(or(not(sF4),or(sF2,or(sF0,r)))),
inference(superposition,[],[f382,f14]) ).
fof(f382,plain,
! [X0] : axiom(or(not(or(sF3,X0)),or(sF2,or(sF0,X0)))),
inference(forward_demodulation,[],[f381,f13]) ).
fof(f381,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(sF2,or(sF0,X0)))),
inference(forward_demodulation,[],[f370,f12]) ).
fof(f370,plain,
! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF1),or(sF0,X0)))),
inference(superposition,[],[f5,f11]) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL174-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/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.15/0.35 % Computer : n018.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 30 01:44:12 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.46 % (23557)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.21/0.46 % (23564)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.21/0.48 % (23564)First to succeed.
% 0.21/0.48 % (23564)Refutation found. Thanks to Tanya!
% 0.21/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.48 % (23564)------------------------------
% 0.21/0.48 % (23564)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.48 % (23564)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.48 % (23564)Termination reason: Refutation
% 0.21/0.48
% 0.21/0.48 % (23564)Memory used [KB]: 5756
% 0.21/0.48 % (23564)Time elapsed: 0.023 s
% 0.21/0.48 % (23564)Instructions burned: 20 (million)
% 0.21/0.48 % (23564)------------------------------
% 0.21/0.48 % (23564)------------------------------
% 0.21/0.48 % (23550)Success in time 0.127 s
%------------------------------------------------------------------------------