TSTP Solution File: LCL258-3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL258-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 : n004.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:40 EDT 2022
% Result : Unsatisfiable 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 14 unt; 0 def)
% Number of atoms : 37 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 16 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f192,plain,
$false,
inference(resolution,[],[f188,f82]) ).
fof(f82,plain,
~ theorem(or(not(q),q)),
inference(resolution,[],[f46,f13]) ).
fof(f13,plain,
~ theorem(or(not(p),or(not(or(not(p),q)),q))),
inference(definition_unfolding,[],[f9,f6,f6,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(p,implies(implies(p,q),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f46,plain,
! [X3,X4,X5] :
( theorem(or(X5,or(not(or(X5,X3)),X4)))
| ~ theorem(or(not(X3),X4)) ),
inference(resolution,[],[f23,f22]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f12,f17]) ).
fof(f17,plain,
! [X0,X1] :
( ~ axiom(or(not(X0),X1))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f15,f7]) ).
fof(f7,axiom,
! [X3] :
( theorem(X3)
| ~ axiom(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f15,plain,
! [X3,X4] :
( ~ theorem(or(not(X4),X3))
| ~ theorem(X4)
| theorem(X3) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f8,axiom,
! [X3,X4] :
( ~ theorem(implies(X4,X3))
| ~ theorem(X4)
| theorem(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f12,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(f23,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f10,f17]) ).
fof(f10,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) ).
fof(f188,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f70,f11]) ).
fof(f11,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(f70,plain,
! [X6,X7] :
( ~ axiom(or(X6,or(or(X6,X7),X7)))
| theorem(or(X6,X7)) ),
inference(resolution,[],[f44,f19]) ).
fof(f19,plain,
! [X2] :
( ~ theorem(or(X2,X2))
| theorem(X2) ),
inference(resolution,[],[f17,f16]) ).
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(f44,plain,
! [X8,X6,X7] :
( theorem(or(X6,or(X7,X8)))
| ~ axiom(or(X7,or(X6,X8))) ),
inference(resolution,[],[f22,f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL258-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 : n004.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 01:44:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (9976)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.50 % (9968)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.52 % (9968)First to succeed.
% 0.19/0.52 % (9967)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.52 % (9968)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (9968)------------------------------
% 0.19/0.52 % (9968)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (9968)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (9968)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (9968)Memory used [KB]: 5500
% 0.19/0.52 % (9968)Time elapsed: 0.108 s
% 0.19/0.52 % (9968)Instructions burned: 6 (million)
% 0.19/0.52 % (9968)------------------------------
% 0.19/0.52 % (9968)------------------------------
% 0.19/0.52 % (9957)Success in time 0.17 s
%------------------------------------------------------------------------------