TSTP Solution File: LCL512+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL512+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n029.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 : Tue Apr 30 13:42:37 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 43
% Syntax : Number of formulae : 125 ( 30 unt; 0 def)
% Number of atoms : 258 ( 22 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 222 ( 89 ~; 84 |; 2 &)
% ( 33 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 36 ( 34 usr; 34 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 128 ( 124 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f244,plain,
$false,
inference(avatar_sat_refutation,[],[f102,f107,f112,f117,f122,f127,f132,f137,f142,f146,f150,f154,f159,f163,f169,f174,f187,f193,f197,f202,f214,f221,f225,f229,f243]) ).
fof(f243,plain,
( spl2_13
| ~ spl2_24 ),
inference(avatar_contradiction_clause,[],[f240]) ).
fof(f240,plain,
( $false
| spl2_13
| ~ spl2_24 ),
inference(resolution,[],[f228,f158]) ).
fof(f158,plain,
( ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1)))
| spl2_13 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f156,plain,
( spl2_13
<=> is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_13])]) ).
fof(f228,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
| ~ spl2_24 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f227,plain,
( spl2_24
<=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_24])]) ).
fof(f229,plain,
( spl2_24
| ~ spl2_11
| ~ spl2_17 ),
inference(avatar_split_clause,[],[f189,f185,f148,f227]) ).
fof(f148,plain,
( spl2_11
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_11])]) ).
fof(f185,plain,
( spl2_17
<=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_17])]) ).
fof(f189,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
| ~ spl2_11
| ~ spl2_17 ),
inference(superposition,[],[f149,f186]) ).
fof(f186,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ spl2_17 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f149,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl2_11 ),
inference(avatar_component_clause,[],[f148]) ).
fof(f225,plain,
( spl2_23
| ~ spl2_10
| ~ spl2_17 ),
inference(avatar_split_clause,[],[f188,f185,f144,f223]) ).
fof(f223,plain,
( spl2_23
<=> ! [X0] : is_a_theorem(implies(implies(X0,X0),equiv(X0,X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_23])]) ).
fof(f144,plain,
( spl2_10
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_10])]) ).
fof(f188,plain,
( ! [X0] : is_a_theorem(implies(implies(X0,X0),equiv(X0,X0)))
| ~ spl2_10
| ~ spl2_17 ),
inference(superposition,[],[f145,f186]) ).
fof(f145,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ spl2_10 ),
inference(avatar_component_clause,[],[f144]) ).
fof(f221,plain,
( spl2_22
| ~ spl2_15
| ~ spl2_16 ),
inference(avatar_split_clause,[],[f179,f172,f167,f219]) ).
fof(f219,plain,
( spl2_22
<=> ! [X0,X1] : or(X0,X1) = implies(not(X0),X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_22])]) ).
fof(f167,plain,
( spl2_15
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_15])]) ).
fof(f172,plain,
( spl2_16
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_16])]) ).
fof(f179,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl2_15
| ~ spl2_16 ),
inference(superposition,[],[f173,f168]) ).
fof(f168,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl2_15 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f173,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl2_16 ),
inference(avatar_component_clause,[],[f172]) ).
fof(f214,plain,
( spl2_21
| ~ spl2_11
| ~ spl2_14 ),
inference(avatar_split_clause,[],[f165,f161,f148,f212]) ).
fof(f212,plain,
( spl2_21
<=> ! [X0,X1] :
( ~ is_a_theorem(and(X0,X1))
| is_a_theorem(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_21])]) ).
fof(f161,plain,
( spl2_14
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_14])]) ).
fof(f165,plain,
( ! [X0,X1] :
( ~ is_a_theorem(and(X0,X1))
| is_a_theorem(X0) )
| ~ spl2_11
| ~ spl2_14 ),
inference(resolution,[],[f162,f149]) ).
fof(f162,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) )
| ~ spl2_14 ),
inference(avatar_component_clause,[],[f161]) ).
fof(f202,plain,
( spl2_20
| ~ spl2_15
| ~ spl2_16
| ~ spl2_19 ),
inference(avatar_split_clause,[],[f198,f195,f172,f167,f200]) ).
fof(f200,plain,
( spl2_20
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_20])]) ).
fof(f195,plain,
( spl2_19
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_19])]) ).
fof(f198,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0)))))
| ~ spl2_15
| ~ spl2_16
| ~ spl2_19 ),
inference(forward_demodulation,[],[f196,f179]) ).
fof(f196,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ spl2_19 ),
inference(avatar_component_clause,[],[f195]) ).
fof(f197,plain,
( ~ spl2_4
| spl2_19 ),
inference(avatar_split_clause,[],[f97,f195,f114]) ).
fof(f114,plain,
( spl2_4
<=> kn3 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f97,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f74]) ).
fof(f74,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,plain,
( kn3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(unused_predicate_definition_removal,[],[f56]) ).
fof(f56,plain,
( kn3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
( kn3
<=> ! [X3,X4,X5] : is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn3) ).
fof(f193,plain,
( spl2_18
| ~ spl2_10
| ~ spl2_14 ),
inference(avatar_split_clause,[],[f164,f161,f144,f191]) ).
fof(f191,plain,
( spl2_18
<=> ! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(and(X0,X0)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_18])]) ).
fof(f164,plain,
( ! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(and(X0,X0)) )
| ~ spl2_10
| ~ spl2_14 ),
inference(resolution,[],[f162,f145]) ).
fof(f187,plain,
( ~ spl2_9
| spl2_17 ),
inference(avatar_split_clause,[],[f91,f185,f139]) ).
fof(f139,plain,
( spl2_9
<=> op_equiv ),
introduced(avatar_definition,[new_symbols(naming,[spl2_9])]) ).
fof(f91,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_equiv) ).
fof(f174,plain,
( ~ spl2_7
| spl2_16 ),
inference(avatar_split_clause,[],[f90,f172,f129]) ).
fof(f129,plain,
( spl2_7
<=> op_or ),
introduced(avatar_definition,[new_symbols(naming,[spl2_7])]) ).
fof(f90,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f66]) ).
fof(f66,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/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f169,plain,
( ~ spl2_8
| spl2_15 ),
inference(avatar_split_clause,[],[f89,f167,f134]) ).
fof(f134,plain,
( spl2_8
<=> op_implies_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_8])]) ).
fof(f89,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f163,plain,
( ~ spl2_6
| spl2_14 ),
inference(avatar_split_clause,[],[f96,f161,f124]) ).
fof(f124,plain,
( spl2_6
<=> modus_ponens ),
introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).
fof(f96,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f72]) ).
fof(f72,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f62]) ).
fof(f62,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f159,plain,
( ~ spl2_13
| spl2_1 ),
inference(avatar_split_clause,[],[f92,f99,f156]) ).
fof(f99,plain,
( spl2_1
<=> equivalence_1 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f92,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f68,f75]) ).
fof(f75,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
=> ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
( equivalence_1
| ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
=> equivalence_1 ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f13,axiom,
( equivalence_1
<=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_1) ).
fof(f154,plain,
( ~ spl2_5
| spl2_12 ),
inference(avatar_split_clause,[],[f95,f152,f119]) ).
fof(f119,plain,
( spl2_5
<=> substitution_of_equivalents ),
introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).
fof(f152,plain,
( spl2_12
<=> ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_12])]) ).
fof(f95,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f150,plain,
( ~ spl2_3
| spl2_11 ),
inference(avatar_split_clause,[],[f94,f148,f109]) ).
fof(f109,plain,
( spl2_3
<=> kn2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f94,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f70,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f55,plain,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
( kn2
<=> ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).
fof(f146,plain,
( ~ spl2_2
| spl2_10 ),
inference(avatar_split_clause,[],[f93,f144,f104]) ).
fof(f104,plain,
( spl2_2
<=> kn1 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f93,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f54]) ).
fof(f54,plain,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
( kn1
<=> ! [X3] : is_a_theorem(implies(X3,and(X3,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).
fof(f142,plain,
spl2_9,
inference(avatar_split_clause,[],[f85,f139]) ).
fof(f85,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_equiv) ).
fof(f137,plain,
spl2_8,
inference(avatar_split_clause,[],[f84,f134]) ).
fof(f84,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(f132,plain,
spl2_7,
inference(avatar_split_clause,[],[f83,f129]) ).
fof(f83,plain,
op_or,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f127,plain,
spl2_6,
inference(avatar_split_clause,[],[f82,f124]) ).
fof(f82,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f122,plain,
spl2_5,
inference(avatar_split_clause,[],[f81,f119]) ).
fof(f81,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f117,plain,
spl2_4,
inference(avatar_split_clause,[],[f80,f114]) ).
fof(f80,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f112,plain,
spl2_3,
inference(avatar_split_clause,[],[f79,f109]) ).
fof(f79,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f107,plain,
spl2_2,
inference(avatar_split_clause,[],[f78,f104]) ).
fof(f78,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f102,plain,
~ spl2_1,
inference(avatar_split_clause,[],[f77,f99]) ).
fof(f77,plain,
~ equivalence_1,
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
~ equivalence_1,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ equivalence_1,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
equivalence_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL512+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Apr 29 23:19:20 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (8963)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.37 % (8968)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.37 TRYING [1]
% 0.20/0.37 TRYING [2]
% 0.20/0.38 TRYING [3]
% 0.20/0.38 % (8967)WARNING: value z3 for option sas not known
% 0.20/0.38 % (8966)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.38 % (8965)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.38 % (8967)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.38 % (8970)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.20/0.38 % (8971)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.20/0.38 % (8972)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.20/0.38 TRYING [1]
% 0.20/0.38 % (8970)First to succeed.
% 0.20/0.38 TRYING [4]
% 0.20/0.38 TRYING [2]
% 0.20/0.38 TRYING [1]
% 0.20/0.38 TRYING [2]
% 0.20/0.38 % (8967)Also succeeded, but the first one will report.
% 0.20/0.38 % (8972)Also succeeded, but the first one will report.
% 0.20/0.38 % (8970)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.39 % (8970)------------------------------
% 0.20/0.39 % (8970)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.39 % (8970)Termination reason: Refutation
% 0.20/0.39
% 0.20/0.39 % (8970)Memory used [KB]: 938
% 0.20/0.39 % (8970)Time elapsed: 0.007 s
% 0.20/0.39 % (8970)Instructions burned: 8 (million)
% 0.20/0.39 % (8970)------------------------------
% 0.20/0.39 % (8970)------------------------------
% 0.20/0.39 % (8963)Success in time 0.025 s
%------------------------------------------------------------------------------