TSTP Solution File: SEU151+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU151+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 : n028.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:27 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 130 ( 83 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 159 ( 62 ~; 53 |; 37 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 78 ( 66 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f129,plain,
$false,
inference(trivial_inequality_removal,[],[f128]) ).
fof(f128,plain,
sK1 != sK1,
inference(superposition,[],[f25,f105]) ).
fof(f105,plain,
sK1 = sK3,
inference(trivial_inequality_removal,[],[f100]) ).
fof(f100,plain,
( sK1 != sK1
| sK1 = sK3 ),
inference(superposition,[],[f26,f91]) ).
fof(f91,plain,
( sK1 = sK4
| sK1 = sK3 ),
inference(resolution,[],[f79,f55]) ).
fof(f55,plain,
! [X0,X1] : in(X1,unordered_pair(X1,X0)),
inference(superposition,[],[f48,f27]) ).
fof(f27,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f48,plain,
! [X0,X1] : in(X0,unordered_pair(X1,X0)),
inference(resolution,[],[f39,f41]) ).
fof(f41,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X0,X1)),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( sP0(X1,X0,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ~ sP0(X1,X0,X2) )
& ( sP0(X1,X0,X2)
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> sP0(X1,X0,X2) ),
inference(definition_folding,[],[f3,f10]) ).
fof(f10,plain,
! [X1,X0,X2] :
( sP0(X1,X0,X2)
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f39,plain,
! [X2,X1,X4] :
( ~ sP0(X4,X1,X2)
| in(X4,X2) ),
inference(equality_resolution,[],[f31]) ).
fof(f31,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ( ( ( sK5(X0,X1,X2) != X0
& sK5(X0,X1,X2) != X1 )
| ~ in(sK5(X0,X1,X2),X2) )
& ( sK5(X0,X1,X2) = X0
| sK5(X0,X1,X2) = X1
| in(sK5(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f16,f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) )
=> ( ( ( sK5(X0,X1,X2) != X0
& sK5(X0,X1,X2) != X1 )
| ~ in(sK5(X0,X1,X2),X2) )
& ( sK5(X0,X1,X2) = X0
| sK5(X0,X1,X2) = X1
| in(sK5(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
! [X1,X0,X2] :
( ( sP0(X1,X0,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) ) )
| ~ sP0(X1,X0,X2) ) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
! [X1,X0,X2] :
( ( sP0(X1,X0,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) ) )
| ~ sP0(X1,X0,X2) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f79,plain,
! [X0] :
( ~ in(X0,unordered_pair(sK1,sK2))
| sK3 = X0
| sK4 = X0 ),
inference(resolution,[],[f29,f45]) ).
fof(f45,plain,
sP0(sK4,sK3,unordered_pair(sK1,sK2)),
inference(superposition,[],[f41,f24]) ).
fof(f24,plain,
unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( sK1 != sK4
& sK1 != sK3
& unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f8,f12]) ).
fof(f12,plain,
( ? [X0,X1,X2,X3] :
( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) )
=> ( sK1 != sK4
& sK1 != sK3
& unordered_pair(sK1,sK2) = unordered_pair(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0,X1,X2,X3] :
( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [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(f29,plain,
! [X2,X0,X1,X4] :
( ~ sP0(X0,X1,X2)
| X1 = X4
| ~ in(X4,X2)
| X0 = X4 ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
sK1 != sK4,
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
sK1 != sK3,
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU151+3 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n028.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 : Sun May 19 17:13:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (13281)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (13284)WARNING: value z3 for option sas not known
% 0.15/0.38 % (13285)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (13282)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (13287)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 % (13284)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 % (13286)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 % (13288)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 % (13283)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 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [4]
% 0.15/0.38 % (13287)First to succeed.
% 0.15/0.38 % (13288)Also succeeded, but the first one will report.
% 0.15/0.38 % (13284)Also succeeded, but the first one will report.
% 0.15/0.38 % (13287)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13281"
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 % (13287)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (13287)------------------------------
% 0.15/0.38 % (13287)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (13287)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (13287)Memory used [KB]: 842
% 0.15/0.38 % (13287)Time elapsed: 0.006 s
% 0.15/0.38 % (13287)Instructions burned: 7 (million)
% 0.15/0.38 % (13281)Success in time 0.018 s
%------------------------------------------------------------------------------