TSTP Solution File: SET891+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET891+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 : n021.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:08:58 EDT 2024
% Result : Theorem 0.61s 0.76s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 14 unt; 1 typ; 0 def)
% Number of atoms : 115 ( 14 equ)
% Maximal formula atoms : 2 ( 7 avg)
% Number of connectives : 10 ( 8 ~; 0 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 97 ( 97 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 24 ( 19 !; 4 ?; 12 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_2,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f35,plain,
$false,
inference(resolution,[],[f26,f27]) ).
tff(f27,plain,
~ sQ2_eqProxy($i,set_union2(singleton(sK0),singleton(sK1)),union(set_union2(singleton(singleton(sK0)),singleton(singleton(sK1))))),
inference(equality_proxy_replacement,[],[f23,f25]) ).
tff(f25,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ2_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ2_eqProxy])]) ).
tff(f23,plain,
set_union2(singleton(sK0),singleton(sK1)) != union(set_union2(singleton(singleton(sK0)),singleton(singleton(sK1)))),
inference(definition_unfolding,[],[f16,f17,f17]) ).
tff(f17,plain,
! [X0: $i,X1: $i] : ( unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)) ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,axiom,
! [X0,X1] : ( unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.8hdVBrg4DR/Vampire---4.8_25614',t41_enumset1) ).
tff(f16,plain,
unordered_pair(sK0,sK1) != union(unordered_pair(singleton(sK0),singleton(sK1))),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
unordered_pair(sK0,sK1) != union(unordered_pair(singleton(sK0),singleton(sK1))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f13,f14]) ).
tff(f14,plain,
( ? [X0,X1] : ( unordered_pair(X0,X1) != union(unordered_pair(singleton(X0),singleton(X1))) )
=> ( unordered_pair(sK0,sK1) != union(unordered_pair(singleton(sK0),singleton(sK1))) ) ),
introduced(choice_axiom,[]) ).
tff(f13,plain,
? [X0,X1] : ( unordered_pair(X0,X1) != union(unordered_pair(singleton(X0),singleton(X1))) ),
inference(ennf_transformation,[],[f10]) ).
tff(f10,negated_conjecture,
~ ! [X0,X1] : ( unordered_pair(X0,X1) = union(unordered_pair(singleton(X0),singleton(X1))) ),
inference(negated_conjecture,[],[f9]) ).
tff(f9,conjecture,
! [X0,X1] : ( unordered_pair(X0,X1) = union(unordered_pair(singleton(X0),singleton(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.8hdVBrg4DR/Vampire---4.8_25614',t32_zfmisc_1) ).
tff(f26,plain,
! [X0: $i,X1: $i] : sQ2_eqProxy($i,set_union2(X0,X1),union(set_union2(singleton(X0),singleton(X1)))),
inference(equality_proxy_replacement,[],[f22,f25]) ).
tff(f22,plain,
! [X0: $i,X1: $i] : ( set_union2(X0,X1) = union(set_union2(singleton(X0),singleton(X1))) ),
inference(definition_unfolding,[],[f18,f17]) ).
tff(f18,plain,
! [X0: $i,X1: $i] : ( set_union2(X0,X1) = union(unordered_pair(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
tff(f6,axiom,
! [X0,X1] : ( set_union2(X0,X1) = union(unordered_pair(X0,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.8hdVBrg4DR/Vampire---4.8_25614',l52_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET891+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/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.16/0.36 % Computer : n021.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 16:45:08 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.8hdVBrg4DR/Vampire---4.8_25614
% 0.59/0.75 % (25954)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.61/0.75 % (25960)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.61/0.75 % (25954)First to succeed.
% 0.61/0.75 % (25960)Also succeeded, but the first one will report.
% 0.61/0.75 % (25954)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25870"
% 0.61/0.75 % (25958)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.61/0.75 % (25957)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.61/0.76 % (25954)Refutation found. Thanks to Tanya!
% 0.61/0.76 % SZS status Theorem for Vampire---4
% 0.61/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.76 % (25954)------------------------------
% 0.61/0.76 % (25954)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.76 % (25954)Termination reason: Refutation
% 0.61/0.76
% 0.61/0.76 % (25954)Memory used [KB]: 975
% 0.61/0.76 % (25954)Time elapsed: 0.002 s
% 0.61/0.76 % (25954)Instructions burned: 3 (million)
% 0.61/0.76 % (25870)Success in time 0.382 s
% 0.61/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------