TSTP Solution File: LCL518+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL518+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 : n019.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:36 EDT 2022
% Result : Theorem 1.46s 0.59s
% Output : Refutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 29
% Syntax : Number of formulae : 130 ( 31 unt; 0 def)
% Number of atoms : 315 ( 32 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 338 ( 153 ~; 146 |; 3 &)
% ( 20 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 22 ( 20 usr; 20 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 170 ( 168 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1038,plain,
$false,
inference(avatar_sat_refutation,[],[f124,f140,f148,f149,f157,f158,f170,f172,f175,f176,f1032]) ).
fof(f1032,plain,
( ~ spl1_2
| ~ spl1_5
| ~ spl1_8
| ~ spl1_9
| ~ spl1_11 ),
inference(avatar_contradiction_clause,[],[f1026]) ).
fof(f1026,plain,
( $false
| ~ spl1_2
| ~ spl1_5
| ~ spl1_8
| ~ spl1_9
| ~ spl1_11 ),
inference(resolution,[],[f948,f171]) ).
fof(f171,plain,
~ is_a_theorem(implies(or(sK0,sK0),sK0)),
inference(subsumption_resolution,[],[f113,f108]) ).
fof(f108,plain,
~ r1,
inference(cnf_transformation,[],[f68]) ).
fof(f68,plain,
~ r1,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ r1,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
r1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r1) ).
fof(f113,plain,
( r1
| ~ is_a_theorem(implies(or(sK0,sK0),sK0)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
( ~ is_a_theorem(implies(or(sK0,sK0),sK0))
| r1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f85,f92]) ).
fof(f92,plain,
( ? [X0] : ~ is_a_theorem(implies(or(X0,X0),X0))
=> ~ is_a_theorem(implies(or(sK0,sK0),sK0)) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
( ? [X0] : ~ is_a_theorem(implies(or(X0,X0),X0))
| r1 ),
inference(ennf_transformation,[],[f69]) ).
fof(f69,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
=> r1 ),
inference(unused_predicate_definition_removal,[],[f65]) ).
fof(f65,plain,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(rectify,[],[f22]) ).
fof(f22,axiom,
( ! [X3] : is_a_theorem(implies(or(X3,X3),X3))
<=> r1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r1) ).
fof(f948,plain,
( ! [X2] : is_a_theorem(implies(or(X2,X2),X2))
| ~ spl1_2
| ~ spl1_5
| ~ spl1_8
| ~ spl1_9
| ~ spl1_11 ),
inference(resolution,[],[f928,f595]) ).
fof(f595,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(or(X0,X0),not(X1)))
| is_a_theorem(implies(X1,X0)) )
| ~ spl1_2
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(resolution,[],[f563,f123]) ).
fof(f123,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f122,plain,
( spl1_2
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f563,plain,
( ! [X0,X1] : is_a_theorem(implies(or(or(X1,X1),not(X0)),implies(X0,X1)))
| ~ spl1_2
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(forward_demodulation,[],[f562,f165]) ).
fof(f165,plain,
( ! [X0,X1] : or(X1,X0) = implies(not(X1),X0)
| ~ spl1_11 ),
inference(avatar_component_clause,[],[f164]) ).
fof(f164,plain,
( spl1_11
<=> ! [X0,X1] : or(X1,X0) = implies(not(X1),X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_11])]) ).
fof(f562,plain,
( ! [X0,X1] : is_a_theorem(implies(or(implies(not(X1),X1),not(X0)),implies(X0,X1)))
| ~ spl1_2
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(forward_demodulation,[],[f561,f223]) ).
fof(f223,plain,
( ! [X11,X12,X13] : or(and(not(X11),X12),X13) = implies(or(X11,not(X12)),X13)
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f152,f201]) ).
fof(f201,plain,
( ! [X0,X1] : not(or(X0,not(X1))) = and(not(X0),X1)
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f178,f165]) ).
fof(f178,plain,
( ! [X0,X1] : not(implies(X1,not(X0))) = and(X1,X0)
| ~ spl1_9 ),
inference(backward_demodulation,[],[f160,f152]) ).
fof(f160,plain,
! [X0,X1] : not(or(not(X1),not(X0))) = and(X1,X0),
inference(subsumption_resolution,[],[f102,f112]) ).
fof(f112,plain,
op_and,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f102,plain,
! [X0,X1] :
( ~ op_and
| not(or(not(X1),not(X0))) = and(X1,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
( ! [X0,X1] : not(or(not(X1),not(X0))) = and(X1,X0)
| ~ op_and ),
inference(ennf_transformation,[],[f63]) ).
fof(f63,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(f152,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl1_9 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f151,plain,
( spl1_9
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_9])]) ).
fof(f561,plain,
( ! [X0,X1] : is_a_theorem(or(and(not(implies(not(X1),X1)),X0),implies(X0,X1)))
| ~ spl1_2
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(forward_demodulation,[],[f559,f241]) ).
fof(f241,plain,
( ! [X2,X0,X1] : and(and(X0,not(X1)),X2) = and(not(implies(X0,X1)),X2)
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f225,f159]) ).
fof(f159,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(subsumption_resolution,[],[f115,f94]) ).
fof(f94,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f115,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
( ~ op_implies_and
| ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f225,plain,
( ! [X0,X1] : and(X0,X1) = and(not(not(X0)),X1)
| ~ spl1_9
| ~ spl1_11 ),
inference(forward_demodulation,[],[f218,f178]) ).
fof(f218,plain,
( ! [X0,X1] : not(implies(X0,not(X1))) = and(not(not(X0)),X1)
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f201,f152]) ).
fof(f559,plain,
( ! [X0,X1] : is_a_theorem(or(and(and(not(X1),not(X1)),X0),implies(X0,X1)))
| ~ spl1_2
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f402,f159]) ).
fof(f402,plain,
( ! [X0,X1] : is_a_theorem(or(and(and(X0,X0),X1),not(and(X1,X0))))
| ~ spl1_2
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(resolution,[],[f342,f177]) ).
fof(f177,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X0),or(and(X0,X1),not(and(X1,X2)))))
| ~ spl1_11 ),
inference(backward_demodulation,[],[f161,f165]) ).
fof(f161,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X0),implies(not(and(X0,X1)),not(and(X1,X2))))),
inference(subsumption_resolution,[],[f99,f97]) ).
fof(f97,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f99,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),implies(not(and(X0,X1)),not(and(X1,X2)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f89]) ).
fof(f89,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X2,X0),implies(not(and(X0,X1)),not(and(X1,X2)))))
| ~ kn3 ),
inference(rectify,[],[f77]) ).
fof(f77,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X0)),not(and(X0,X1)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f70]) ).
fof(f70,plain,
( kn3
=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X0)),not(and(X0,X1))))) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f58,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X0)),not(and(X0,X1)))))
<=> kn3 ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
( kn3
<=> ! [X5,X3,X4] : is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn3) ).
fof(f342,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,and(X0,X0)),X1))
| is_a_theorem(X1) )
| ~ spl1_2
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(resolution,[],[f214,f208]) ).
fof(f208,plain,
( ! [X0] : is_a_theorem(not(not(implies(X0,and(X0,X0)))))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(backward_demodulation,[],[f194,f200]) ).
fof(f200,plain,
( ! [X3,X4,X5] : not(implies(X5,and(X3,X4))) = and(X5,implies(X3,not(X4)))
| ~ spl1_9 ),
inference(superposition,[],[f178,f178]) ).
fof(f194,plain,
( ! [X0] : is_a_theorem(not(and(X0,implies(X0,not(X0)))))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(forward_demodulation,[],[f193,f152]) ).
fof(f193,plain,
( ! [X0] : is_a_theorem(not(and(X0,or(not(X0),not(X0)))))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(forward_demodulation,[],[f192,f165]) ).
fof(f192,plain,
( ! [X0] : is_a_theorem(not(and(X0,implies(not(not(X0)),not(X0)))))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(forward_demodulation,[],[f190,f185]) ).
fof(f185,plain,
! [X2,X0,X1] : implies(X2,and(X0,not(X1))) = not(and(X2,implies(X0,X1))),
inference(superposition,[],[f159,f159]) ).
fof(f190,plain,
( ! [X0] : is_a_theorem(implies(X0,and(not(not(X0)),not(not(X0)))))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f183,f152]) ).
fof(f183,plain,
( ! [X0] : is_a_theorem(or(X0,and(not(X0),not(X0))))
| ~ spl1_5
| ~ spl1_11 ),
inference(superposition,[],[f135,f165]) ).
fof(f135,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f134]) ).
fof(f134,plain,
( spl1_5
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
fof(f214,plain,
( ! [X0,X1] :
( ~ is_a_theorem(not(not(X0)))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) )
| ~ spl1_2
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f184,f152]) ).
fof(f184,plain,
( ! [X2,X1] :
( ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(not(X1))
| is_a_theorem(X2) )
| ~ spl1_2
| ~ spl1_11 ),
inference(superposition,[],[f123,f165]) ).
fof(f928,plain,
( ! [X0] : is_a_theorem(or(X0,not(X0)))
| ~ spl1_2
| ~ spl1_5
| ~ spl1_8
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f905,f165]) ).
fof(f905,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl1_2
| ~ spl1_5
| ~ spl1_8
| ~ spl1_9
| ~ spl1_11 ),
inference(resolution,[],[f595,f665]) ).
fof(f665,plain,
( ! [X0,X1] : is_a_theorem(or(or(X0,X1),not(X0)))
| ~ spl1_8
| ~ spl1_9
| ~ spl1_11 ),
inference(superposition,[],[f623,f165]) ).
fof(f623,plain,
( ! [X0,X1] : is_a_theorem(or(implies(X0,X1),X0))
| ~ spl1_8
| ~ spl1_9 ),
inference(superposition,[],[f147,f187]) ).
fof(f187,plain,
( ! [X3,X4,X5] : implies(and(X3,not(X4)),X5) = or(implies(X3,X4),X5)
| ~ spl1_9 ),
inference(superposition,[],[f152,f159]) ).
fof(f147,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f146]) ).
fof(f146,plain,
( spl1_8
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_8])]) ).
fof(f176,plain,
spl1_6,
inference(avatar_split_clause,[],[f111,f137]) ).
fof(f137,plain,
( spl1_6
<=> kn1 ),
introduced(avatar_definition,[new_symbols(naming,[spl1_6])]) ).
fof(f111,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f175,plain,
spl1_12,
inference(avatar_split_clause,[],[f114,f167]) ).
fof(f167,plain,
( spl1_12
<=> op_or ),
introduced(avatar_definition,[new_symbols(naming,[spl1_12])]) ).
fof(f114,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f172,plain,
spl1_1,
inference(avatar_split_clause,[],[f106,f118]) ).
fof(f118,plain,
( spl1_1
<=> modus_ponens ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f106,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f170,plain,
( spl1_11
| ~ spl1_12 ),
inference(avatar_split_clause,[],[f162,f167,f164]) ).
fof(f162,plain,
! [X0,X1] :
( ~ op_or
| or(X1,X0) = implies(not(X1),X0) ),
inference(forward_demodulation,[],[f110,f159]) ).
fof(f110,plain,
! [X0,X1] :
( or(X1,X0) = not(and(not(X1),not(X0)))
| ~ op_or ),
inference(cnf_transformation,[],[f79]) ).
fof(f79,plain,
( ! [X0,X1] : or(X1,X0) = not(and(not(X1),not(X0)))
| ~ op_or ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,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(f158,plain,
spl1_10,
inference(avatar_split_clause,[],[f105,f154]) ).
fof(f154,plain,
( spl1_10
<=> op_implies_or ),
introduced(avatar_definition,[new_symbols(naming,[spl1_10])]) ).
fof(f105,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f157,plain,
( spl1_9
| ~ spl1_10 ),
inference(avatar_split_clause,[],[f98,f154,f151]) ).
fof(f98,plain,
! [X0,X1] :
( ~ op_implies_or
| implies(X0,X1) = or(not(X0),X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
( ~ op_implies_or
| ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
inference(rectify,[],[f86]) ).
fof(f86,plain,
( ~ op_implies_or
| ! [X1,X0] : implies(X1,X0) = or(not(X1),X0) ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,plain,
( op_implies_or
=> ! [X1,X0] : implies(X1,X0) = or(not(X1),X0) ),
inference(rectify,[],[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(f149,plain,
spl1_7,
inference(avatar_split_clause,[],[f107,f142]) ).
fof(f142,plain,
( spl1_7
<=> kn2 ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
fof(f107,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f148,plain,
( ~ spl1_7
| spl1_8 ),
inference(avatar_split_clause,[],[f96,f146,f142]) ).
fof(f96,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
( ~ kn2
| ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(rectify,[],[f75]) ).
fof(f75,plain,
( ~ kn2
| ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,plain,
( kn2
=> ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(unused_predicate_definition_removal,[],[f61]) ).
fof(f61,plain,
( ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1))
<=> kn2 ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
( kn2
<=> ! [X4,X3] : is_a_theorem(implies(and(X3,X4),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f140,plain,
( spl1_5
| ~ spl1_6 ),
inference(avatar_split_clause,[],[f104,f137,f134]) ).
fof(f104,plain,
! [X0] :
( ~ kn1
| is_a_theorem(implies(X0,and(X0,X0))) ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
( ~ kn1
| ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f66]) ).
fof(f66,plain,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
( ! [X3] : is_a_theorem(implies(X3,and(X3,X3)))
<=> kn1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn1) ).
fof(f124,plain,
( ~ spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f101,f122,f118]) ).
fof(f101,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(rectify,[],[f83]) ).
fof(f83,plain,
( ! [X1,X0] :
( ~ is_a_theorem(X1)
| is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0)) )
| ~ modus_ponens ),
inference(flattening,[],[f82]) ).
fof(f82,plain,
( ! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f74]) ).
fof(f74,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X1,X0))
& is_a_theorem(X1) )
=> is_a_theorem(X0) ) ),
inference(unused_predicate_definition_removal,[],[f45]) ).
fof(f45,plain,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X1,X0))
& is_a_theorem(X1) )
=> is_a_theorem(X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
( modus_ponens
<=> ! [X1,X0] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL518+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % 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 : n019.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 02:09:35 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.50 % (23529)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.22/0.51 % (23519)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.22/0.51 % (23509)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.51 % (23501)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.51 % (23498)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.51 % (23499)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.22/0.51 % (23500)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.51 % (23522)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.22/0.51 % (23511)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.22/0.52 % (23510)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.22/0.52 % (23514)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.22/0.52 % (23507)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.22/0.52 % (23512)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.22/0.52 % (23505)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.53 % (23518)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.22/0.53 % (23516)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.22/0.53 TRYING [1]
% 0.22/0.53 TRYING [2]
% 0.22/0.53 % (23513)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)
% 1.32/0.53 % (23524)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.32/0.53 % (23527)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.32/0.53 % (23517)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.32/0.54 % (23497)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.32/0.54 TRYING [1]
% 1.32/0.54 TRYING [2]
% 1.32/0.54 % (23505)Instruction limit reached!
% 1.32/0.54 % (23505)------------------------------
% 1.32/0.54 % (23505)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.54 % (23505)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.54 % (23505)Termination reason: Unknown
% 1.32/0.54 % (23505)Termination phase: Saturation
% 1.32/0.54
% 1.32/0.54 % (23505)Memory used [KB]: 5628
% 1.32/0.54 % (23505)Time elapsed: 0.096 s
% 1.32/0.54 % (23505)Instructions burned: 8 (million)
% 1.32/0.54 % (23505)------------------------------
% 1.32/0.54 % (23505)------------------------------
% 1.32/0.54 % (23504)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)
% 1.32/0.54 TRYING [3]
% 1.32/0.54 % (23526)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)
% 1.32/0.54 TRYING [1]
% 1.32/0.54 TRYING [2]
% 1.32/0.54 % (23521)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.32/0.54 % (23503)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)
% 1.32/0.54 % (23515)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.32/0.55 % (23506)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.32/0.55 % (23506)Instruction limit reached!
% 1.32/0.55 % (23506)------------------------------
% 1.32/0.55 % (23506)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.55 TRYING [3]
% 1.46/0.55 % (23530)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.46/0.55 % (23506)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.55 % (23506)Termination reason: Unknown
% 1.46/0.55 % (23506)Termination phase: Saturation
% 1.46/0.55
% 1.46/0.55 % (23506)Memory used [KB]: 5500
% 1.46/0.55 % (23506)Time elapsed: 0.005 s
% 1.46/0.55 % (23506)Instructions burned: 2 (million)
% 1.46/0.55 % (23506)------------------------------
% 1.46/0.55 % (23506)------------------------------
% 1.46/0.55 % (23520)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.46/0.55 TRYING [3]
% 1.46/0.56 TRYING [4]
% 1.46/0.56 % (23525)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.46/0.57 TRYING [4]
% 1.46/0.57 % (23499)Instruction limit reached!
% 1.46/0.57 % (23499)------------------------------
% 1.46/0.57 % (23499)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.57 % (23499)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.57 % (23499)Termination reason: Unknown
% 1.46/0.57 % (23499)Termination phase: Saturation
% 1.46/0.57
% 1.46/0.57 % (23499)Memory used [KB]: 1791
% 1.46/0.57 % (23499)Time elapsed: 0.138 s
% 1.46/0.57 % (23499)Instructions burned: 37 (million)
% 1.46/0.57 % (23499)------------------------------
% 1.46/0.57 % (23499)------------------------------
% 1.46/0.57 % (23529)First to succeed.
% 1.46/0.58 TRYING [4]
% 1.46/0.59 % (23504)Instruction limit reached!
% 1.46/0.59 % (23504)------------------------------
% 1.46/0.59 % (23504)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.59 % (23504)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.59 % (23504)Termination reason: Unknown
% 1.46/0.59 % (23504)Termination phase: Finite model building SAT solving
% 1.46/0.59
% 1.46/0.59 % (23504)Memory used [KB]: 7291
% 1.46/0.59 % (23504)Time elapsed: 0.183 s
% 1.46/0.59 % (23504)Instructions burned: 53 (million)
% 1.46/0.59 % (23504)------------------------------
% 1.46/0.59 % (23504)------------------------------
% 1.46/0.59 % (23529)Refutation found. Thanks to Tanya!
% 1.46/0.59 % SZS status Theorem for theBenchmark
% 1.46/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.46/0.59 % (23529)------------------------------
% 1.46/0.59 % (23529)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.59 % (23529)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.59 % (23529)Termination reason: Refutation
% 1.46/0.59
% 1.46/0.59 % (23529)Memory used [KB]: 6268
% 1.46/0.59 % (23529)Time elapsed: 0.155 s
% 1.46/0.59 % (23529)Instructions burned: 37 (million)
% 1.46/0.59 % (23529)------------------------------
% 1.46/0.59 % (23529)------------------------------
% 1.46/0.59 % (23493)Success in time 0.227 s
%------------------------------------------------------------------------------