TSTP Solution File: SEU152+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU152+2 : 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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 : Wed May 1 03:50:17 EDT 2024
% Result : Theorem 0.56s 0.78s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 9 unt; 1 typ; 0 def)
% Number of atoms : 106 ( 14 equ)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 39 ( 19 ~; 9 |; 5 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 61 ( 61 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 35 ( 30 !; 4 ?; 18 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_6,type,
sQ13_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f501,plain,
$false,
inference(subsumption_resolution,[],[f500,f174]) ).
tff(f174,plain,
in(sK0,sK1),
inference(cnf_transformation,[],[f120]) ).
tff(f120,plain,
( ( sK1 != set_union2(singleton(sK0),sK1) )
& in(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f84,f119]) ).
tff(f119,plain,
( ? [X0,X1] :
( ( set_union2(singleton(X0),X1) != X1 )
& in(X0,X1) )
=> ( ( sK1 != set_union2(singleton(sK0),sK1) )
& in(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f84,plain,
? [X0,X1] :
( ( set_union2(singleton(X0),X1) != X1 )
& in(X0,X1) ),
inference(ennf_transformation,[],[f32]) ).
tff(f32,negated_conjecture,
~ ! [X0,X1] :
( in(X0,X1)
=> ( set_union2(singleton(X0),X1) = X1 ) ),
inference(negated_conjecture,[],[f31]) ).
tff(f31,conjecture,
! [X0,X1] :
( in(X0,X1)
=> ( set_union2(singleton(X0),X1) = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.Wg3imWUnM5/Vampire---4.8_18372',l23_zfmisc_1) ).
tff(f500,plain,
~ in(sK0,sK1),
inference(forward_literal_rewriting,[],[f499,f283]) ).
tff(f283,plain,
! [X0: $i,X1: $i] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f177,f209]) ).
tff(f209,plain,
! [X0: $i] : ( singleton(X0) = unordered_pair(X0,X0) ),
inference(cnf_transformation,[],[f67]) ).
tff(f67,axiom,
! [X0] : ( singleton(X0) = unordered_pair(X0,X0) ),
file('/export/starexec/sandbox/tmp/tmp.Wg3imWUnM5/Vampire---4.8_18372',t69_enumset1) ).
tff(f177,plain,
! [X0: $i,X1: $i] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
tff(f121,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f33]) ).
tff(f33,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Wg3imWUnM5/Vampire---4.8_18372',l2_zfmisc_1) ).
tff(f499,plain,
~ subset(unordered_pair(sK0,sK0),sK1),
inference(resolution,[],[f488,f340]) ).
tff(f340,plain,
~ sQ13_eqProxy($i,sK1,set_union2(unordered_pair(sK0,sK0),sK1)),
inference(equality_proxy_replacement,[],[f282,f338]) ).
tff(f338,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ13_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ13_eqProxy])]) ).
tff(f282,plain,
sK1 != set_union2(unordered_pair(sK0,sK0),sK1),
inference(definition_unfolding,[],[f175,f209]) ).
tff(f175,plain,
sK1 != set_union2(singleton(sK0),sK1),
inference(cnf_transformation,[],[f120]) ).
tff(f488,plain,
! [X0: $i,X1: $i] :
( sQ13_eqProxy($i,X1,set_union2(X0,X1))
| ~ subset(X0,X1) ),
inference(forward_literal_rewriting,[],[f345,f395]) ).
tff(f395,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ13_eqProxy(X0,X2,X1)
| ~ sQ13_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f338]) ).
tff(f345,plain,
! [X0: $i,X1: $i] :
( sQ13_eqProxy($i,set_union2(X0,X1),X1)
| ~ subset(X0,X1) ),
inference(equality_proxy_replacement,[],[f185,f338]) ).
tff(f185,plain,
! [X0: $i,X1: $i] :
( ( set_union2(X0,X1) = X1 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tff(f88,plain,
! [X0,X1] :
( ( set_union2(X0,X1) = X1 )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
tff(f42,axiom,
! [X0,X1] :
( subset(X0,X1)
=> ( set_union2(X0,X1) = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.Wg3imWUnM5/Vampire---4.8_18372',t12_xboole_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU152+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10 % 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.09/0.30 % Computer : n006.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Apr 30 16:06:35 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.30 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.Wg3imWUnM5/Vampire---4.8_18372
% 0.56/0.77 % (18487)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.56/0.77 % (18488)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.56/0.77 % (18485)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.56/0.77 % (18489)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.56/0.77 % (18490)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.56/0.77 % (18486)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.56/0.77 % (18491)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.56/0.77 % (18492)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.56/0.78 % (18485)First to succeed.
% 0.56/0.78 % (18488)Also succeeded, but the first one will report.
% 0.56/0.78 % (18485)Refutation found. Thanks to Tanya!
% 0.56/0.78 % SZS status Theorem for Vampire---4
% 0.56/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.78 % (18485)------------------------------
% 0.56/0.78 % (18485)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.78 % (18485)Termination reason: Refutation
% 0.56/0.78
% 0.56/0.78 % (18485)Memory used [KB]: 1184
% 0.56/0.78 % (18485)Time elapsed: 0.008 s
% 0.56/0.78 % (18485)Instructions burned: 12 (million)
% 0.56/0.78 % (18485)------------------------------
% 0.56/0.78 % (18485)------------------------------
% 0.56/0.78 % (18481)Success in time 0.474 s
% 0.56/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------