TSTP Solution File: SET914+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET914+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n014.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.63s 0.81s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 47 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 43 ( 20 ~; 13 |; 4 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 47 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f131,plain,
$false,
inference(unit_resulting_resolution,[],[f50,f122,f48]) ).
fof(f48,plain,
! [X3,X0,X1] :
( in(X3,unordered_pair(X0,X1))
| ~ sP4(X3,X1,X0) ),
inference(equality_resolution,[],[f24]) ).
fof(f24,plain,
! [X2,X3,X0,X1] :
( ~ sP4(X3,X1,X0)
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Yb2pQeOBAM/Vampire---4.8_8406',d2_tarski) ).
fof(f122,plain,
~ in(sK0,unordered_pair(sK0,sK1)),
inference(unit_resulting_resolution,[],[f20,f120,f29]) ).
fof(f29,plain,
! [X3,X0,X1] :
( sP6(X3,X1,X0)
| ~ in(X3,X1)
| ~ in(X3,X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Yb2pQeOBAM/Vampire---4.8_8406',d3_xboole_0) ).
fof(f120,plain,
! [X0] : ~ sP6(X0,sK2,unordered_pair(sK0,sK1)),
inference(subsumption_resolution,[],[f118,f53]) ).
fof(f53,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.Yb2pQeOBAM/Vampire---4.8_8406',d1_xboole_0) ).
fof(f118,plain,
! [X0] :
( in(X0,empty_set)
| ~ sP6(X0,sK2,unordered_pair(sK0,sK1)) ),
inference(superposition,[],[f52,f71]) ).
fof(f71,plain,
empty_set = set_intersection2(unordered_pair(sK0,sK1),sK2),
inference(unit_resulting_resolution,[],[f19,f39]) ).
fof(f39,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.Yb2pQeOBAM/Vampire---4.8_8406',d7_xboole_0) ).
fof(f19,plain,
disjoint(unordered_pair(sK0,sK1),sK2),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
? [X0,X1,X2] :
( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1,X2] :
~ ( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Yb2pQeOBAM/Vampire---4.8_8406',t55_zfmisc_1) ).
fof(f52,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ sP6(X3,X1,X0) ),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( ~ sP6(X3,X1,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f20,plain,
in(sK0,sK2),
inference(cnf_transformation,[],[f16]) ).
fof(f50,plain,
! [X3,X1] : sP4(X3,X1,X3),
inference(equality_resolution,[],[f21]) ).
fof(f21,plain,
! [X3,X0,X1] :
( X0 != X3
| sP4(X3,X1,X0) ),
inference(cnf_transformation,[],[f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET914+1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.12 % 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.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri May 3 16:44:53 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.13/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.33 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.Yb2pQeOBAM/Vampire---4.8_8406
% 0.63/0.80 % (8520)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.63/0.80 % (8522)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.63/0.80 % (8523)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.63/0.80 % (8524)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.63/0.80 % (8525)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.63/0.80 % (8521)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.63/0.80 % (8526)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.63/0.80 % (8527)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.63/0.80 % (8527)Refutation not found, incomplete strategy% (8527)------------------------------
% 0.63/0.80 % (8527)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80 % (8527)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80
% 0.63/0.80 % (8524)Refutation not found, incomplete strategy% (8524)------------------------------
% 0.63/0.80 % (8524)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80 % (8524)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80
% 0.63/0.80 % (8524)Memory used [KB]: 1041
% 0.63/0.80 % (8524)Time elapsed: 0.003 s
% 0.63/0.80 % (8524)Instructions burned: 3 (million)
% 0.63/0.80 % (8527)Memory used [KB]: 1038
% 0.63/0.80 % (8527)Time elapsed: 0.003 s
% 0.63/0.80 % (8527)Instructions burned: 3 (million)
% 0.63/0.80 % (8525)Refutation not found, incomplete strategy% (8525)------------------------------
% 0.63/0.80 % (8525)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80 % (8525)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80
% 0.63/0.80 % (8525)Memory used [KB]: 1037
% 0.63/0.80 % (8525)Time elapsed: 0.003 s
% 0.63/0.80 % (8525)Instructions burned: 3 (million)
% 0.63/0.80 % (8524)------------------------------
% 0.63/0.80 % (8524)------------------------------
% 0.63/0.80 % (8527)------------------------------
% 0.63/0.80 % (8527)------------------------------
% 0.63/0.80 % (8525)------------------------------
% 0.63/0.80 % (8525)------------------------------
% 0.63/0.80 % (8523)Refutation not found, incomplete strategy% (8523)------------------------------
% 0.63/0.80 % (8523)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80 % (8523)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80
% 0.63/0.80 % (8523)Memory used [KB]: 1040
% 0.63/0.80 % (8523)Time elapsed: 0.004 s
% 0.63/0.80 % (8523)Instructions burned: 4 (million)
% 0.63/0.80 % (8523)------------------------------
% 0.63/0.80 % (8523)------------------------------
% 0.63/0.81 % (8526)First to succeed.
% 0.63/0.81 % (8526)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-8515"
% 0.63/0.81 % (8526)Refutation found. Thanks to Tanya!
% 0.63/0.81 % SZS status Theorem for Vampire---4
% 0.63/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.81 % (8526)------------------------------
% 0.63/0.81 % (8526)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.81 % (8526)Termination reason: Refutation
% 0.63/0.81
% 0.63/0.81 % (8526)Memory used [KB]: 1052
% 0.63/0.81 % (8526)Time elapsed: 0.005 s
% 0.63/0.81 % (8526)Instructions burned: 6 (million)
% 0.63/0.81 % (8515)Success in time 0.469 s
% 0.63/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------