TSTP Solution File: SET707+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET707+4 : TPTP v8.1.2. Released v2.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 : 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:08:05 EDT 2024
% Result : Theorem 0.61s 0.76s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 78 ( 10 unt; 0 def)
% Number of atoms : 179 ( 55 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 166 ( 65 ~; 75 |; 7 &)
% ( 12 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 62 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f458,plain,
$false,
inference(avatar_sat_refutation,[],[f43,f109,f120,f147,f322,f334,f344,f457]) ).
fof(f457,plain,
( spl4_1
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f456]) ).
fof(f456,plain,
( $false
| spl4_1
| ~ spl4_5 ),
inference(subsumption_resolution,[],[f455,f32]) ).
fof(f32,plain,
! [X2,X1] : member(X2,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( X0 != X2
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X2
| X0 = X1 ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( X1 = X2
| X0 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.n4oygAUKXR/Vampire---4.8_21523',unordered_pair) ).
fof(f455,plain,
( ~ member(sK1,unordered_pair(sK0,sK1))
| spl4_1
| ~ spl4_5 ),
inference(forward_demodulation,[],[f448,f329]) ).
fof(f329,plain,
( unordered_pair(sK0,sK1) = unordered_pair(sK0,sK3)
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f327]) ).
fof(f327,plain,
( spl4_5
<=> unordered_pair(sK0,sK1) = unordered_pair(sK0,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f448,plain,
( ~ member(sK1,unordered_pair(sK0,sK3))
| spl4_1
| ~ spl4_5 ),
inference(unit_resulting_resolution,[],[f38,f390,f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f390,plain,
( sK0 != sK1
| spl4_1
| ~ spl4_5 ),
inference(superposition,[],[f38,f383]) ).
fof(f383,plain,
( sK0 = sK3
| spl4_1
| ~ spl4_5 ),
inference(unit_resulting_resolution,[],[f38,f381,f24]) ).
fof(f381,plain,
( member(sK3,unordered_pair(sK0,sK1))
| ~ spl4_5 ),
inference(superposition,[],[f32,f329]) ).
fof(f38,plain,
( sK1 != sK3
| spl4_1 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl4_1
<=> sK1 = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f344,plain,
( ~ spl4_6
| ~ spl4_2
| spl4_4 ),
inference(avatar_split_clause,[],[f343,f106,f40,f331]) ).
fof(f331,plain,
( spl4_6
<=> singleton(sK0) = unordered_pair(sK0,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f40,plain,
( spl4_2
<=> sK0 = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f106,plain,
( spl4_4
<=> singleton(sK0) = unordered_pair(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f343,plain,
( singleton(sK0) != unordered_pair(sK0,sK3)
| ~ spl4_2
| spl4_4 ),
inference(forward_demodulation,[],[f107,f41]) ).
fof(f41,plain,
( sK0 = sK2
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f107,plain,
( singleton(sK0) != unordered_pair(sK2,sK3)
| spl4_4 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f334,plain,
( spl4_5
| spl4_6
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f325,f40,f331,f327]) ).
fof(f325,plain,
( singleton(sK0) = unordered_pair(sK0,sK3)
| unordered_pair(sK0,sK1) = unordered_pair(sK0,sK3)
| ~ spl4_2 ),
inference(forward_demodulation,[],[f324,f41]) ).
fof(f324,plain,
( unordered_pair(sK0,sK1) = unordered_pair(sK0,sK3)
| singleton(sK0) = unordered_pair(sK2,sK3)
| ~ spl4_2 ),
inference(forward_demodulation,[],[f275,f41]) ).
fof(f275,plain,
( unordered_pair(sK0,sK1) = unordered_pair(sK2,sK3)
| singleton(sK0) = unordered_pair(sK2,sK3) ),
inference(resolution,[],[f88,f24]) ).
fof(f88,plain,
member(unordered_pair(sK2,sK3),unordered_pair(singleton(sK0),unordered_pair(sK0,sK1))),
inference(unit_resulting_resolution,[],[f32,f64,f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| ~ subset(X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.n4oygAUKXR/Vampire---4.8_21523',subset) ).
fof(f64,plain,
subset(unordered_pair(singleton(sK2),unordered_pair(sK2,sK3)),unordered_pair(singleton(sK0),unordered_pair(sK0,sK1))),
inference(unit_resulting_resolution,[],[f23,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( equal_set(X0,X1)
=> ( subset(X1,X0)
& subset(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.n4oygAUKXR/Vampire---4.8_21523',equal_set) ).
fof(f23,plain,
equal_set(unordered_pair(singleton(sK0),unordered_pair(sK0,sK1)),unordered_pair(singleton(sK2),unordered_pair(sK2,sK3))),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X2),unordered_pair(X2,X3))) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1,X2,X3] :
( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X2),unordered_pair(X2,X3)))
=> ( X1 = X3
& X0 = X2 ) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5,X6] :
( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X5),unordered_pair(X5,X6)))
=> ( X1 = X6
& X0 = X5 ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1,X5,X6] :
( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X5),unordered_pair(X5,X6)))
=> ( X1 = X6
& X0 = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.n4oygAUKXR/Vampire---4.8_21523',thI50) ).
fof(f322,plain,
( spl4_1
| ~ spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f321]) ).
fof(f321,plain,
( $false
| spl4_1
| ~ spl4_2
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f302,f165]) ).
fof(f165,plain,
( ~ member(sK1,singleton(sK0))
| spl4_1
| ~ spl4_4 ),
inference(superposition,[],[f44,f157]) ).
fof(f157,plain,
( sK0 = sK3
| ~ spl4_4 ),
inference(unit_resulting_resolution,[],[f142,f28]) ).
fof(f28,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( member(X0,singleton(X1))
<=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X2,X0] :
( member(X2,singleton(X0))
<=> X0 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.n4oygAUKXR/Vampire---4.8_21523',singleton) ).
fof(f142,plain,
( member(sK3,singleton(sK0))
| ~ spl4_4 ),
inference(superposition,[],[f32,f108]) ).
fof(f108,plain,
( singleton(sK0) = unordered_pair(sK2,sK3)
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f44,plain,
( ~ member(sK1,singleton(sK3))
| spl4_1 ),
inference(unit_resulting_resolution,[],[f38,f28]) ).
fof(f302,plain,
( member(sK1,singleton(sK0))
| ~ spl4_2
| ~ spl4_4 ),
inference(superposition,[],[f32,f263]) ).
fof(f263,plain,
( singleton(sK0) = unordered_pair(sK0,sK1)
| ~ spl4_2
| ~ spl4_4 ),
inference(duplicate_literal_removal,[],[f262]) ).
fof(f262,plain,
( singleton(sK0) = unordered_pair(sK0,sK1)
| singleton(sK0) = unordered_pair(sK0,sK1)
| ~ spl4_2
| ~ spl4_4 ),
inference(forward_demodulation,[],[f261,f41]) ).
fof(f261,plain,
( singleton(sK0) = unordered_pair(sK0,sK1)
| unordered_pair(sK0,sK1) = singleton(sK2)
| ~ spl4_4 ),
inference(forward_demodulation,[],[f256,f108]) ).
fof(f256,plain,
( unordered_pair(sK0,sK1) = unordered_pair(sK2,sK3)
| unordered_pair(sK0,sK1) = singleton(sK2) ),
inference(resolution,[],[f72,f24]) ).
fof(f72,plain,
member(unordered_pair(sK0,sK1),unordered_pair(singleton(sK2),unordered_pair(sK2,sK3))),
inference(unit_resulting_resolution,[],[f32,f63,f31]) ).
fof(f63,plain,
subset(unordered_pair(singleton(sK0),unordered_pair(sK0,sK1)),unordered_pair(singleton(sK2),unordered_pair(sK2,sK3))),
inference(unit_resulting_resolution,[],[f23,f29]) ).
fof(f29,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f147,plain,
( spl4_2
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f144,f106,f40]) ).
fof(f144,plain,
( sK0 = sK2
| ~ spl4_4 ),
inference(resolution,[],[f141,f28]) ).
fof(f141,plain,
( member(sK2,singleton(sK0))
| ~ spl4_4 ),
inference(superposition,[],[f33,f108]) ).
fof(f33,plain,
! [X2,X1] : member(X1,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f25]) ).
fof(f25,plain,
! [X2,X0,X1] :
( X0 != X1
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f120,plain,
( spl4_2
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f117,f102,f40]) ).
fof(f102,plain,
( spl4_3
<=> singleton(sK0) = singleton(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f117,plain,
( sK0 = sK2
| ~ spl4_3 ),
inference(resolution,[],[f114,f28]) ).
fof(f114,plain,
( member(sK2,singleton(sK0))
| ~ spl4_3 ),
inference(superposition,[],[f34,f104]) ).
fof(f104,plain,
( singleton(sK0) = singleton(sK2)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f102]) ).
fof(f34,plain,
! [X1] : member(X1,singleton(X1)),
inference(equality_resolution,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( X0 != X1
| member(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f109,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f99,f106,f102]) ).
fof(f99,plain,
( singleton(sK0) = unordered_pair(sK2,sK3)
| singleton(sK0) = singleton(sK2) ),
inference(resolution,[],[f73,f24]) ).
fof(f73,plain,
member(singleton(sK0),unordered_pair(singleton(sK2),unordered_pair(sK2,sK3))),
inference(unit_resulting_resolution,[],[f33,f63,f31]) ).
fof(f43,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f22,f40,f36]) ).
fof(f22,plain,
( sK0 != sK2
| sK1 != sK3 ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET707+4 : TPTP v8.1.2. Released v2.2.0.
% 0.14/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 : n014.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 17:50:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 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.n4oygAUKXR/Vampire---4.8_21523
% 0.58/0.76 % (21753)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.58/0.76 % (21749)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.58/0.76 % (21747)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.58/0.76 % (21748)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.58/0.76 % (21750)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.58/0.76 % (21751)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.58/0.76 % (21752)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.58/0.76 % (21747)Refutation not found, incomplete strategy% (21747)------------------------------
% 0.58/0.76 % (21747)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (21747)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76
% 0.58/0.76 % (21747)Memory used [KB]: 980
% 0.58/0.76 % (21752)Refutation not found, incomplete strategy% (21752)------------------------------
% 0.58/0.76 % (21752)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (21747)Time elapsed: 0.003 s
% 0.58/0.76 % (21747)Instructions burned: 2 (million)
% 0.58/0.76 % (21752)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76
% 0.58/0.76 % (21752)Memory used [KB]: 968
% 0.58/0.76 % (21752)Time elapsed: 0.003 s
% 0.58/0.76 % (21752)Instructions burned: 2 (million)
% 0.58/0.76 % (21750)Refutation not found, incomplete strategy% (21750)------------------------------
% 0.58/0.76 % (21750)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (21750)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76
% 0.58/0.76 % (21750)Memory used [KB]: 983
% 0.58/0.76 % (21750)Time elapsed: 0.003 s
% 0.58/0.76 % (21747)------------------------------
% 0.58/0.76 % (21747)------------------------------
% 0.58/0.76 % (21750)Instructions burned: 3 (million)
% 0.58/0.76 % (21752)------------------------------
% 0.58/0.76 % (21752)------------------------------
% 0.58/0.76 % (21750)------------------------------
% 0.58/0.76 % (21750)------------------------------
% 0.61/0.76 % (21753)First to succeed.
% 0.61/0.76 % (21753)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21746"
% 0.61/0.76 % (21753)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 % (21753)------------------------------
% 0.61/0.76 % (21753)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.76 % (21753)Termination reason: Refutation
% 0.61/0.76
% 0.61/0.76 % (21753)Memory used [KB]: 1125
% 0.61/0.76 % (21753)Time elapsed: 0.007 s
% 0.61/0.76 % (21753)Instructions burned: 16 (million)
% 0.61/0.76 % (21746)Success in time 0.387 s
% 0.61/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------