TSTP Solution File: SEU149+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU149+3 : 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 : n012.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:50:16 EDT 2024
% Result : Theorem 0.61s 0.76s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 142 ( 97 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 182 ( 66 ~; 68 |; 39 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 71 ( 58 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f58,plain,
$false,
inference(subsumption_resolution,[],[f53,f23]) ).
fof(f23,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
( sK0 != sK1
& singleton(sK0) = unordered_pair(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f11]) ).
fof(f11,plain,
( ? [X0,X1,X2] :
( X0 != X1
& singleton(X0) = unordered_pair(X1,X2) )
=> ( sK0 != sK1
& singleton(sK0) = unordered_pair(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0,X1,X2] :
( X0 != X1
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.h3Y8kncWMI/Vampire---4.8_31002',t8_zfmisc_1) ).
fof(f53,plain,
sK0 = sK1,
inference(resolution,[],[f44,f39]) ).
fof(f39,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f38]) ).
fof(f38,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f25]) ).
fof(f25,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f15,f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.h3Y8kncWMI/Vampire---4.8_31002',d2_tarski) ).
fof(f44,plain,
! [X0] :
( ~ in(X0,unordered_pair(sK1,sK2))
| sK0 = X0 ),
inference(superposition,[],[f43,f22]) ).
fof(f22,plain,
singleton(sK0) = unordered_pair(sK1,sK2),
inference(cnf_transformation,[],[f12]) ).
fof(f43,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f31]) ).
fof(f31,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK4(X0,X1) != X0
| ~ in(sK4(X0,X1),X1) )
& ( sK4(X0,X1) = X0
| in(sK4(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f19,f20]) ).
fof(f20,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK4(X0,X1) != X0
| ~ in(sK4(X0,X1),X1) )
& ( sK4(X0,X1) = X0
| in(sK4(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.h3Y8kncWMI/Vampire---4.8_31002',d1_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU149+3 : TPTP v8.1.2. Released v3.2.0.
% 0.12/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.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 16:08:41 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.h3Y8kncWMI/Vampire---4.8_31002
% 0.57/0.76 % (31372)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.57/0.76 % (31372)Refutation not found, incomplete strategy% (31372)------------------------------
% 0.57/0.76 % (31372)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (31372)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76
% 0.57/0.76 % (31372)Memory used [KB]: 972
% 0.57/0.76 % (31372)Time elapsed: 0.002 s
% 0.57/0.76 % (31372)Instructions burned: 3 (million)
% 0.57/0.76 % (31372)------------------------------
% 0.57/0.76 % (31372)------------------------------
% 0.57/0.76 % (31365)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.57/0.76 % (31366)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.57/0.76 % (31368)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.57/0.76 % (31370)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.57/0.76 % (31371)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.57/0.76 % (31369)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.57/0.76 % (31367)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.57/0.76 % (31369)Refutation not found, incomplete strategy% (31369)------------------------------
% 0.57/0.76 % (31369)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (31369)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76
% 0.57/0.76 % (31369)Memory used [KB]: 973
% 0.57/0.76 % (31369)Time elapsed: 0.003 s
% 0.57/0.76 % (31369)Instructions burned: 3 (million)
% 0.57/0.76 % (31369)------------------------------
% 0.57/0.76 % (31369)------------------------------
% 0.57/0.76 % (31370)First to succeed.
% 0.57/0.76 % (31365)Refutation not found, incomplete strategy% (31365)------------------------------
% 0.57/0.76 % (31365)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (31365)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76
% 0.57/0.76 % (31365)Memory used [KB]: 1039
% 0.57/0.76 % (31365)Time elapsed: 0.004 s
% 0.57/0.76 % (31365)Instructions burned: 4 (million)
% 0.57/0.76 % (31365)------------------------------
% 0.57/0.76 % (31365)------------------------------
% 0.57/0.76 % (31368)Refutation not found, incomplete strategy% (31368)------------------------------
% 0.57/0.76 % (31368)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (31368)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76
% 0.57/0.76 % (31368)Memory used [KB]: 1039
% 0.57/0.76 % (31368)Time elapsed: 0.004 s
% 0.57/0.76 % (31368)Instructions burned: 4 (million)
% 0.57/0.76 % (31368)------------------------------
% 0.57/0.76 % (31368)------------------------------
% 0.57/0.76 % (31366)Also succeeded, but the first one will report.
% 0.61/0.76 % (31370)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 % (31370)------------------------------
% 0.61/0.76 % (31370)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.76 % (31370)Termination reason: Refutation
% 0.61/0.76
% 0.61/0.76 % (31370)Memory used [KB]: 980
% 0.61/0.76 % (31370)Time elapsed: 0.004 s
% 0.61/0.76 % (31370)Instructions burned: 4 (million)
% 0.61/0.76 % (31370)------------------------------
% 0.61/0.76 % (31370)------------------------------
% 0.61/0.76 % (31180)Success in time 0.397 s
% 0.61/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------