TSTP Solution File: SET788+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET788+1 : TPTP v8.1.2. Released v3.1.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 : n019.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:49:00 EDT 2024
% Result : Theorem 0.64s 0.81s
% Output : Refutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 1 unt; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 214 ( 79 ~; 92 |; 20 &)
% ( 17 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 39 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f85,plain,
$false,
inference(avatar_sat_refutation,[],[f24,f25,f37,f45,f57,f71,f72,f78,f79,f84]) ).
fof(f84,plain,
( ~ spl3_2
| ~ spl3_3
| spl3_4 ),
inference(avatar_contradiction_clause,[],[f83]) ).
fof(f83,plain,
( $false
| ~ spl3_2
| ~ spl3_3
| spl3_4 ),
inference(subsumption_resolution,[],[f82,f31]) ).
fof(f31,plain,
( a_member_of(sK2(sK0,sK1),sK0)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f30,plain,
( spl3_3
<=> a_member_of(sK2(sK0,sK1),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f82,plain,
( ~ a_member_of(sK2(sK0,sK1),sK0)
| ~ spl3_2
| spl3_4 ),
inference(unit_resulting_resolution,[],[f36,f22,f11]) ).
fof(f11,plain,
! [X2,X3,X5] :
( a_member_of(X5,X2)
| ~ a_member_of(X5,X3)
| ~ equalish(X2,X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ( ~ equalish(sK1,sK0)
| ~ equalish(sK0,sK1) )
& ( equalish(sK1,sK0)
| equalish(sK0,sK1) )
& ! [X2,X3] :
( ( equalish(X2,X3)
| ( ( ~ a_member_of(sK2(X2,X3),X3)
| ~ a_member_of(sK2(X2,X3),X2) )
& ( a_member_of(sK2(X2,X3),X3)
| a_member_of(sK2(X2,X3),X2) ) ) )
& ( ! [X5] :
( ( a_member_of(X5,X2)
| ~ a_member_of(X5,X3) )
& ( a_member_of(X5,X3)
| ~ a_member_of(X5,X2) ) )
| ~ equalish(X2,X3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0,X1] :
( ( ~ equalish(X1,X0)
| ~ equalish(X0,X1) )
& ( equalish(X1,X0)
| equalish(X0,X1) ) )
=> ( ( ~ equalish(sK1,sK0)
| ~ equalish(sK0,sK1) )
& ( equalish(sK1,sK0)
| equalish(sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2,X3] :
( ? [X4] :
( ( ~ a_member_of(X4,X3)
| ~ a_member_of(X4,X2) )
& ( a_member_of(X4,X3)
| a_member_of(X4,X2) ) )
=> ( ( ~ a_member_of(sK2(X2,X3),X3)
| ~ a_member_of(sK2(X2,X3),X2) )
& ( a_member_of(sK2(X2,X3),X3)
| a_member_of(sK2(X2,X3),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ? [X0,X1] :
( ( ~ equalish(X1,X0)
| ~ equalish(X0,X1) )
& ( equalish(X1,X0)
| equalish(X0,X1) ) )
& ! [X2,X3] :
( ( equalish(X2,X3)
| ? [X4] :
( ( ~ a_member_of(X4,X3)
| ~ a_member_of(X4,X2) )
& ( a_member_of(X4,X3)
| a_member_of(X4,X2) ) ) )
& ( ! [X5] :
( ( a_member_of(X5,X2)
| ~ a_member_of(X5,X3) )
& ( a_member_of(X5,X3)
| ~ a_member_of(X5,X2) ) )
| ~ equalish(X2,X3) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ? [X3,X4] :
( ( ~ equalish(X4,X3)
| ~ equalish(X3,X4) )
& ( equalish(X4,X3)
| equalish(X3,X4) ) )
& ! [X0,X1] :
( ( equalish(X0,X1)
| ? [X2] :
( ( ~ a_member_of(X2,X1)
| ~ a_member_of(X2,X0) )
& ( a_member_of(X2,X1)
| a_member_of(X2,X0) ) ) )
& ( ! [X2] :
( ( a_member_of(X2,X0)
| ~ a_member_of(X2,X1) )
& ( a_member_of(X2,X1)
| ~ a_member_of(X2,X0) ) )
| ~ equalish(X0,X1) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ? [X3,X4] :
( equalish(X3,X4)
<~> equalish(X4,X3) )
& ! [X0,X1] :
( equalish(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X0,X1] :
( equalish(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
=> ! [X3,X4] :
( equalish(X3,X4)
<=> equalish(X4,X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0,X1] :
( equalish(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
=> ! [X0,X1] :
( equalish(X0,X1)
<=> equalish(X1,X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0,X1] :
( equalish(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X0)
<=> a_member_of(X2,X1) ) )
=> ! [X0,X1] :
( equalish(X0,X1)
<=> equalish(X1,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.xfzqbozj4v/Vampire---4.8_16734',prove_this) ).
fof(f22,plain,
( equalish(sK1,sK0)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl3_2
<=> equalish(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f36,plain,
( ~ a_member_of(sK2(sK0,sK1),sK1)
| spl3_4 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl3_4
<=> a_member_of(sK2(sK0,sK1),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f79,plain,
( spl3_3
| spl3_1
| spl3_4 ),
inference(avatar_split_clause,[],[f62,f34,f17,f30]) ).
fof(f17,plain,
( spl3_1
<=> equalish(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f62,plain,
( equalish(sK0,sK1)
| a_member_of(sK2(sK0,sK1),sK0)
| spl3_4 ),
inference(resolution,[],[f36,f12]) ).
fof(f12,plain,
! [X2,X3] :
( a_member_of(sK2(X2,X3),X3)
| equalish(X2,X3)
| a_member_of(sK2(X2,X3),X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f78,plain,
( ~ spl3_1
| ~ spl3_5
| spl3_6 ),
inference(avatar_contradiction_clause,[],[f77]) ).
fof(f77,plain,
( $false
| ~ spl3_1
| ~ spl3_5
| spl3_6 ),
inference(subsumption_resolution,[],[f74,f56]) ).
fof(f56,plain,
( ~ a_member_of(sK2(sK1,sK0),sK0)
| spl3_6 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f54,plain,
( spl3_6
<=> a_member_of(sK2(sK1,sK0),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f74,plain,
( a_member_of(sK2(sK1,sK0),sK0)
| ~ spl3_1
| ~ spl3_5 ),
inference(unit_resulting_resolution,[],[f18,f51,f11]) ).
fof(f51,plain,
( a_member_of(sK2(sK1,sK0),sK1)
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f50,plain,
( spl3_5
<=> a_member_of(sK2(sK1,sK0),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f18,plain,
( equalish(sK0,sK1)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f72,plain,
( ~ spl3_6
| ~ spl3_1
| spl3_5 ),
inference(avatar_split_clause,[],[f67,f50,f17,f54]) ).
fof(f67,plain,
( ~ a_member_of(sK2(sK1,sK0),sK0)
| ~ spl3_1
| spl3_5 ),
inference(unit_resulting_resolution,[],[f18,f52,f10]) ).
fof(f10,plain,
! [X2,X3,X5] :
( a_member_of(X5,X3)
| ~ a_member_of(X5,X2)
| ~ equalish(X2,X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f52,plain,
( ~ a_member_of(sK2(sK1,sK0),sK1)
| spl3_5 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f71,plain,
( spl3_6
| spl3_2
| spl3_5 ),
inference(avatar_split_clause,[],[f68,f50,f21,f54]) ).
fof(f68,plain,
( a_member_of(sK2(sK1,sK0),sK0)
| spl3_2
| spl3_5 ),
inference(unit_resulting_resolution,[],[f23,f52,f12]) ).
fof(f23,plain,
( ~ equalish(sK1,sK0)
| spl3_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f57,plain,
( ~ spl3_5
| ~ spl3_6
| spl3_2 ),
inference(avatar_split_clause,[],[f48,f21,f54,f50]) ).
fof(f48,plain,
( ~ a_member_of(sK2(sK1,sK0),sK0)
| ~ a_member_of(sK2(sK1,sK0),sK1)
| spl3_2 ),
inference(resolution,[],[f23,f13]) ).
fof(f13,plain,
! [X2,X3] :
( equalish(X2,X3)
| ~ a_member_of(sK2(X2,X3),X3)
| ~ a_member_of(sK2(X2,X3),X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f45,plain,
( ~ spl3_4
| ~ spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f39,f30,f21,f34]) ).
fof(f39,plain,
( ~ a_member_of(sK2(sK0,sK1),sK1)
| ~ spl3_2
| spl3_3 ),
inference(unit_resulting_resolution,[],[f22,f32,f10]) ).
fof(f32,plain,
( ~ a_member_of(sK2(sK0,sK1),sK0)
| spl3_3 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f37,plain,
( ~ spl3_3
| ~ spl3_4
| spl3_1 ),
inference(avatar_split_clause,[],[f28,f17,f34,f30]) ).
fof(f28,plain,
( ~ a_member_of(sK2(sK0,sK1),sK1)
| ~ a_member_of(sK2(sK0,sK1),sK0)
| spl3_1 ),
inference(resolution,[],[f13,f19]) ).
fof(f19,plain,
( ~ equalish(sK0,sK1)
| spl3_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f25,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f14,f21,f17]) ).
fof(f14,plain,
( equalish(sK1,sK0)
| equalish(sK0,sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f24,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f15,f21,f17]) ).
fof(f15,plain,
( ~ equalish(sK1,sK0)
| ~ equalish(sK0,sK1) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SET788+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.12 % 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.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 17:20:44 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_NEQ problem
% 0.11/0.33 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.xfzqbozj4v/Vampire---4.8_16734
% 0.64/0.81 % (16848)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.64/0.81 % (16849)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.64/0.81 % (16845)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.64/0.81 % (16850)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.64/0.81 % (16847)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.64/0.81 % (16846)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.64/0.81 % (16851)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.64/0.81 % (16852)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.64/0.81 % (16848)First to succeed.
% 0.64/0.81 % (16846)Also succeeded, but the first one will report.
% 0.64/0.81 % (16851)Also succeeded, but the first one will report.
% 0.64/0.81 % (16848)Refutation found. Thanks to Tanya!
% 0.64/0.81 % SZS status Theorem for Vampire---4
% 0.64/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.64/0.81 % (16848)------------------------------
% 0.64/0.81 % (16848)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.81 % (16848)Termination reason: Refutation
% 0.64/0.81
% 0.64/0.81 % (16848)Memory used [KB]: 994
% 0.64/0.81 % (16848)Time elapsed: 0.005 s
% 0.64/0.81 % (16848)Instructions burned: 5 (million)
% 0.64/0.81 % (16848)------------------------------
% 0.64/0.81 % (16848)------------------------------
% 0.64/0.81 % (16843)Success in time 0.48 s
% 0.64/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------