TSTP Solution File: LCL452+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL452+1 : TPTP v8.1.0. Released v3.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 : n008.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:48:23 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 17 unt; 0 def)
% Number of atoms : 59 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 37 ( 16 ~; 11 |; 0 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 44 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f261,plain,
$false,
inference(subsumption_resolution,[],[f260,f137]) ).
fof(f137,plain,
~ cn2,
inference(cnf_transformation,[],[f77]) ).
fof(f77,plain,
~ cn2,
inference(flattening,[],[f54]) ).
fof(f54,negated_conjecture,
~ cn2,
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2) ).
fof(f260,plain,
cn2,
inference(subsumption_resolution,[],[f149,f233]) ).
fof(f233,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(backward_demodulation,[],[f221,f232]) ).
fof(f232,plain,
! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))),
inference(subsumption_resolution,[],[f134,f133]) ).
fof(f133,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f134,plain,
! [X0,X1] :
( implies(X1,X0) = not(and(X1,not(X0)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
( ~ op_implies_and
| ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
inference(rectify,[],[f105]) ).
fof(f105,plain,
( ~ op_implies_and
| ! [X1,X0] : implies(X0,X1) = not(and(X0,not(X1))) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X1,X0] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f221,plain,
! [X0,X1] : is_a_theorem(implies(X0,not(and(not(X0),not(X1))))),
inference(forward_demodulation,[],[f220,f219]) ).
fof(f219,plain,
! [X0,X1] : or(X1,X0) = not(and(not(X1),not(X0))),
inference(subsumption_resolution,[],[f166,f146]) ).
fof(f146,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f166,plain,
! [X0,X1] :
( ~ op_or
| or(X1,X0) = not(and(not(X1),not(X0))) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
( ~ op_or
| ! [X0,X1] : or(X1,X0) = not(and(not(X1),not(X0))) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,plain,
( op_or
=> ! [X0,X1] : or(X1,X0) = not(and(not(X1),not(X0))) ),
inference(rectify,[],[f27]) ).
fof(f27,axiom,
( op_or
=> ! [X1,X0] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f220,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(subsumption_resolution,[],[f155,f163]) ).
fof(f163,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f155,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
( ~ or_1
| ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(rectify,[],[f109]) ).
fof(f109,plain,
( ~ or_1
| ! [X1,X0] : is_a_theorem(implies(X1,or(X1,X0))) ),
inference(ennf_transformation,[],[f85]) ).
fof(f85,plain,
( or_1
=> ! [X1,X0] : is_a_theorem(implies(X1,or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f70]) ).
fof(f70,plain,
( ! [X1,X0] : is_a_theorem(implies(X1,or(X1,X0)))
<=> or_1 ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
( or_1
<=> ! [X1,X0] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_1) ).
fof(f149,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f110,f125]) ).
fof(f125,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1)))
=> ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,plain,
( ! [X1,X0] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f57]) ).
fof(f57,plain,
( ! [X1,X0] : is_a_theorem(implies(X0,implies(not(X0),X1)))
<=> cn2 ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
( cn2
<=> ! [X3,X4] : is_a_theorem(implies(X3,implies(not(X3),X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL452+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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 : n008.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:27:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (15252)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.47 % (15252)First to succeed.
% 0.19/0.47 % (15244)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.48 % (15252)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (15252)------------------------------
% 0.19/0.48 % (15252)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (15252)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (15252)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (15252)Memory used [KB]: 5500
% 0.19/0.48 % (15252)Time elapsed: 0.006 s
% 0.19/0.48 % (15252)Instructions burned: 3 (million)
% 0.19/0.48 % (15252)------------------------------
% 0.19/0.48 % (15252)------------------------------
% 0.19/0.48 % (15228)Success in time 0.13 s
%------------------------------------------------------------------------------