TSTP Solution File: SEU083+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU083+1 : TPTP v8.1.2. Released v3.2.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.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:20:11 EDT 2024
% Result : Theorem 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 40 ( 16 ~; 7 |; 13 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 27 ( 27 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 19 ( 12 !; 6 ?; 3 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_19,type,
sQ5_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f123,plain,
$false,
inference(subsumption_resolution,[],[f122,f92]) ).
tff(f92,plain,
finite(sK0),
inference(cnf_transformation,[],[f85]) ).
tff(f85,plain,
( ~ finite(set_union2(sK0,sK1))
& finite(sK1)
& finite(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f72,f84]) ).
tff(f84,plain,
( ? [X0,X1] :
( ~ finite(set_union2(X0,X1))
& finite(X1)
& finite(X0) )
=> ( ~ finite(set_union2(sK0,sK1))
& finite(sK1)
& finite(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f72,plain,
? [X0,X1] :
( ~ finite(set_union2(X0,X1))
& finite(X1)
& finite(X0) ),
inference(flattening,[],[f71]) ).
tff(f71,plain,
? [X0,X1] :
( ~ finite(set_union2(X0,X1))
& finite(X1)
& finite(X0) ),
inference(ennf_transformation,[],[f62]) ).
tff(f62,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& finite(X0) )
=> finite(set_union2(X0,X1)) ),
inference(negated_conjecture,[],[f61]) ).
tff(f61,conjecture,
! [X0,X1] :
( ( finite(X1)
& finite(X0) )
=> finite(set_union2(X0,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.LDalZeYh2C/Vampire---4.8_22167',t14_finset_1) ).
tff(f122,plain,
~ finite(sK0),
inference(subsumption_resolution,[],[f121,f93]) ).
tff(f93,plain,
finite(sK1),
inference(cnf_transformation,[],[f85]) ).
tff(f121,plain,
( ~ finite(sK1)
| ~ finite(sK0) ),
inference(resolution,[],[f95,f94]) ).
tff(f94,plain,
~ finite(set_union2(sK0,sK1)),
inference(cnf_transformation,[],[f85]) ).
tff(f95,plain,
! [X0: $i,X1: $i] :
( finite(set_union2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f74]) ).
tff(f74,plain,
! [X0,X1] :
( finite(set_union2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(flattening,[],[f73]) ).
tff(f73,plain,
! [X0,X1] :
( finite(set_union2(X0,X1))
| ~ finite(X1)
| ~ finite(X0) ),
inference(ennf_transformation,[],[f63]) ).
tff(f63,axiom,
! [X0,X1] :
( ( finite(X1)
& finite(X0) )
=> finite(set_union2(X0,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.LDalZeYh2C/Vampire---4.8_22167',l3_finset_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU083+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n027.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 : Fri May 3 11:38:06 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.LDalZeYh2C/Vampire---4.8_22167
% 0.61/0.82 % (22496)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.82 % (22494)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 (2995ds/51Mi)
% 0.61/0.82 % (22497)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 (2995ds/34Mi)
% 0.61/0.82 % (22493)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 (2995ds/34Mi)
% 0.61/0.82 % (22495)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.82 % (22498)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.82 % (22499)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 (2995ds/83Mi)
% 0.61/0.82 % (22500)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 (2995ds/56Mi)
% 0.61/0.82 % (22498)Also succeeded, but the first one will report.
% 0.61/0.82 % (22496)Also succeeded, but the first one will report.
% 0.61/0.82 % (22493)First to succeed.
% 0.61/0.82 % (22500)Also succeeded, but the first one will report.
% 0.61/0.82 % (22493)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22401"
% 0.61/0.82 % (22497)Also succeeded, but the first one will report.
% 0.61/0.82 % (22499)Also succeeded, but the first one will report.
% 0.61/0.82 % (22493)Refutation found. Thanks to Tanya!
% 0.61/0.82 % SZS status Theorem for Vampire---4
% 0.61/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82 % (22493)------------------------------
% 0.61/0.82 % (22493)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.82 % (22493)Termination reason: Refutation
% 0.61/0.82
% 0.61/0.82 % (22493)Memory used [KB]: 989
% 0.61/0.82 % (22493)Time elapsed: 0.004 s
% 0.61/0.82 % (22493)Instructions burned: 3 (million)
% 0.61/0.82 % (22401)Success in time 0.465 s
% 0.61/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------