TSTP Solution File: SEU387+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU387+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 : Sun May 5 09:23:01 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 20 unt; 0 def)
% Number of atoms : 261 ( 5 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 333 ( 124 ~; 101 |; 95 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 20 ( 18 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 49 ( 34 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f279,plain,
$false,
inference(subsumption_resolution,[],[f278,f167]) ).
fof(f167,plain,
empty(sK2),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( empty(sK2)
& in(sK2,sK1)
& element(sK1,powerset(the_carrier(boole_POSet(sK0))))
& proper_element(sK1,powerset(the_carrier(boole_POSet(sK0))))
& upper_relstr_subset(sK1,boole_POSet(sK0))
& filtered_subset(sK1,boole_POSet(sK0))
& ~ empty(sK1)
& ~ empty(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f98,f133,f132,f131]) ).
fof(f131,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( empty(X2)
& in(X2,X1) )
& element(X1,powerset(the_carrier(boole_POSet(X0))))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& upper_relstr_subset(X1,boole_POSet(X0))
& filtered_subset(X1,boole_POSet(X0))
& ~ empty(X1) )
& ~ empty(X0) )
=> ( ? [X1] :
( ? [X2] :
( empty(X2)
& in(X2,X1) )
& element(X1,powerset(the_carrier(boole_POSet(sK0))))
& proper_element(X1,powerset(the_carrier(boole_POSet(sK0))))
& upper_relstr_subset(X1,boole_POSet(sK0))
& filtered_subset(X1,boole_POSet(sK0))
& ~ empty(X1) )
& ~ empty(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X1] :
( ? [X2] :
( empty(X2)
& in(X2,X1) )
& element(X1,powerset(the_carrier(boole_POSet(sK0))))
& proper_element(X1,powerset(the_carrier(boole_POSet(sK0))))
& upper_relstr_subset(X1,boole_POSet(sK0))
& filtered_subset(X1,boole_POSet(sK0))
& ~ empty(X1) )
=> ( ? [X2] :
( empty(X2)
& in(X2,sK1) )
& element(sK1,powerset(the_carrier(boole_POSet(sK0))))
& proper_element(sK1,powerset(the_carrier(boole_POSet(sK0))))
& upper_relstr_subset(sK1,boole_POSet(sK0))
& filtered_subset(sK1,boole_POSet(sK0))
& ~ empty(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X2] :
( empty(X2)
& in(X2,sK1) )
=> ( empty(sK2)
& in(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( empty(X2)
& in(X2,X1) )
& element(X1,powerset(the_carrier(boole_POSet(X0))))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& upper_relstr_subset(X1,boole_POSet(X0))
& filtered_subset(X1,boole_POSet(X0))
& ~ empty(X1) )
& ~ empty(X0) ),
inference(flattening,[],[f97]) ).
fof(f97,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( empty(X2)
& in(X2,X1) )
& element(X1,powerset(the_carrier(boole_POSet(X0))))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& upper_relstr_subset(X1,boole_POSet(X0))
& filtered_subset(X1,boole_POSet(X0))
& ~ empty(X1) )
& ~ empty(X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,negated_conjecture,
~ ! [X0] :
( ~ empty(X0)
=> ! [X1] :
( ( element(X1,powerset(the_carrier(boole_POSet(X0))))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& upper_relstr_subset(X1,boole_POSet(X0))
& filtered_subset(X1,boole_POSet(X0))
& ~ empty(X1) )
=> ! [X2] :
~ ( empty(X2)
& in(X2,X1) ) ) ),
inference(negated_conjecture,[],[f78]) ).
fof(f78,conjecture,
! [X0] :
( ~ empty(X0)
=> ! [X1] :
( ( element(X1,powerset(the_carrier(boole_POSet(X0))))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& upper_relstr_subset(X1,boole_POSet(X0))
& filtered_subset(X1,boole_POSet(X0))
& ~ empty(X1) )
=> ! [X2] :
~ ( empty(X2)
& in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.q8eqTtzC2I/Vampire---4.8_12119',t2_yellow19) ).
fof(f278,plain,
~ empty(sK2),
inference(resolution,[],[f277,f166]) ).
fof(f166,plain,
in(sK2,sK1),
inference(cnf_transformation,[],[f134]) ).
fof(f277,plain,
! [X0] :
( ~ in(X0,sK1)
| ~ empty(X0) ),
inference(superposition,[],[f276,f259]) ).
fof(f259,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( empty(X0)
=> empty_set = X0 ),
file('/export/starexec/sandbox2/tmp/tmp.q8eqTtzC2I/Vampire---4.8_12119',t6_boole) ).
fof(f276,plain,
~ in(empty_set,sK1),
inference(forward_demodulation,[],[f275,f242]) ).
fof(f242,plain,
! [X0] : empty_set = bottom_of_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f75]) ).
fof(f75,axiom,
! [X0] : empty_set = bottom_of_relstr(boole_POSet(X0)),
file('/export/starexec/sandbox2/tmp/tmp.q8eqTtzC2I/Vampire---4.8_12119',t18_yellow_1) ).
fof(f275,plain,
~ in(bottom_of_relstr(boole_POSet(sK0)),sK1),
inference(subsumption_resolution,[],[f274,f189]) ).
fof(f189,plain,
! [X0] : ~ empty_carrier(boole_POSet(X0)),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
! [X0] :
( antisymmetric_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& ~ empty_carrier(boole_POSet(X0)) ),
inference(pure_predicate_removal,[],[f47]) ).
fof(f47,axiom,
! [X0] :
( antisymmetric_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0))
& ~ empty_carrier(boole_POSet(X0)) ),
file('/export/starexec/sandbox2/tmp/tmp.q8eqTtzC2I/Vampire---4.8_12119',fc7_yellow_1) ).
fof(f274,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f273,f190]) ).
fof(f190,plain,
! [X0] : reflexive_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f93]) ).
fof(f273,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f272,f191]) ).
fof(f191,plain,
! [X0] : transitive_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f93]) ).
fof(f272,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| ~ transitive_relstr(boole_POSet(sK0))
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f271,f192]) ).
fof(f192,plain,
! [X0] : antisymmetric_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f93]) ).
fof(f271,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| ~ antisymmetric_relstr(boole_POSet(sK0))
| ~ transitive_relstr(boole_POSet(sK0))
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f270,f183]) ).
fof(f183,plain,
! [X0] : lower_bounded_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0] :
( complete_relstr(boole_POSet(X0))
& with_infima_relstr(boole_POSet(X0))
& with_suprema_relstr(boole_POSet(X0))
& bounded_relstr(boole_POSet(X0))
& upper_bounded_relstr(boole_POSet(X0))
& lower_bounded_relstr(boole_POSet(X0))
& antisymmetric_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& ~ empty_carrier(boole_POSet(X0)) ),
inference(pure_predicate_removal,[],[f48]) ).
fof(f48,axiom,
! [X0] :
( complete_relstr(boole_POSet(X0))
& with_infima_relstr(boole_POSet(X0))
& with_suprema_relstr(boole_POSet(X0))
& bounded_relstr(boole_POSet(X0))
& upper_bounded_relstr(boole_POSet(X0))
& lower_bounded_relstr(boole_POSet(X0))
& antisymmetric_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0))
& ~ empty_carrier(boole_POSet(X0)) ),
file('/export/starexec/sandbox2/tmp/tmp.q8eqTtzC2I/Vampire---4.8_12119',fc8_yellow_1) ).
fof(f270,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| ~ lower_bounded_relstr(boole_POSet(sK0))
| ~ antisymmetric_relstr(boole_POSet(sK0))
| ~ transitive_relstr(boole_POSet(sK0))
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f269,f193]) ).
fof(f193,plain,
! [X0] : rel_str(boole_POSet(X0)),
inference(cnf_transformation,[],[f94]) ).
fof(f94,plain,
! [X0] : rel_str(boole_POSet(X0)),
inference(pure_predicate_removal,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( rel_str(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0)) ),
file('/export/starexec/sandbox2/tmp/tmp.q8eqTtzC2I/Vampire---4.8_12119',dt_k3_yellow_1) ).
fof(f269,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| ~ rel_str(boole_POSet(sK0))
| ~ lower_bounded_relstr(boole_POSet(sK0))
| ~ antisymmetric_relstr(boole_POSet(sK0))
| ~ transitive_relstr(boole_POSet(sK0))
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f268,f161]) ).
fof(f161,plain,
~ empty(sK1),
inference(cnf_transformation,[],[f134]) ).
fof(f268,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| empty(sK1)
| ~ rel_str(boole_POSet(sK0))
| ~ lower_bounded_relstr(boole_POSet(sK0))
| ~ antisymmetric_relstr(boole_POSet(sK0))
| ~ transitive_relstr(boole_POSet(sK0))
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f267,f162]) ).
fof(f162,plain,
filtered_subset(sK1,boole_POSet(sK0)),
inference(cnf_transformation,[],[f134]) ).
fof(f267,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| ~ filtered_subset(sK1,boole_POSet(sK0))
| empty(sK1)
| ~ rel_str(boole_POSet(sK0))
| ~ lower_bounded_relstr(boole_POSet(sK0))
| ~ antisymmetric_relstr(boole_POSet(sK0))
| ~ transitive_relstr(boole_POSet(sK0))
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f266,f163]) ).
fof(f163,plain,
upper_relstr_subset(sK1,boole_POSet(sK0)),
inference(cnf_transformation,[],[f134]) ).
fof(f266,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| ~ upper_relstr_subset(sK1,boole_POSet(sK0))
| ~ filtered_subset(sK1,boole_POSet(sK0))
| empty(sK1)
| ~ rel_str(boole_POSet(sK0))
| ~ lower_bounded_relstr(boole_POSet(sK0))
| ~ antisymmetric_relstr(boole_POSet(sK0))
| ~ transitive_relstr(boole_POSet(sK0))
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(subsumption_resolution,[],[f265,f165]) ).
fof(f165,plain,
element(sK1,powerset(the_carrier(boole_POSet(sK0)))),
inference(cnf_transformation,[],[f134]) ).
fof(f265,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK0)),sK1)
| ~ element(sK1,powerset(the_carrier(boole_POSet(sK0))))
| ~ upper_relstr_subset(sK1,boole_POSet(sK0))
| ~ filtered_subset(sK1,boole_POSet(sK0))
| empty(sK1)
| ~ rel_str(boole_POSet(sK0))
| ~ lower_bounded_relstr(boole_POSet(sK0))
| ~ antisymmetric_relstr(boole_POSet(sK0))
| ~ transitive_relstr(boole_POSet(sK0))
| ~ reflexive_relstr(boole_POSet(sK0))
| empty_carrier(boole_POSet(sK0)) ),
inference(resolution,[],[f164,f199]) ).
fof(f199,plain,
! [X0,X1] :
( ~ proper_element(X1,powerset(the_carrier(X0)))
| ~ in(bottom_of_relstr(X0),X1)
| ~ element(X1,powerset(the_carrier(X0)))
| ~ upper_relstr_subset(X1,X0)
| ~ filtered_subset(X1,X0)
| empty(X1)
| ~ rel_str(X0)
| ~ lower_bounded_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ transitive_relstr(X0)
| ~ reflexive_relstr(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0] :
( ! [X1] :
( ( ( proper_element(X1,powerset(the_carrier(X0)))
| in(bottom_of_relstr(X0),X1) )
& ( ~ in(bottom_of_relstr(X0),X1)
| ~ proper_element(X1,powerset(the_carrier(X0))) ) )
| ~ element(X1,powerset(the_carrier(X0)))
| ~ upper_relstr_subset(X1,X0)
| ~ filtered_subset(X1,X0)
| empty(X1) )
| ~ rel_str(X0)
| ~ lower_bounded_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ transitive_relstr(X0)
| ~ reflexive_relstr(X0)
| empty_carrier(X0) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) )
| ~ element(X1,powerset(the_carrier(X0)))
| ~ upper_relstr_subset(X1,X0)
| ~ filtered_subset(X1,X0)
| empty(X1) )
| ~ rel_str(X0)
| ~ lower_bounded_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ transitive_relstr(X0)
| ~ reflexive_relstr(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) )
| ~ element(X1,powerset(the_carrier(X0)))
| ~ upper_relstr_subset(X1,X0)
| ~ filtered_subset(X1,X0)
| empty(X1) )
| ~ rel_str(X0)
| ~ lower_bounded_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ transitive_relstr(X0)
| ~ reflexive_relstr(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f86]) ).
fof(f86,axiom,
! [X0] :
( ( rel_str(X0)
& lower_bounded_relstr(X0)
& antisymmetric_relstr(X0)
& transitive_relstr(X0)
& reflexive_relstr(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( element(X1,powerset(the_carrier(X0)))
& upper_relstr_subset(X1,X0)
& filtered_subset(X1,X0)
& ~ empty(X1) )
=> ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.q8eqTtzC2I/Vampire---4.8_12119',t8_waybel_7) ).
fof(f164,plain,
proper_element(sK1,powerset(the_carrier(boole_POSet(sK0)))),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU387+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n013.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 11:07:19 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.q8eqTtzC2I/Vampire---4.8_12119
% 0.60/0.75 % (12318)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.60/0.75 % (12319)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.60/0.75 % (12317)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.60/0.75 % (12322)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.60/0.75 % (12320)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.60/0.75 % (12321)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.60/0.75 % (12323)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.60/0.76 % (12324)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.60/0.76 % (12322)First to succeed.
% 0.60/0.76 % (12324)Refutation not found, incomplete strategy% (12324)------------------------------
% 0.60/0.76 % (12324)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (12324)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (12324)Memory used [KB]: 1143
% 0.60/0.76 % (12324)Time elapsed: 0.005 s
% 0.60/0.76 % (12324)Instructions burned: 5 (million)
% 0.60/0.76 % (12324)------------------------------
% 0.60/0.76 % (12324)------------------------------
% 0.60/0.76 % (12322)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12296"
% 0.60/0.76 % (12321)Refutation not found, incomplete strategy% (12321)------------------------------
% 0.60/0.76 % (12321)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (12322)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (12322)------------------------------
% 0.60/0.76 % (12322)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (12322)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (12322)Memory used [KB]: 1154
% 0.60/0.76 % (12322)Time elapsed: 0.010 s
% 0.60/0.76 % (12322)Instructions burned: 7 (million)
% 0.60/0.76 % (12296)Success in time 0.391 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------