TSTP Solution File: SET912+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET912+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 : n029.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:09:01 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 7 unt; 1 typ; 0 def)
% Number of atoms : 142 ( 12 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 62 ( 25 ~; 14 |; 17 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 80 ( 80 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 44 ( 34 !; 9 ?; 16 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_4,type,
sQ3_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f51,plain,
$false,
inference(subsumption_resolution,[],[f50,f21]) ).
tff(f21,plain,
in(sK0,sK1),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( ( unordered_pair(sK0,sK2) != set_intersection2(unordered_pair(sK0,sK2),sK1) )
& in(sK2,sK1)
& in(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f17]) ).
tff(f17,plain,
( ? [X0,X1,X2] :
( ( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1) )
& in(X2,X1)
& in(X0,X1) )
=> ( ( unordered_pair(sK0,sK2) != set_intersection2(unordered_pair(sK0,sK2),sK1) )
& in(sK2,sK1)
& in(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f14,plain,
? [X0,X1,X2] :
( ( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1) )
& in(X2,X1)
& in(X0,X1) ),
inference(flattening,[],[f13]) ).
tff(f13,plain,
? [X0,X1,X2] :
( ( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1) )
& in(X2,X1)
& in(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,negated_conjecture,
~ ! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> ( unordered_pair(X0,X2) = set_intersection2(unordered_pair(X0,X2),X1) ) ),
inference(negated_conjecture,[],[f10]) ).
tff(f10,conjecture,
! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> ( unordered_pair(X0,X2) = set_intersection2(unordered_pair(X0,X2),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.bAwpIJojIY/Vampire---4.8_20325',t53_zfmisc_1) ).
tff(f50,plain,
~ in(sK0,sK1),
inference(subsumption_resolution,[],[f49,f22]) ).
tff(f22,plain,
in(sK2,sK1),
inference(cnf_transformation,[],[f18]) ).
tff(f49,plain,
( ~ in(sK2,sK1)
| ~ in(sK0,sK1) ),
inference(resolution,[],[f30,f46]) ).
tff(f46,plain,
~ subset(unordered_pair(sK0,sK2),sK1),
inference(resolution,[],[f45,f33]) ).
tff(f33,plain,
~ sQ3_eqProxy($i,unordered_pair(sK0,sK2),set_intersection2(unordered_pair(sK0,sK2),sK1)),
inference(equality_proxy_replacement,[],[f23,f32]) ).
tff(f32,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ3_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ3_eqProxy])]) ).
tff(f23,plain,
unordered_pair(sK0,sK2) != set_intersection2(unordered_pair(sK0,sK2),sK1),
inference(cnf_transformation,[],[f18]) ).
tff(f45,plain,
! [X0: $i,X1: $i] :
( sQ3_eqProxy($i,X0,set_intersection2(X0,X1))
| ~ subset(X0,X1) ),
inference(forward_literal_rewriting,[],[f34,f39]) ).
tff(f39,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ3_eqProxy(X0,X2,X1)
| ~ sQ3_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f32]) ).
tff(f34,plain,
! [X0: $i,X1: $i] :
( sQ3_eqProxy($i,set_intersection2(X0,X1),X0)
| ~ subset(X0,X1) ),
inference(equality_proxy_replacement,[],[f24,f32]) ).
tff(f24,plain,
! [X0: $i,X1: $i] :
( ( set_intersection2(X0,X1) = X0 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
! [X0,X1] :
( ( set_intersection2(X0,X1) = X0 )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
=> ( set_intersection2(X0,X1) = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.bAwpIJojIY/Vampire---4.8_20325',t28_xboole_1) ).
tff(f30,plain,
! [X2: $i,X0: $i,X1: $i] :
( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f19]) ).
tff(f19,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f9]) ).
tff(f9,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.bAwpIJojIY/Vampire---4.8_20325',t38_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.11 % 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.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 16:33:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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.bAwpIJojIY/Vampire---4.8_20325
% 0.56/0.75 % (20435)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.75 % (20437)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.75 % (20436)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.75 % (20434)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.75 % (20433)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.75 % (20439)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.75 % (20438)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.75 % (20440)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.75 % (20437)Refutation not found, incomplete strategy% (20437)------------------------------
% 0.56/0.75 % (20437)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (20437)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (20437)Memory used [KB]: 969
% 0.56/0.75 % (20437)Time elapsed: 0.002 s
% 0.56/0.75 % (20437)Instructions burned: 2 (million)
% 0.56/0.76 % (20440)Refutation not found, incomplete strategy% (20440)------------------------------
% 0.56/0.76 % (20440)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76 % (20440)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.76
% 0.56/0.76 % (20440)Memory used [KB]: 967
% 0.56/0.76 % (20440)Time elapsed: 0.002 s
% 0.56/0.76 % (20440)Instructions burned: 2 (million)
% 0.56/0.76 % (20437)------------------------------
% 0.56/0.76 % (20437)------------------------------
% 0.56/0.76 % (20433)First to succeed.
% 0.56/0.76 % (20438)Also succeeded, but the first one will report.
% 0.56/0.76 % (20439)Also succeeded, but the first one will report.
% 0.56/0.76 % (20440)------------------------------
% 0.56/0.76 % (20440)------------------------------
% 0.56/0.76 % (20433)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20432"
% 0.56/0.76 % (20435)Also succeeded, but the first one will report.
% 0.56/0.76 % (20436)Refutation not found, incomplete strategy% (20436)------------------------------
% 0.56/0.76 % (20436)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76 % (20436)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.76
% 0.56/0.76 % (20436)Memory used [KB]: 971
% 0.56/0.76 % (20436)Time elapsed: 0.003 s
% 0.56/0.76 % (20436)Instructions burned: 3 (million)
% 0.56/0.76 % (20436)------------------------------
% 0.56/0.76 % (20436)------------------------------
% 0.56/0.76 % (20433)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for Vampire---4
% 0.56/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.76 % (20433)------------------------------
% 0.56/0.76 % (20433)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76 % (20433)Termination reason: Refutation
% 0.56/0.76
% 0.56/0.76 % (20433)Memory used [KB]: 977
% 0.56/0.76 % (20433)Time elapsed: 0.003 s
% 0.56/0.76 % (20433)Instructions burned: 3 (million)
% 0.56/0.76 % (20432)Success in time 0.435 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------