TSTP Solution File: LCL491+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL491+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 : n012.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:31 EDT 2022
% Result : Theorem 0.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 77 ( 21 unt; 0 def)
% Number of atoms : 150 ( 27 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 128 ( 55 ~; 50 |; 0 &)
% ( 14 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 19 ( 17 usr; 17 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 76 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f221,plain,
$false,
inference(avatar_sat_refutation,[],[f145,f154,f156,f172,f180,f189,f191,f195,f196,f200,f220]) ).
fof(f220,plain,
( ~ spl2_3
| spl2_5
| ~ spl2_9
| ~ spl2_12
| ~ spl2_13 ),
inference(avatar_contradiction_clause,[],[f219]) ).
fof(f219,plain,
( $false
| ~ spl2_3
| spl2_5
| ~ spl2_9
| ~ spl2_12
| ~ spl2_13 ),
inference(subsumption_resolution,[],[f218,f208]) ).
fof(f208,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,implies(not(X0),X1)))
| ~ spl2_3
| ~ spl2_9
| ~ spl2_12
| ~ spl2_13 ),
inference(backward_demodulation,[],[f184,f206]) ).
fof(f206,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl2_3
| ~ spl2_9
| ~ spl2_12 ),
inference(forward_demodulation,[],[f205,f202]) ).
fof(f202,plain,
( ! [X0,X1] : implies(X0,X1) = not(not(implies(X0,not(not(X1)))))
| ~ spl2_9
| ~ spl2_12 ),
inference(backward_demodulation,[],[f179,f201]) ).
fof(f201,plain,
( ! [X0,X1] : not(implies(X1,not(X0))) = and(X1,X0)
| ~ spl2_9 ),
inference(forward_demodulation,[],[f167,f199]) ).
fof(f199,plain,
! [X0,X1] : implies(X1,X0) = or(not(X1),X0),
inference(subsumption_resolution,[],[f108,f122]) ).
fof(f122,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f108,plain,
! [X0,X1] :
( implies(X1,X0) = or(not(X1),X0)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f97]) ).
fof(f97,plain,
( ! [X0,X1] : implies(X1,X0) = or(not(X1),X0)
| ~ op_implies_or ),
inference(rectify,[],[f90]) ).
fof(f90,plain,
( ! [X1,X0] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,axiom,
( op_implies_or
=> ! [X1,X0] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f167,plain,
( ! [X0,X1] : not(or(not(X1),not(X0))) = and(X1,X0)
| ~ spl2_9 ),
inference(avatar_component_clause,[],[f166]) ).
fof(f166,plain,
( spl2_9
<=> ! [X0,X1] : not(or(not(X1),not(X0))) = and(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_9])]) ).
fof(f179,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl2_12 ),
inference(avatar_component_clause,[],[f178]) ).
fof(f178,plain,
( spl2_12
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_12])]) ).
fof(f205,plain,
( ! [X0,X1] : or(X0,X1) = not(not(implies(not(X0),not(not(X1)))))
| ~ spl2_3
| ~ spl2_9 ),
inference(forward_demodulation,[],[f140,f201]) ).
fof(f140,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f139,plain,
( spl2_3
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f184,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ spl2_13 ),
inference(avatar_component_clause,[],[f183]) ).
fof(f183,plain,
( spl2_13
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_13])]) ).
fof(f218,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK1),sK0)))
| ~ spl2_3
| spl2_5
| ~ spl2_9
| ~ spl2_12 ),
inference(forward_demodulation,[],[f149,f206]) ).
fof(f149,plain,
( ~ is_a_theorem(implies(sK0,or(sK1,sK0)))
| spl2_5 ),
inference(avatar_component_clause,[],[f147]) ).
fof(f147,plain,
( spl2_5
<=> is_a_theorem(implies(sK0,or(sK1,sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).
fof(f200,plain,
spl2_11,
inference(avatar_split_clause,[],[f115,f174]) ).
fof(f174,plain,
( spl2_11
<=> op_implies_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_11])]) ).
fof(f115,plain,
op_implies_and,
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f196,plain,
spl2_14,
inference(avatar_split_clause,[],[f118,f186]) ).
fof(f186,plain,
( spl2_14
<=> r2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_14])]) ).
fof(f118,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(f195,plain,
spl2_4,
inference(avatar_split_clause,[],[f127,f142]) ).
fof(f142,plain,
( spl2_4
<=> op_or ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f127,plain,
op_or,
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f191,plain,
spl2_10,
inference(avatar_split_clause,[],[f120,f169]) ).
fof(f169,plain,
( spl2_10
<=> op_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_10])]) ).
fof(f120,plain,
op_and,
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f189,plain,
( spl2_13
| ~ spl2_14 ),
inference(avatar_split_clause,[],[f106,f186,f183]) ).
fof(f106,plain,
! [X0,X1] :
( ~ r2
| is_a_theorem(implies(X1,or(X0,X1))) ),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f76]) ).
fof(f76,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f72]) ).
fof(f72,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
<=> r2 ),
inference(rectify,[],[f23]) ).
fof(f23,axiom,
( ! [X3,X4] : is_a_theorem(implies(X4,or(X3,X4)))
<=> r2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2) ).
fof(f180,plain,
( ~ spl2_11
| spl2_12 ),
inference(avatar_split_clause,[],[f124,f178,f174]) ).
fof(f124,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(rectify,[],[f92]) ).
fof(f92,plain,
( ! [X1,X0] : implies(X1,X0) = not(and(X1,not(X0)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f62]) ).
fof(f62,plain,
( op_implies_and
=> ! [X1,X0] : 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/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f172,plain,
( spl2_9
| ~ spl2_10 ),
inference(avatar_split_clause,[],[f104,f169,f166]) ).
fof(f104,plain,
! [X0,X1] :
( ~ op_and
| not(or(not(X1),not(X0))) = and(X1,X0) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
( ! [X0,X1] : not(or(not(X1),not(X0))) = and(X1,X0)
| ~ op_and ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,plain,
( op_and
=> ! [X0,X1] : not(or(not(X1),not(X0))) = and(X1,X0) ),
inference(rectify,[],[f28]) ).
fof(f28,axiom,
( op_and
=> ! [X1,X0] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_and) ).
fof(f156,plain,
~ spl2_6,
inference(avatar_split_clause,[],[f109,f151]) ).
fof(f151,plain,
( spl2_6
<=> or_2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).
fof(f109,plain,
~ or_2,
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
~ or_2,
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
~ or_2,
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
or_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_2) ).
fof(f154,plain,
( ~ spl2_5
| spl2_6 ),
inference(avatar_split_clause,[],[f105,f151,f147]) ).
fof(f105,plain,
( or_2
| ~ is_a_theorem(implies(sK0,or(sK1,sK0))) ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
( or_2
| ~ is_a_theorem(implies(sK0,or(sK1,sK0))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f83,f95]) ).
fof(f95,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,or(X1,X0)))
=> ~ is_a_theorem(implies(sK0,or(sK1,sK0))) ),
introduced(choice_axiom,[]) ).
fof(f83,plain,
( or_2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,or(X1,X0))) ),
inference(ennf_transformation,[],[f78]) ).
fof(f78,plain,
( ! [X1,X0] : is_a_theorem(implies(X0,or(X1,X0)))
=> or_2 ),
inference(unused_predicate_definition_removal,[],[f63]) ).
fof(f63,plain,
( ! [X1,X0] : is_a_theorem(implies(X0,or(X1,X0)))
<=> or_2 ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
( ! [X1,X0] : is_a_theorem(implies(X1,or(X0,X1)))
<=> or_2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_2) ).
fof(f145,plain,
( spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f112,f142,f139]) ).
fof(f112,plain,
! [X0,X1] :
( ~ op_or
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LCL491+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32 % Computer : n012.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 02:03:36 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.46 % (26388)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.17/0.47 % (26371)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.47 % (26380)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.17/0.47 % (26388)First to succeed.
% 0.17/0.47 % (26379)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.17/0.47 % (26380)Also succeeded, but the first one will report.
% 0.17/0.48 % (26388)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Theorem for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48 % (26388)------------------------------
% 0.17/0.48 % (26388)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.48 % (26388)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.48 % (26388)Termination reason: Refutation
% 0.17/0.48
% 0.17/0.48 % (26388)Memory used [KB]: 5500
% 0.17/0.48 % (26388)Time elapsed: 0.010 s
% 0.17/0.48 % (26388)Instructions burned: 3 (million)
% 0.17/0.48 % (26388)------------------------------
% 0.17/0.48 % (26388)------------------------------
% 0.17/0.48 % (26364)Success in time 0.155 s
%------------------------------------------------------------------------------