TSTP Solution File: SEU156+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU156+3 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n004.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 : Tue May 21 03:53:29 EDT 2024
% Result : Theorem 0.22s 0.46s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 10
% Syntax : Number of formulae : 70 ( 24 unt; 0 def)
% Number of atoms : 146 ( 138 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 120 ( 44 ~; 62 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 100 ( 92 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1887,plain,
$false,
inference(trivial_inequality_removal,[],[f1886]) ).
fof(f1886,plain,
sK0 != sK0,
inference(superposition,[],[f1296,f1877]) ).
fof(f1877,plain,
sK0 = sK3,
inference(equality_resolution,[],[f1840]) ).
fof(f1840,plain,
! [X0] :
( singleton(X0) != singleton(sK0)
| sK0 = sK3 ),
inference(superposition,[],[f34,f1722]) ).
fof(f1722,plain,
singleton(sK0) = unordered_pair(sK0,sK3),
inference(equality_resolution,[],[f1706]) ).
fof(f1706,plain,
! [X0] :
( singleton(X0) != singleton(singleton(sK0))
| unordered_pair(sK0,sK3) = X0 ),
inference(superposition,[],[f58,f1440]) ).
fof(f1440,plain,
singleton(singleton(sK0)) = ordered_pair(sK0,sK3),
inference(forward_demodulation,[],[f1277,f62]) ).
fof(f62,plain,
! [X0] : ordered_pair(X0,X0) = singleton(singleton(X0)),
inference(forward_demodulation,[],[f51,f28]) ).
fof(f28,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f51,plain,
! [X0] : ordered_pair(X0,X0) = unordered_pair(singleton(X0),singleton(X0)),
inference(superposition,[],[f32,f28]) ).
fof(f32,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f1277,plain,
ordered_pair(sK0,sK3) = ordered_pair(sK0,sK0),
inference(backward_demodulation,[],[f558,f1276]) ).
fof(f1276,plain,
sK0 = sK1,
inference(equality_resolution,[],[f1272]) ).
fof(f1272,plain,
! [X0] :
( singleton(X0) != singleton(sK0)
| sK0 = sK1 ),
inference(duplicate_literal_removal,[],[f1258]) ).
fof(f1258,plain,
! [X0] :
( singleton(X0) != singleton(sK0)
| sK0 = sK1
| sK0 = sK1 ),
inference(superposition,[],[f34,f1230]) ).
fof(f1230,plain,
( singleton(sK0) = unordered_pair(sK0,sK1)
| sK0 = sK1 ),
inference(duplicate_literal_removal,[],[f1229]) ).
fof(f1229,plain,
( singleton(sK0) = unordered_pair(sK0,sK1)
| singleton(sK0) = unordered_pair(sK0,sK1)
| sK0 = sK1 ),
inference(forward_demodulation,[],[f1206,f28]) ).
fof(f1206,plain,
( unordered_pair(sK0,sK1) = unordered_pair(sK0,sK0)
| singleton(sK0) = unordered_pair(sK0,sK1)
| sK0 = sK1 ),
inference(superposition,[],[f982,f1193]) ).
fof(f1193,plain,
( sK0 = sK3
| sK0 = sK1 ),
inference(trivial_inequality_removal,[],[f1184]) ).
fof(f1184,plain,
( sK1 != sK1
| sK0 = sK1
| sK0 = sK3 ),
inference(superposition,[],[f666,f1177]) ).
fof(f1177,plain,
( sK1 = sK3
| sK0 = sK1
| sK0 = sK3 ),
inference(equality_resolution,[],[f1127]) ).
fof(f1127,plain,
! [X0] :
( singleton(X0) != singleton(sK0)
| sK0 = sK1
| sK1 = sK3
| sK0 = sK3 ),
inference(superposition,[],[f34,f1116]) ).
fof(f1116,plain,
( singleton(sK0) = unordered_pair(sK0,sK1)
| sK1 = sK3
| sK0 = sK3 ),
inference(equality_resolution,[],[f1006]) ).
fof(f1006,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK0,sK1)
| sK3 = X0
| sK3 = X1
| singleton(sK0) = unordered_pair(sK0,sK1) ),
inference(superposition,[],[f93,f982]) ).
fof(f93,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X1,X0) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(superposition,[],[f36,f31]) ).
fof(f31,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2,X3] :
( X0 = X3
| X0 = X2
| unordered_pair(X0,X1) != unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f666,plain,
sK1 != sK3,
inference(trivial_inequality_removal,[],[f559]) ).
fof(f559,plain,
( sK0 != sK0
| sK1 != sK3 ),
inference(backward_demodulation,[],[f27,f557]) ).
fof(f557,plain,
sK0 = sK2,
inference(duplicate_literal_removal,[],[f554]) ).
fof(f554,plain,
( sK0 = sK2
| sK0 = sK2 ),
inference(resolution,[],[f531,f29]) ).
fof(f29,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f531,plain,
! [X0] :
( ~ subset(singleton(sK0),singleton(X0))
| sK2 = X0
| sK0 = sK2 ),
inference(superposition,[],[f33,f516]) ).
fof(f516,plain,
( singleton(sK2) = singleton(sK0)
| sK0 = sK2 ),
inference(equality_resolution,[],[f378]) ).
fof(f378,plain,
! [X0] :
( singleton(X0) != singleton(sK0)
| sK2 = X0
| singleton(sK2) = singleton(sK0) ),
inference(superposition,[],[f35,f365]) ).
fof(f365,plain,
( unordered_pair(sK2,sK3) = singleton(sK0)
| singleton(sK2) = singleton(sK0) ),
inference(equality_resolution,[],[f341]) ).
fof(f341,plain,
! [X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(sK0,sK1)
| singleton(X0) = unordered_pair(sK2,sK3)
| singleton(X0) = singleton(sK2) ),
inference(superposition,[],[f310,f55]) ).
fof(f55,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,X1)),
inference(superposition,[],[f32,f31]) ).
fof(f310,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != ordered_pair(sK0,sK1)
| unordered_pair(sK2,sK3) = X0
| singleton(sK2) = X0 ),
inference(superposition,[],[f101,f26]) ).
fof(f26,plain,
ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( ( sK1 != sK3
| sK0 != sK2 )
& ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f15,f20]) ).
fof(f20,plain,
( ? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) )
=> ( ( sK1 != sK3
| sK0 != sK2 )
& ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f101,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != unordered_pair(X2,X3)
| unordered_pair(X0,X1) = X2
| singleton(X0) = X2 ),
inference(superposition,[],[f36,f32]) ).
fof(f35,plain,
! [X2,X0,X1] :
( singleton(X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f33,plain,
! [X0,X1] :
( ~ subset(singleton(X0),singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_zfmisc_1) ).
fof(f27,plain,
( sK1 != sK3
| sK0 != sK2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f982,plain,
( unordered_pair(sK0,sK1) = unordered_pair(sK0,sK3)
| singleton(sK0) = unordered_pair(sK0,sK1) ),
inference(equality_resolution,[],[f735]) ).
fof(f735,plain,
! [X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(sK0,sK1)
| unordered_pair(X0,X1) = unordered_pair(sK0,sK3)
| unordered_pair(X0,X1) = singleton(sK0) ),
inference(forward_demodulation,[],[f623,f557]) ).
fof(f623,plain,
! [X0,X1] :
( unordered_pair(X0,X1) = unordered_pair(sK0,sK3)
| ordered_pair(X0,X1) != ordered_pair(sK0,sK1)
| unordered_pair(X0,X1) = singleton(sK2) ),
inference(backward_demodulation,[],[f332,f557]) ).
fof(f332,plain,
! [X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(sK0,sK1)
| unordered_pair(X0,X1) = unordered_pair(sK2,sK3)
| unordered_pair(X0,X1) = singleton(sK2) ),
inference(superposition,[],[f310,f32]) ).
fof(f558,plain,
ordered_pair(sK0,sK1) = ordered_pair(sK0,sK3),
inference(backward_demodulation,[],[f26,f557]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ordered_pair(X0,X1) != singleton(X2)
| unordered_pair(X0,X1) = X2 ),
inference(superposition,[],[f35,f32]) ).
fof(f34,plain,
! [X2,X0,X1] :
( singleton(X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f1296,plain,
sK0 != sK3,
inference(backward_demodulation,[],[f666,f1276]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU156+3 : TPTP v8.2.0. Released v3.2.0.
% 0.14/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n004.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 15:48:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (23895)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (23898)WARNING: value z3 for option sas not known
% 0.15/0.38 % (23897)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (23896)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (23899)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (23898)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (23900)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (23901)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 % (23902)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [4]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [5]
% 0.15/0.40 TRYING [6]
% 0.15/0.40 TRYING [4]
% 0.15/0.43 TRYING [7]
% 0.22/0.43 TRYING [5]
% 0.22/0.46 % (23901)First to succeed.
% 0.22/0.46 % (23901)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23895"
% 0.22/0.46 % (23901)Refutation found. Thanks to Tanya!
% 0.22/0.46 % SZS status Theorem for theBenchmark
% 0.22/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.46 % (23901)------------------------------
% 0.22/0.46 % (23901)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.46 % (23901)Termination reason: Refutation
% 0.22/0.46
% 0.22/0.46 % (23901)Memory used [KB]: 1310
% 0.22/0.46 % (23901)Time elapsed: 0.086 s
% 0.22/0.46 % (23901)Instructions burned: 165 (million)
% 0.22/0.46 % (23895)Success in time 0.102 s
%------------------------------------------------------------------------------