TSTP Solution File: LCL469+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LCL469+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_uns --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:42:42 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 55 ( 15 unt; 0 def)
% Number of atoms : 103 ( 13 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 82 ( 34 ~; 29 |; 0 &)
% ( 12 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 48 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f227,plain,
$false,
inference(avatar_sat_refutation,[],[f137,f145,f153,f181,f190,f192,f194,f196,f226]) ).
fof(f226,plain,
( ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| spl2_18 ),
inference(avatar_contradiction_clause,[],[f223]) ).
fof(f223,plain,
( $false
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| spl2_18 ),
inference(resolution,[],[f218,f189]) ).
fof(f189,plain,
( ~ is_a_theorem(implies(sK1,or(sK1,sK0)))
| spl2_18 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f187,plain,
( spl2_18
<=> is_a_theorem(implies(sK1,or(sK1,sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_18])]) ).
fof(f218,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10 ),
inference(backward_demodulation,[],[f152,f216]) ).
fof(f216,plain,
( ! [X0,X1] : implies(not(X1),X0) = or(X1,X0)
| ~ spl2_6
| ~ spl2_8 ),
inference(forward_demodulation,[],[f136,f144]) ).
fof(f144,plain,
( ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0)))
| ~ spl2_8 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f143,plain,
( spl2_8
<=> ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_8])]) ).
fof(f136,plain,
( ! [X0,X1] : not(and(not(X1),not(X0))) = or(X1,X0)
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f135,plain,
( spl2_6
<=> ! [X0,X1] : not(and(not(X1),not(X0))) = or(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).
fof(f152,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ spl2_10 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f151,plain,
( spl2_10
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_10])]) ).
fof(f196,plain,
spl2_7,
inference(avatar_split_clause,[],[f101,f139]) ).
fof(f139,plain,
( spl2_7
<=> op_implies_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_7])]) ).
fof(f101,plain,
op_implies_and,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f194,plain,
~ spl2_17,
inference(avatar_split_clause,[],[f100,f183]) ).
fof(f183,plain,
( spl2_17
<=> or_1 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_17])]) ).
fof(f100,plain,
~ or_1,
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
~ or_1,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ or_1,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
or_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f192,plain,
spl2_5,
inference(avatar_split_clause,[],[f102,f131]) ).
fof(f131,plain,
( spl2_5
<=> op_or ),
introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).
fof(f102,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_or) ).
fof(f190,plain,
( spl2_17
| ~ spl2_18 ),
inference(avatar_split_clause,[],[f94,f187,f183]) ).
fof(f94,plain,
( ~ is_a_theorem(implies(sK1,or(sK1,sK0)))
| or_1 ),
inference(cnf_transformation,[],[f89]) ).
fof(f89,plain,
( ~ is_a_theorem(implies(sK1,or(sK1,sK0)))
| or_1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f85,f88]) ).
fof(f88,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X1,X0)))
=> ~ is_a_theorem(implies(sK1,or(sK1,sK0))) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X1,X0)))
| or_1 ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X1,X0)))
=> or_1 ),
inference(unused_predicate_definition_removal,[],[f63]) ).
fof(f63,plain,
( ! [X0,X1] : 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/sandbox/benchmark/theBenchmark.p',or_1) ).
fof(f181,plain,
spl2_9,
inference(avatar_split_clause,[],[f111,f147]) ).
fof(f147,plain,
( spl2_9
<=> cn2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_9])]) ).
fof(f111,plain,
cn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f153,plain,
( ~ spl2_9
| spl2_10 ),
inference(avatar_split_clause,[],[f113,f151,f147]) ).
fof(f113,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
( ~ cn2
| ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f70]) ).
fof(f70,plain,
( cn2
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(unused_predicate_definition_removal,[],[f65]) ).
fof(f65,plain,
( ! [X0,X1] : 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/sandbox/benchmark/theBenchmark.p',cn2) ).
fof(f145,plain,
( ~ spl2_7
| spl2_8 ),
inference(avatar_split_clause,[],[f97,f143,f139]) ).
fof(f97,plain,
! [X0,X1] :
( implies(X1,X0) = not(and(X1,not(X0)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
( ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
( op_implies_and
=> ! [X0,X1] : implies(X1,X0) = not(and(X1,not(X0))) ),
inference(rectify,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X1,X0] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f137,plain,
( ~ spl2_5
| spl2_6 ),
inference(avatar_split_clause,[],[f103,f135,f131]) ).
fof(f103,plain,
! [X0,X1] :
( not(and(not(X1),not(X0))) = or(X1,X0)
| ~ op_or ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
( ! [X0,X1] : not(and(not(X1),not(X0))) = or(X1,X0)
| ~ op_or ),
inference(ennf_transformation,[],[f64]) ).
fof(f64,plain,
( op_or
=> ! [X0,X1] : not(and(not(X1),not(X0))) = or(X1,X0) ),
inference(rectify,[],[f27]) ).
fof(f27,axiom,
( op_or
=> ! [X1,X0] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL469+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --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:07:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.54 % (5831)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.55 % (5853)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.55 % (5854)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.55 % (5846)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.55 % (5854)Refutation not found, incomplete strategy% (5854)------------------------------
% 0.20/0.55 % (5854)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (5831)First to succeed.
% 0.20/0.55 % (5854)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (5854)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.55
% 0.20/0.55 % (5854)Memory used [KB]: 1407
% 0.20/0.55 % (5854)Time elapsed: 0.007 s
% 0.20/0.55 % (5854)Instructions burned: 1 (million)
% 0.20/0.55 % (5854)------------------------------
% 0.20/0.55 % (5854)------------------------------
% 0.20/0.56 % (5838)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.56 % (5838)Refutation not found, incomplete strategy% (5838)------------------------------
% 0.20/0.56 % (5838)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (5838)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (5845)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.56 % (5838)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.56
% 0.20/0.56 % (5838)Memory used [KB]: 5884
% 0.20/0.56 % (5838)Time elapsed: 0.003 s
% 0.20/0.56 % (5838)Instructions burned: 2 (million)
% 0.20/0.56 % (5838)------------------------------
% 0.20/0.56 % (5838)------------------------------
% 0.20/0.56 % (5846)Also succeeded, but the first one will report.
% 0.20/0.56 % (5831)Refutation found. Thanks to Tanya!
% 0.20/0.56 % SZS status Theorem for theBenchmark
% 0.20/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56 % (5831)------------------------------
% 0.20/0.56 % (5831)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (5831)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (5831)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56 % (5831)Memory used [KB]: 6012
% 0.20/0.56 % (5831)Time elapsed: 0.125 s
% 0.20/0.56 % (5831)Instructions burned: 4 (million)
% 0.20/0.56 % (5831)------------------------------
% 0.20/0.56 % (5831)------------------------------
% 0.20/0.56 % (5830)Success in time 0.214 s
%------------------------------------------------------------------------------