TSTP Solution File: LCL509+1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : LCL509+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n020.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 : Mon Jun 24 11:26:39 EDT 2024
% Result : Theorem 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 15
% Syntax : Number of formulae : 94 ( 49 unt; 0 def)
% Number of atoms : 150 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 99 ( 43 ~; 36 |; 2 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 153 ( 149 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2213,plain,
$false,
inference(resolution,[],[f2166,f103]) ).
fof(f103,plain,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(forward_demodulation,[],[f102,f100]) ).
fof(f100,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f99,f98]) ).
fof(f98,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(subsumption_resolution,[],[f89,f84]) ).
fof(f84,plain,
op_implies_and,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f99,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(subsumption_resolution,[],[f90,f83]) ).
fof(f83,plain,
op_or,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f102,plain,
~ is_a_theorem(implies(sK0,or(sK0,sK1))),
inference(subsumption_resolution,[],[f92,f77]) ).
fof(f77,plain,
~ or_1,
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
~ or_1,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ or_1,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
or_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f92,plain,
( or_1
| ~ is_a_theorem(implies(sK0,or(sK0,sK1))) ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
( or_1
| ~ is_a_theorem(implies(sK0,or(sK0,sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f68,f75]) ).
fof(f75,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,or(X0,X1)))
=> ~ is_a_theorem(implies(sK0,or(sK0,sK1))) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
( or_1
| ? [X0,X1] : ~ is_a_theorem(implies(X0,or(X0,X1))) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
=> or_1 ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f2166,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(resolution,[],[f1939,f329]) ).
fof(f329,plain,
! [X0,X1] : is_a_theorem(not(and(not(implies(not(X0),X1)),X0))),
inference(resolution,[],[f327,f154]) ).
fof(f154,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(and(X0,X0),X1))
| is_a_theorem(not(and(not(X1),X0))) ),
inference(superposition,[],[f143,f98]) ).
fof(f143,plain,
! [X0,X1] :
( ~ is_a_theorem(not(and(and(X1,X1),X0)))
| is_a_theorem(not(and(X0,X1))) ),
inference(resolution,[],[f136,f108]) ).
fof(f108,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f96,f82]) ).
fof(f82,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f136,plain,
! [X0,X1] : is_a_theorem(implies(not(and(and(X0,X0),X1)),not(and(X1,X0)))),
inference(resolution,[],[f125,f104]) ).
fof(f104,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(subsumption_resolution,[],[f93,f78]) ).
fof(f78,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(not(and(X0,X1)),not(and(X1,X2)))) ),
inference(resolution,[],[f109,f108]) ).
fof(f109,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))),
inference(subsumption_resolution,[],[f97,f80]) ).
fof(f80,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f327,plain,
! [X2,X0,X1] : is_a_theorem(implies(and(X0,X2),implies(not(X0),X1))),
inference(superposition,[],[f251,f98]) ).
fof(f251,plain,
! [X2,X0,X1] : is_a_theorem(implies(and(X0,X1),not(and(not(X0),X2)))),
inference(resolution,[],[f212,f195]) ).
fof(f195,plain,
! [X2,X0,X1] : is_a_theorem(not(and(and(not(X0),X1),and(X0,X2)))),
inference(resolution,[],[f181,f150]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(not(and(X1,X0)))
| is_a_theorem(not(and(X0,and(X1,X2)))) ),
inference(resolution,[],[f137,f108]) ).
fof(f137,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(and(X0,X1)),not(and(X1,and(X0,X2))))),
inference(resolution,[],[f125,f105]) ).
fof(f105,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(subsumption_resolution,[],[f94,f79]) ).
fof(f79,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f181,plain,
! [X0,X1] : is_a_theorem(not(and(X0,and(not(X0),X1)))),
inference(resolution,[],[f177,f150]) ).
fof(f177,plain,
! [X0] : is_a_theorem(not(and(not(X0),X0))),
inference(resolution,[],[f154,f105]) ).
fof(f212,plain,
! [X0,X1] :
( ~ is_a_theorem(not(and(X1,X0)))
| is_a_theorem(implies(X0,not(X1))) ),
inference(resolution,[],[f191,f108]) ).
fof(f191,plain,
! [X0,X1] : is_a_theorem(implies(not(and(X0,X1)),implies(X1,not(X0)))),
inference(forward_demodulation,[],[f187,f98]) ).
fof(f187,plain,
! [X0,X1] : is_a_theorem(implies(not(and(X0,X1)),not(and(X1,not(not(X0)))))),
inference(resolution,[],[f184,f125]) ).
fof(f184,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(superposition,[],[f177,f98]) ).
fof(f1939,plain,
! [X0,X1] :
( ~ is_a_theorem(not(and(not(X1),X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f1809,f108]) ).
fof(f1809,plain,
! [X0,X1] : is_a_theorem(implies(not(and(not(X0),X1)),implies(X1,X0))),
inference(forward_demodulation,[],[f1804,f98]) ).
fof(f1804,plain,
! [X0,X1] : is_a_theorem(implies(not(and(not(X0),X1)),not(and(X1,not(X0))))),
inference(resolution,[],[f1790,f125]) ).
fof(f1790,plain,
! [X0] : is_a_theorem(implies(not(X0),not(X0))),
inference(resolution,[],[f1694,f235]) ).
fof(f235,plain,
! [X0] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f231,f110]) ).
fof(f110,plain,
! [X0] :
( is_a_theorem(and(X0,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f108,f104]) ).
fof(f231,plain,
! [X0,X1] :
( ~ is_a_theorem(and(implies(not(X0),X0),X1))
| is_a_theorem(X0) ),
inference(resolution,[],[f225,f108]) ).
fof(f225,plain,
! [X0,X1] : is_a_theorem(implies(and(implies(not(X0),X0),X1),X0)),
inference(forward_demodulation,[],[f220,f98]) ).
fof(f220,plain,
! [X0,X1] : is_a_theorem(not(and(and(implies(not(X0),X0),X1),not(X0)))),
inference(superposition,[],[f194,f98]) ).
fof(f194,plain,
! [X0,X1] : is_a_theorem(not(and(and(not(and(X0,X0)),X1),X0))),
inference(resolution,[],[f181,f143]) ).
fof(f1694,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(implies(not(X0),X1)),implies(X1,X2))),
inference(resolution,[],[f1450,f917]) ).
fof(f917,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X2),X0))),
inference(forward_demodulation,[],[f887,f98]) ).
fof(f887,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),not(and(not(X2),not(X0))))),
inference(resolution,[],[f291,f426]) ).
fof(f426,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[],[f404,f98]) ).
fof(f404,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),not(and(X0,X1)))),
inference(resolution,[],[f252,f105]) ).
fof(f252,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(not(X1),not(X0))) ),
inference(superposition,[],[f212,f98]) ).
fof(f291,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(implies(X0,X1),not(and(not(X1),X2)))) ),
inference(resolution,[],[f127,f108]) ).
fof(f127,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X0),implies(implies(X0,X1),not(and(not(X1),X2))))),
inference(superposition,[],[f109,f98]) ).
fof(f1450,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X2),X0))
| is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[],[f917,f108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL509+1 : TPTP v8.2.0. Released v3.3.0.
% 0.10/0.12 % Command : run_vampire %s %d THM
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Jun 22 12:55:54 EDT 2024
% 0.20/0.33 % CPUTime :
% 0.20/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.20/0.35 Running first-order theorem proving
% 0.20/0.35 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.42 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (5154)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=113:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2999ds/113Mi)
% 0.21/0.42 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (5153)lrs+1011_1:1_sil=32000:rnwc=on:nwc=10.0:lwlo=on:i=121:bd=off:av=off_0 on theBenchmark for (2999ds/121Mi)
% 0.21/0.42 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (5152)lrs+1011_1:1_sil=2000:i=103:ep=RS:nm=32:ss=axioms:sos=on_0 on theBenchmark for (2999ds/103Mi)
% 0.21/0.42 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (5151)lrs+11_1:16_to=lpo:drc=off:bsd=on:sp=frequency:i=172350:bs=on:av=off:fsd=on:sil=256000:fdi=50_0 on theBenchmark for (2999ds/172350Mi)
% 0.21/0.42 % (5152)Refutation not found, incomplete strategy% (5152)------------------------------
% 0.21/0.42 % (5152)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.42 % (5154)Refutation not found, incomplete strategy% (5154)------------------------------
% 0.21/0.42 % (5154)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.42 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (5150)lrs+1002_74:59_drc=off:tgt=full:sos=all:cond=fast:i=124987:kws=inv_frequency:afp=300:afq=2.0744697298148953:rawr=on:urr=full:sil=128000:si=on:rtra=on:random_seed=3250543_0 on theBenchmark for (2999ds/124987Mi)
% 0.21/0.42 % (5154)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.42 % (5154)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.42
% 0.21/0.42 % (5154)Memory used [KB]: 1085
% 0.21/0.42 % (5154)Time elapsed: 0.002 s
% 0.21/0.42 % (5154)Instructions burned: 1 (million)
% 0.21/0.42 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (5149)lrs+2_5:39_bsr=unit_only:to=lpo:drc=off:sil=128000:plsq=on:plsqr=2,19:sp=frequency:lcm=reverse:fd=preordered:s2a=on:i=38749:s2at=-1.0:fsr=off:uhcvi=on:rawr=on:aer=off:lwlo=on:add=off:bce=on:acc=model:afr=on_0 on theBenchmark for (2999ds/38749Mi)
% 0.21/0.42 % (5152)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.42 % (5152)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.42
% 0.21/0.42 % (5152)Memory used [KB]: 1084
% 0.21/0.42 % (5152)Time elapsed: 0.002 s
% 0.21/0.42 % (5152)Instructions burned: 1 (million)
% 0.21/0.42 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (5155)lrs+1010_1:1_to=lpo:sil=2000:plsq=on:plsqr=32,1:sp=reverse_arity:sos=on:spb=goal_then_units:i=128:ss=axioms:sgt=50:bd=off:sd=3_0 on theBenchmark for (2999ds/128Mi)
% 0.21/0.42 % (5154)------------------------------
% 0.21/0.42 % (5154)------------------------------
% 0.21/0.42 % (5152)------------------------------
% 0.21/0.42 % (5152)------------------------------
% 0.21/0.42 % (5155)Refutation not found, incomplete strategy% (5155)------------------------------
% 0.21/0.42 % (5155)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.42 % (5155)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.42 % (5155)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.42
% 0.21/0.42 % (5155)Memory used [KB]: 1161
% 0.21/0.42 % (5155)Time elapsed: 0.005 s
% 0.21/0.42 % (5155)Instructions burned: 4 (million)
% 0.21/0.42 % (5155)------------------------------
% 0.21/0.42 % (5155)------------------------------
% 0.21/0.47 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.47 % (5158)ott+1011_1:3_drc=off:sil=4000:tgt=ground:fde=unused:plsq=on:sp=unary_first:fd=preordered:nwc=10.0:i=180:ins=1:rawr=on:bd=preordered_0 on theBenchmark for (2999ds/180Mi)
% 0.21/0.48 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.48 % (5157)lrs+10_1:1_sil=8000:sp=occurrence:sos=on:urr=full:nwc=10.0:st=1.5:i=205:ss=axioms:rnwc=on:sgt=4_0 on theBenchmark for (2999ds/205Mi)
% 0.21/0.48 % (5157)Refutation not found, incomplete strategy% (5157)------------------------------
% 0.21/0.48 % (5157)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.48 % (5157)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.48 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.48 % (5156)lrs+1002_1:1024_drc=encompass:sil=2000:tgt=full:rp=on:i=123:nm=16:ss=axioms:sd=1:st=2.0_0 on theBenchmark for (2999ds/123Mi)
% 0.21/0.48 % (5157)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.48
% 0.21/0.48 % (5157)Memory used [KB]: 1084
% 0.21/0.48 % (5157)Time elapsed: 0.002 s
% 0.21/0.48 % (5157)Instructions burned: 1 (million)
% 0.21/0.48 % (5153)Instruction limit reached!
% 0.21/0.48 % (5153)------------------------------
% 0.21/0.48 % (5153)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.48 % (5153)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.48 % (5153)Termination reason: Time limit
% 0.21/0.48 % (5153)Termination phase: Saturation
% 0.21/0.48
% 0.21/0.48 % (5153)Memory used [KB]: 2665
% 0.21/0.48 % (5153)Time elapsed: 0.063 s
% 0.21/0.48 % (5153)Instructions burned: 122 (million)
% 0.21/0.48 % (5157)------------------------------
% 0.21/0.48 % (5157)------------------------------
% 0.21/0.48 % (5156)Refutation not found, incomplete strategy% (5156)------------------------------
% 0.21/0.48 % (5156)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.48 % (5156)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.48 % (5156)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.48
% 0.21/0.48 % (5156)Memory used [KB]: 1084
% 0.21/0.48 % (5156)Time elapsed: 0.003 s
% 0.21/0.48 % (5156)Instructions burned: 1 (million)
% 0.21/0.48 % (5156)------------------------------
% 0.21/0.48 % (5156)------------------------------
% 0.21/0.51 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.51 % (5159)ott+1002_2835555:1048576_to=lpo:sil=2000:sos=on:fs=off:nwc=10.3801:avsqc=3:updr=off:avsq=on:st=2:s2a=on:i=143:s2at=3:afp=10000:aac=none:avsqr=13357983,1048576:awrs=converge:awrsf=460:bd=off:nm=13:ins=2:fsr=off:amm=sco:afq=1.16719:ss=axioms:rawr=on:fd=off_0 on theBenchmark for (2998ds/143Mi)
% 0.21/0.51 % (5159)Refutation not found, incomplete strategy% (5159)------------------------------
% 0.21/0.51 % (5159)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.51 % (5159)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.51 % (5159)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.51
% 0.21/0.51 % (5159)Memory used [KB]: 1085
% 0.21/0.51 % (5159)Time elapsed: 0.002 s
% 0.21/0.51 % (5159)Instructions burned: 2 (million)
% 0.21/0.51 % (5159)------------------------------
% 0.21/0.51 % (5159)------------------------------
% 0.21/0.51 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.51 % (5160)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=113:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2998ds/113Mi)
% 0.21/0.51 % (5160)Refutation not found, incomplete strategy% (5160)------------------------------
% 0.21/0.51 % (5160)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.51 % (5160)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.51 % (5160)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.51
% 0.21/0.51 % (5160)Memory used [KB]: 1161
% 0.21/0.51 % (5160)Time elapsed: 0.025 s
% 0.21/0.51 % (5160)Instructions burned: 2 (million)
% 0.21/0.51 % (5160)------------------------------
% 0.21/0.51 % (5160)------------------------------
% 0.21/0.52 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.52 % (5161)dis-1011_3:14_sil=32000:rp=on:nwc=7.0:sac=on:mep=off:s2a=on:i=113:ep=R:gsp=on:rawr=on:awrs=converge:awrsf=47:s2agt=30:rnwc=on_0 on theBenchmark for (2998ds/113Mi)
% 0.21/0.52 % (5161)Refutation not found, incomplete strategy% (5161)------------------------------
% 0.21/0.52 % (5161)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.52 % (5161)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.52 % (5161)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.52
% 0.21/0.52 % (5161)Memory used [KB]: 1204
% 0.21/0.52 % (5161)Time elapsed: 0.024 s
% 0.21/0.52 % (5161)Instructions burned: 3 (million)
% 0.21/0.52 % (5161)------------------------------
% 0.21/0.52 % (5161)------------------------------
% 0.21/0.54 % (5158)Instruction limit reached!
% 0.21/0.54 % (5158)------------------------------
% 0.21/0.54 % (5158)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.54 % (5158)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.54 % (5158)Termination reason: Time limit
% 0.21/0.54 % (5158)Termination phase: Saturation
% 0.21/0.54
% 0.21/0.54 % (5158)Memory used [KB]: 3444
% 0.21/0.54 % (5158)Time elapsed: 0.089 s
% 0.21/0.54 % (5158)Instructions burned: 182 (million)
% 0.21/0.54 % (5151)First to succeed.
% 0.21/0.54 % (5151)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5148"
% 0.21/0.55 % (5148)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.55 % (5151)Refutation found. Thanks to Tanya!
% 0.21/0.55 % SZS status Theorem for theBenchmark
% 0.21/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55 % (5151)------------------------------
% 0.21/0.55 % (5151)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.55 % (5151)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.55 % (5151)Termination reason: Refutation
% 0.21/0.55
% 0.21/0.55 % (5151)Memory used [KB]: 3103
% 0.21/0.55 % (5151)Time elapsed: 0.131 s
% 0.21/0.55 % (5151)Instructions burned: 283 (million)
% 0.21/0.55 % (5151)------------------------------
% 0.21/0.55 % (5151)------------------------------
% 0.21/0.55 % (5148)Success in time 0.198 s
%------------------------------------------------------------------------------