TSTP Solution File: SEU119+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU119+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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:19 EDT 2024
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 2 unt; 0 def)
% Number of atoms : 143 ( 10 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 167 ( 77 ~; 63 |; 19 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 55 ( 49 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f171,plain,
$false,
inference(avatar_sat_refutation,[],[f53,f58,f63,f64,f65,f126,f141,f170]) ).
fof(f170,plain,
( ~ spl8_1
| ~ spl8_3
| ~ spl8_4 ),
inference(avatar_contradiction_clause,[],[f169]) ).
fof(f169,plain,
( $false
| ~ spl8_1
| ~ spl8_3
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f168,f45]) ).
fof(f45,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.H1X0ccnlZ5/Vampire---4.8_17470',d1_xboole_0) ).
fof(f168,plain,
( in(sK2,empty_set)
| ~ spl8_1
| ~ spl8_3
| ~ spl8_4 ),
inference(forward_demodulation,[],[f165,f127]) ).
fof(f127,plain,
( empty_set = set_intersection2(sK0,sK1)
| ~ spl8_1 ),
inference(unit_resulting_resolution,[],[f49,f37]) ).
fof(f37,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.H1X0ccnlZ5/Vampire---4.8_17470',d7_xboole_0) ).
fof(f49,plain,
( disjoint(sK0,sK1)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f47,plain,
( spl8_1
<=> disjoint(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f165,plain,
( in(sK2,set_intersection2(sK0,sK1))
| ~ spl8_3
| ~ spl8_4 ),
inference(unit_resulting_resolution,[],[f144,f44]) ).
fof(f44,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ sP4(X3,X1,X0) ),
inference(equality_resolution,[],[f28]) ).
fof(f28,plain,
! [X2,X3,X0,X1] :
( ~ sP4(X3,X1,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f4,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.H1X0ccnlZ5/Vampire---4.8_17470',d3_xboole_0) ).
fof(f144,plain,
( sP4(sK2,sK1,sK0)
| ~ spl8_3
| ~ spl8_4 ),
inference(unit_resulting_resolution,[],[f57,f62,f25]) ).
fof(f25,plain,
! [X3,X0,X1] :
( sP4(X3,X1,X0)
| ~ in(X3,X1)
| ~ in(X3,X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f62,plain,
( in(sK2,sK0)
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f60,plain,
( spl8_4
<=> in(sK2,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
fof(f57,plain,
( in(sK2,sK1)
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f55,plain,
( spl8_3
<=> in(sK2,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
fof(f141,plain,
( ~ spl8_2
| ~ spl8_3
| ~ spl8_4 ),
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f140,plain,
( $false
| ~ spl8_2
| ~ spl8_3
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f136,f62]) ).
fof(f136,plain,
( ~ in(sK2,sK0)
| ~ spl8_2
| ~ spl8_3 ),
inference(resolution,[],[f57,f52]) ).
fof(f52,plain,
( ! [X3] :
( ~ in(X3,sK1)
| ~ in(X3,sK0) )
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f51,plain,
( spl8_2
<=> ! [X3] :
( ~ in(X3,sK0)
| ~ in(X3,sK1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
fof(f126,plain,
( spl8_1
| ~ spl8_2 ),
inference(avatar_contradiction_clause,[],[f125]) ).
fof(f125,plain,
( $false
| spl8_1
| ~ spl8_2 ),
inference(subsumption_resolution,[],[f119,f114]) ).
fof(f114,plain,
( in(sK3(sK0,sK1,empty_set),sK1)
| spl8_1 ),
inference(unit_resulting_resolution,[],[f87,f27]) ).
fof(f27,plain,
! [X3,X0,X1] :
( ~ sP4(X3,X1,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f87,plain,
( sP4(sK3(sK0,sK1,empty_set),sK1,sK0)
| spl8_1 ),
inference(unit_resulting_resolution,[],[f45,f66,f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( sP4(sK3(X0,X1,X2),X1,X0)
| in(sK3(X0,X1,X2),X2)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f66,plain,
( empty_set != set_intersection2(sK0,sK1)
| spl8_1 ),
inference(unit_resulting_resolution,[],[f48,f36]) ).
fof(f36,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f5]) ).
fof(f48,plain,
( ~ disjoint(sK0,sK1)
| spl8_1 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f119,plain,
( ~ in(sK3(sK0,sK1,empty_set),sK1)
| spl8_1
| ~ spl8_2 ),
inference(unit_resulting_resolution,[],[f113,f52]) ).
fof(f113,plain,
( in(sK3(sK0,sK1,empty_set),sK0)
| spl8_1 ),
inference(unit_resulting_resolution,[],[f87,f26]) ).
fof(f26,plain,
! [X3,X0,X1] :
( ~ sP4(X3,X1,X0)
| in(X3,X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f65,plain,
( spl8_4
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f20,f47,f60]) ).
fof(f20,plain,
( ~ disjoint(sK0,sK1)
| in(sK2,sK0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) )
| ( ! [X3] :
( ~ in(X3,X1)
| ~ in(X3,X0) )
& ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) )
& ~ ( ! [X3] :
~ ( in(X3,X1)
& in(X3,X0) )
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) )
& ~ ( ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) )
& ~ disjoint(X0,X1) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) )
& ~ ( ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) )
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.H1X0ccnlZ5/Vampire---4.8_17470',t3_xboole_0) ).
fof(f64,plain,
( spl8_3
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f21,f47,f55]) ).
fof(f21,plain,
( ~ disjoint(sK0,sK1)
| in(sK2,sK1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f63,plain,
( spl8_4
| spl8_2 ),
inference(avatar_split_clause,[],[f22,f51,f60]) ).
fof(f22,plain,
! [X3] :
( ~ in(X3,sK0)
| ~ in(X3,sK1)
| in(sK2,sK0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f58,plain,
( spl8_3
| spl8_2 ),
inference(avatar_split_clause,[],[f23,f51,f55]) ).
fof(f23,plain,
! [X3] :
( ~ in(X3,sK0)
| ~ in(X3,sK1)
| in(sK2,sK1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f53,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f24,f51,f47]) ).
fof(f24,plain,
! [X3] :
( ~ in(X3,sK0)
| ~ in(X3,sK1)
| disjoint(sK0,sK1) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU119+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % 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.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:09:21 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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.H1X0ccnlZ5/Vampire---4.8_17470
% 0.55/0.73 % (17585)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.55/0.73 % (17579)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.55/0.73 % (17580)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 (2996ds/51Mi)
% 0.55/0.73 % (17581)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.73 % (17582)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.55/0.73 % (17584)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.73 % (17586)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 (2996ds/56Mi)
% 0.55/0.73 % (17585)First to succeed.
% 0.55/0.73 % (17584)Refutation not found, incomplete strategy% (17584)------------------------------
% 0.55/0.73 % (17584)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (17584)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73 % (17585)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17577"
% 0.55/0.73
% 0.55/0.73 % (17584)Memory used [KB]: 982
% 0.55/0.73 % (17584)Time elapsed: 0.003 s
% 0.55/0.73 % (17584)Instructions burned: 3 (million)
% 0.55/0.73 % (17586)Refutation not found, incomplete strategy% (17586)------------------------------
% 0.55/0.73 % (17586)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (17586)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (17586)Memory used [KB]: 982
% 0.55/0.73 % (17586)Time elapsed: 0.003 s
% 0.55/0.73 % (17586)Instructions burned: 3 (million)
% 0.55/0.73 % (17584)------------------------------
% 0.55/0.73 % (17584)------------------------------
% 0.55/0.73 % (17586)------------------------------
% 0.55/0.73 % (17586)------------------------------
% 0.55/0.73 % (17585)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Theorem for Vampire---4
% 0.55/0.73 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.73 % (17585)------------------------------
% 0.55/0.73 % (17585)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (17585)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (17585)Memory used [KB]: 1080
% 0.55/0.73 % (17585)Time elapsed: 0.004 s
% 0.55/0.73 % (17585)Instructions burned: 7 (million)
% 0.55/0.73 % (17577)Success in time 0.373 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------