TSTP Solution File: SEU142+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU142+1 : 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 : n027.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:27 EDT 2024
% Result : Theorem 0.63s 0.82s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 171 ( 118 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 211 ( 77 ~; 92 |; 35 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-3 aty)
% Number of variables : 89 ( 80 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f132,plain,
$false,
inference(trivial_inequality_removal,[],[f122]) ).
fof(f122,plain,
singleton(sK0) != singleton(sK0),
inference(superposition,[],[f27,f119]) ).
fof(f119,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(equality_resolution,[],[f110]) ).
fof(f110,plain,
! [X0,X1] :
( X0 != X1
| unordered_pair(X1,X0) = singleton(X0) ),
inference(duplicate_literal_removal,[],[f103]) ).
fof(f103,plain,
! [X0,X1] :
( X0 != X1
| unordered_pair(X1,X0) = singleton(X0)
| unordered_pair(X1,X0) = singleton(X0) ),
inference(superposition,[],[f87,f88]) ).
fof(f88,plain,
! [X0,X1] :
( sK3(X1,unordered_pair(X0,X1)) = X0
| unordered_pair(X0,X1) = singleton(X1) ),
inference(subsumption_resolution,[],[f80,f87]) ).
fof(f80,plain,
! [X0,X1] :
( unordered_pair(X0,X1) = singleton(X1)
| sK3(X1,unordered_pair(X0,X1)) = X0
| sK3(X1,unordered_pair(X0,X1)) = X1 ),
inference(resolution,[],[f76,f46]) ).
fof(f46,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X0 = X4
| X1 = X4 ),
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X2,X0,X1,X4] :
( X1 = X4
| X0 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK2(X0,X1,X2) != X1
& sK2(X0,X1,X2) != X0 )
| ~ in(sK2(X0,X1,X2),X2) )
& ( sK2(X0,X1,X2) = X1
| sK2(X0,X1,X2) = X0
| in(sK2(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,[sK2])],[f20,f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK2(X0,X1,X2) != X1
& sK2(X0,X1,X2) != X0 )
| ~ in(sK2(X0,X1,X2),X2) )
& ( sK2(X0,X1,X2) = X1
| sK2(X0,X1,X2) = X0
| in(sK2(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,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,[],[f19]) ).
fof(f19,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,[],[f18]) ).
fof(f18,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.nav492xXAO/Vampire---4.8_8854',d2_tarski) ).
fof(f76,plain,
! [X0,X1] :
( in(sK3(X0,unordered_pair(X1,X0)),unordered_pair(X1,X0))
| unordered_pair(X1,X0) = singleton(X0) ),
inference(resolution,[],[f74,f43]) ).
fof(f43,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f22]) ).
fof(f74,plain,
! [X0,X1] :
( ~ in(X0,X1)
| singleton(X0) = X1
| in(sK3(X0,X1),X1) ),
inference(trivial_inequality_removal,[],[f73]) ).
fof(f73,plain,
! [X0,X1] :
( ~ in(X0,X1)
| X0 != X0
| singleton(X0) = X1
| in(sK3(X0,X1),X1) ),
inference(duplicate_literal_removal,[],[f72]) ).
fof(f72,plain,
! [X0,X1] :
( ~ in(X0,X1)
| X0 != X0
| singleton(X0) = X1
| singleton(X0) = X1
| in(sK3(X0,X1),X1) ),
inference(superposition,[],[f39,f38]) ).
fof(f38,plain,
! [X0,X1] :
( sK3(X0,X1) = X0
| singleton(X0) = X1
| in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK3(X0,X1) != X0
| ~ in(sK3(X0,X1),X1) )
& ( sK3(X0,X1) = X0
| in(sK3(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f24,f25]) ).
fof(f25,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK3(X0,X1) != X0
| ~ in(sK3(X0,X1),X1) )
& ( sK3(X0,X1) = X0
| in(sK3(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,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,[],[f23]) ).
fof(f23,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.nav492xXAO/Vampire---4.8_8854',d1_tarski) ).
fof(f39,plain,
! [X0,X1] :
( ~ in(sK3(X0,X1),X1)
| sK3(X0,X1) != X0
| singleton(X0) = X1 ),
inference(cnf_transformation,[],[f26]) ).
fof(f87,plain,
! [X0,X1] :
( sK3(X1,unordered_pair(X0,X1)) != X1
| unordered_pair(X0,X1) = singleton(X1) ),
inference(duplicate_literal_removal,[],[f79]) ).
fof(f79,plain,
! [X0,X1] :
( unordered_pair(X0,X1) = singleton(X1)
| sK3(X1,unordered_pair(X0,X1)) != X1
| unordered_pair(X0,X1) = singleton(X1) ),
inference(resolution,[],[f76,f39]) ).
fof(f27,plain,
singleton(sK0) != unordered_pair(sK0,sK0),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
singleton(sK0) != unordered_pair(sK0,sK0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f13]) ).
fof(f13,plain,
( ? [X0] : singleton(X0) != unordered_pair(X0,X0)
=> singleton(sK0) != unordered_pair(sK0,sK0) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0] : singleton(X0) != unordered_pair(X0,X0),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/tmp/tmp.nav492xXAO/Vampire---4.8_8854',t69_enumset1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU142+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % 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.16/0.36 % Computer : n027.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 12:11:06 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.nav492xXAO/Vampire---4.8_8854
% 0.63/0.82 % (9161)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.82 % (9164)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.82 % (9165)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.82 % (9163)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.82 % (9166)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.82 % (9167)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.82 % (9168)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.82 % (9169)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.82 % (9167)Refutation not found, incomplete strategy% (9167)------------------------------
% 0.63/0.82 % (9167)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82 % (9167)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.82
% 0.63/0.82 % (9167)Memory used [KB]: 956
% 0.63/0.82 % (9167)Time elapsed: 0.002 s
% 0.63/0.82 % (9167)Instructions burned: 2 (million)
% 0.63/0.82 % (9166)Refutation not found, incomplete strategy% (9166)------------------------------
% 0.63/0.82 % (9166)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82 % (9166)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.82
% 0.63/0.82 % (9166)Memory used [KB]: 1039
% 0.63/0.82 % (9167)------------------------------
% 0.63/0.82 % (9167)------------------------------
% 0.63/0.82 % (9166)Time elapsed: 0.002 s
% 0.63/0.82 % (9169)Refutation not found, incomplete strategy% (9169)------------------------------
% 0.63/0.82 % (9169)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82 % (9169)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.82
% 0.63/0.82 % (9169)Memory used [KB]: 1039
% 0.63/0.82 % (9169)Time elapsed: 0.002 s
% 0.63/0.82 % (9169)Instructions burned: 3 (million)
% 0.63/0.82 % (9166)Instructions burned: 3 (million)
% 0.63/0.82 % (9165)Refutation not found, incomplete strategy% (9165)------------------------------
% 0.63/0.82 % (9165)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82 % (9169)------------------------------
% 0.63/0.82 % (9169)------------------------------
% 0.63/0.82 % (9166)------------------------------
% 0.63/0.82 % (9166)------------------------------
% 0.63/0.82 % (9165)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.82 % (9168)Refutation not found, incomplete strategy% (9168)------------------------------
% 0.63/0.82 % (9168)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82
% 0.63/0.82 % (9165)Memory used [KB]: 1039
% 0.63/0.82 % (9165)Time elapsed: 0.002 s
% 0.63/0.82 % (9165)Instructions burned: 4 (million)
% 0.63/0.82 % (9168)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.82 % (9161)Refutation not found, incomplete strategy% (9161)------------------------------
% 0.63/0.82 % (9161)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82 % (9161)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.82
% 0.63/0.82 % (9161)Memory used [KB]: 1041
% 0.63/0.82 % (9161)Time elapsed: 0.002 s
% 0.63/0.82 % (9161)Instructions burned: 5 (million)
% 0.63/0.82
% 0.63/0.82 % (9168)Memory used [KB]: 971
% 0.63/0.82 % (9168)Time elapsed: 0.002 s
% 0.63/0.82 % (9168)Instructions burned: 3 (million)
% 0.63/0.82 % (9165)------------------------------
% 0.63/0.82 % (9165)------------------------------
% 0.63/0.82 % (9161)------------------------------
% 0.63/0.82 % (9161)------------------------------
% 0.63/0.82 % (9168)------------------------------
% 0.63/0.82 % (9168)------------------------------
% 0.63/0.82 % (9164)First to succeed.
% 0.63/0.82 % (9164)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9067"
% 0.63/0.82 % (9164)Refutation found. Thanks to Tanya!
% 0.63/0.82 % SZS status Theorem for Vampire---4
% 0.63/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.82 % (9164)------------------------------
% 0.63/0.82 % (9164)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82 % (9164)Termination reason: Refutation
% 0.63/0.82
% 0.63/0.82 % (9164)Memory used [KB]: 1056
% 0.63/0.82 % (9164)Time elapsed: 0.004 s
% 0.63/0.82 % (9164)Instructions burned: 8 (million)
% 0.63/0.82 % (9067)Success in time 0.451 s
% 0.63/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------