TSTP Solution File: LCL520+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL520+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 : n028.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:38 EDT 2024
% Result : Theorem 0.16s 0.45s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 21
% Syntax : Number of formulae : 114 ( 71 unt; 0 def)
% Number of atoms : 168 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 90 ( 36 ~; 30 |; 2 &)
% ( 9 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 170 ( 166 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9610,plain,
$false,
inference(resolution,[],[f5526,f106]) ).
fof(f106,plain,
~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))),
inference(subsumption_resolution,[],[f94,f77]) ).
fof(f77,plain,
~ r3,
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
~ r3,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ r3,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
fof(f94,plain,
( r3
| ~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))) ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
( r3
| ~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f68,f75]) ).
fof(f75,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(or(X0,X1),or(X1,X0)))
=> ~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
( r3
| ? [X0,X1] : ~ is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
=> r3 ),
inference(unused_predicate_definition_removal,[],[f53]) ).
fof(f53,plain,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
( r3
<=> ! [X3,X4] : is_a_theorem(implies(or(X3,X4),or(X4,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r3) ).
fof(f5526,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,X1))),
inference(forward_demodulation,[],[f5525,f142]) ).
fof(f142,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(superposition,[],[f104,f101]) ).
fof(f101,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(subsumption_resolution,[],[f90,f85]) ).
fof(f85,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(f90,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,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/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f104,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(subsumption_resolution,[],[f92,f86]) ).
fof(f86,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f92,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/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f5525,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),X0),or(X0,X1))),
inference(forward_demodulation,[],[f5502,f147]) ).
fof(f147,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(forward_demodulation,[],[f136,f101]) ).
fof(f136,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = not(and(implies(X0,X1),not(X2))),
inference(superposition,[],[f104,f101]) ).
fof(f5502,plain,
! [X0,X1] : is_a_theorem(or(and(not(X1),not(X0)),or(X0,X1))),
inference(superposition,[],[f2442,f104]) ).
fof(f2442,plain,
! [X0,X1] : is_a_theorem(or(and(X0,X1),not(and(X1,X0)))),
inference(forward_demodulation,[],[f2432,f142]) ).
fof(f2432,plain,
! [X0,X1] : is_a_theorem(implies(not(and(X0,X1)),not(and(X1,X0)))),
inference(unit_resulting_resolution,[],[f111,f2339,f110]) ).
fof(f110,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f98,f82]) ).
fof(f82,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f98,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/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f2339,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(forward_demodulation,[],[f2338,f100]) ).
fof(f100,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(subsumption_resolution,[],[f89,f83]) ).
fof(f83,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(f89,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f63]) ).
fof(f63,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f2338,plain,
! [X0] : is_a_theorem(or(not(X0),X0)),
inference(forward_demodulation,[],[f2318,f142]) ).
fof(f2318,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(unit_resulting_resolution,[],[f1401,f2271,f110]) ).
fof(f2271,plain,
! [X0] : is_a_theorem(equiv(not(X0),not(X0))),
inference(unit_resulting_resolution,[],[f792,f2217,f110]) ).
fof(f2217,plain,
! [X0] : is_a_theorem(or(X0,not(X0))),
inference(forward_demodulation,[],[f2216,f142]) ).
fof(f2216,plain,
! [X0] : is_a_theorem(implies(not(X0),not(X0))),
inference(forward_demodulation,[],[f2215,f100]) ).
fof(f2215,plain,
! [X0] : is_a_theorem(or(not(not(X0)),not(X0))),
inference(forward_demodulation,[],[f2214,f142]) ).
fof(f2214,plain,
! [X0] : is_a_theorem(implies(not(not(not(X0))),not(X0))),
inference(forward_demodulation,[],[f2180,f100]) ).
fof(f2180,plain,
! [X0] : is_a_theorem(or(not(not(not(not(X0)))),not(X0))),
inference(unit_resulting_resolution,[],[f248,f2078,f110]) ).
fof(f2078,plain,
! [X0,X1] : is_a_theorem(implies(implies(and(X0,X0),X1),or(X1,not(X0)))),
inference(forward_demodulation,[],[f2075,f149]) ).
fof(f149,plain,
! [X2,X0,X1] : or(implies(X0,not(X1)),X2) = implies(and(X0,X1),X2),
inference(forward_demodulation,[],[f138,f101]) ).
fof(f138,plain,
! [X2,X0,X1] : or(implies(X0,not(X1)),X2) = not(and(and(X0,X1),not(X2))),
inference(superposition,[],[f104,f103]) ).
fof(f103,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[],[f102,f100]) ).
fof(f102,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(subsumption_resolution,[],[f91,f84]) ).
fof(f84,plain,
op_and,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f91,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_and) ).
fof(f2075,plain,
! [X0,X1] : is_a_theorem(implies(or(implies(X0,not(X0)),X1),or(X1,not(X0)))),
inference(superposition,[],[f2050,f100]) ).
fof(f2050,plain,
! [X0,X1] : is_a_theorem(implies(or(or(X1,X1),X0),or(X0,X1))),
inference(forward_demodulation,[],[f2049,f142]) ).
fof(f2049,plain,
! [X0,X1] : is_a_theorem(implies(or(implies(not(X1),X1),X0),or(X0,X1))),
inference(forward_demodulation,[],[f2048,f125]) ).
fof(f125,plain,
! [X2,X0,X1] : implies(and(X0,not(X1)),X2) = or(implies(X0,X1),X2),
inference(superposition,[],[f100,f101]) ).
fof(f2048,plain,
! [X0,X1] : is_a_theorem(implies(implies(and(not(X1),not(X1)),X0),or(X0,X1))),
inference(forward_demodulation,[],[f2035,f147]) ).
fof(f2035,plain,
! [X0,X1] : is_a_theorem(or(and(and(not(X1),not(X1)),not(X0)),or(X0,X1))),
inference(superposition,[],[f1345,f104]) ).
fof(f1345,plain,
! [X0,X1] : is_a_theorem(or(and(and(X0,X0),X1),not(and(X1,X0)))),
inference(forward_demodulation,[],[f1252,f142]) ).
fof(f1252,plain,
! [X0,X1] : is_a_theorem(implies(not(and(and(X0,X0),X1)),not(and(X1,X0)))),
inference(unit_resulting_resolution,[],[f107,f111,f110]) ).
fof(f107,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(subsumption_resolution,[],[f95,f78]) ).
fof(f78,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f95,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,[],[f60]) ).
fof(f60,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/sandbox2/benchmark/theBenchmark.p',kn1) ).
fof(f248,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),not(not(not(not(X0)))))),
inference(superposition,[],[f224,f212]) ).
fof(f212,plain,
! [X0,X1] : and(X0,X1) = and(not(not(X0)),X1),
inference(forward_demodulation,[],[f204,f103]) ).
fof(f204,plain,
! [X0,X1] : not(implies(X0,not(X1))) = and(not(not(X0)),X1),
inference(superposition,[],[f155,f100]) ).
fof(f155,plain,
! [X0,X1] : and(not(X0),X1) = not(or(X0,not(X1))),
inference(superposition,[],[f103,f142]) ).
fof(f224,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),not(not(X0)))),
inference(superposition,[],[f108,f212]) ).
fof(f108,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(subsumption_resolution,[],[f96,f79]) ).
fof(f79,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f96,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,[],[f59]) ).
fof(f59,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/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f792,plain,
! [X0] : is_a_theorem(implies(or(X0,not(X0)),equiv(not(X0),not(X0)))),
inference(superposition,[],[f721,f142]) ).
fof(f721,plain,
! [X0] : is_a_theorem(implies(implies(X0,X0),equiv(X0,X0))),
inference(superposition,[],[f107,f105]) ).
fof(f105,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(subsumption_resolution,[],[f93,f87]) ).
fof(f87,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_equiv) ).
fof(f93,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/sandbox2/benchmark/theBenchmark.p',op_equiv) ).
fof(f1401,plain,
! [X0,X1] : is_a_theorem(implies(equiv(X0,not(not(X1))),implies(X0,X1))),
inference(superposition,[],[f1144,f101]) ).
fof(f1144,plain,
! [X0,X1] : is_a_theorem(implies(equiv(X0,not(X1)),not(and(X0,X1)))),
inference(superposition,[],[f725,f103]) ).
fof(f725,plain,
! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),not(not(implies(X0,X1))))),
inference(superposition,[],[f224,f105]) ).
fof(f111,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))),
inference(subsumption_resolution,[],[f99,f80]) ).
fof(f80,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(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,[],[f58]) ).
fof(f58,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/sandbox2/benchmark/theBenchmark.p',kn3) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL520+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32 % Computer : n028.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 : Mon Apr 29 23:23:44 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 % (32702)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34 % (32706)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.11/0.34 % (32707)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.11/0.34 % (32708)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.11/0.34 % (32709)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.11/0.34 % (32705)WARNING: value z3 for option sas not known
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 % (32703)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.11/0.34 % (32704)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.11/0.34 % (32705)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.11/0.34 TRYING [3]
% 0.16/0.34 TRYING [1]
% 0.16/0.34 TRYING [2]
% 0.16/0.35 TRYING [4]
% 0.16/0.35 TRYING [3]
% 0.16/0.38 TRYING [4]
% 0.16/0.42 TRYING [5]
% 0.16/0.45 % (32709)First to succeed.
% 0.16/0.45 % (32709)Refutation found. Thanks to Tanya!
% 0.16/0.45 % SZS status Theorem for theBenchmark
% 0.16/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.45 % (32709)------------------------------
% 0.16/0.45 % (32709)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.16/0.45 % (32709)Termination reason: Refutation
% 0.16/0.45
% 0.16/0.45 % (32709)Memory used [KB]: 2352
% 0.16/0.45 % (32709)Time elapsed: 0.111 s
% 0.16/0.45 % (32709)Instructions burned: 238 (million)
% 0.16/0.45 % (32709)------------------------------
% 0.16/0.45 % (32709)------------------------------
% 0.16/0.45 % (32702)Success in time 0.126 s
%------------------------------------------------------------------------------