TSTP Solution File: SEU151+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU151+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n003.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:27:25 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 115 ( 47 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 137 ( 56 ~; 43 |; 30 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 87 ( 76 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f142,plain,
$false,
inference(unit_resulting_resolution,[],[f37,f88,f38,f28]) ).
fof(f28,plain,
! [X2,X0,X1,X4] :
( ~ sP1(X0,X1,X2)
| ~ sP0(X4,X1,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ( ( ~ sP0(sK6(X0,X1,X2),X1,X0)
| ~ in(sK6(X0,X1,X2),X2) )
& ( sP0(sK6(X0,X1,X2),X1,X0)
| in(sK6(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ sP0(X4,X1,X0) )
& ( sP0(X4,X1,X0)
| ~ in(X4,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f15,f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ sP0(X3,X1,X0)
| ~ in(X3,X2) )
& ( sP0(X3,X1,X0)
| in(X3,X2) ) )
=> ( ( ~ sP0(sK6(X0,X1,X2),X1,X0)
| ~ in(sK6(X0,X1,X2),X2) )
& ( sP0(sK6(X0,X1,X2),X1,X0)
| in(sK6(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ? [X3] :
( ( ~ sP0(X3,X1,X0)
| ~ in(X3,X2) )
& ( sP0(X3,X1,X0)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ sP0(X4,X1,X0) )
& ( sP0(X4,X1,X0)
| ~ in(X4,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ? [X3] :
( ( ~ sP0(X3,X1,X0)
| ~ in(X3,X2) )
& ( sP0(X3,X1,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ sP0(X3,X1,X0) )
& ( sP0(X3,X1,X0)
| ~ in(X3,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1,X2] :
( sP1(X0,X1,X2)
<=> ! [X3] :
( in(X3,X2)
<=> sP0(X3,X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f38,plain,
! [X0,X1] : sP1(X0,X1,unordered_pair(X0,X1)),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X2,X0,X1] :
( sP1(X0,X1,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ~ sP1(X0,X1,X2) )
& ( sP1(X0,X1,X2)
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> sP1(X0,X1,X2) ),
inference(definition_folding,[],[f3,f10,f9]) ).
fof(f9,plain,
! [X3,X1,X0] :
( sP0(X3,X1,X0)
<=> ( 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/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f88,plain,
~ in(sK2,unordered_pair(sK2,sK3)),
inference(unit_resulting_resolution,[],[f61,f42,f27]) ).
fof(f27,plain,
! [X2,X0,X1,X4] :
( ~ sP1(X0,X1,X2)
| ~ in(X4,X2)
| sP0(X4,X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f42,plain,
sP1(sK5,sK4,unordered_pair(sK2,sK3)),
inference(superposition,[],[f40,f22]) ).
fof(f22,plain,
unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( sK2 != sK5
& sK2 != sK4
& unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f7,f12]) ).
fof(f12,plain,
( ? [X0,X1,X2,X3] :
( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) )
=> ( sK2 != sK5
& sK2 != sK4
& unordered_pair(sK2,sK3) = unordered_pair(sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1,X2,X3] :
( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f40,plain,
! [X0,X1] : sP1(X0,X1,unordered_pair(X1,X0)),
inference(superposition,[],[f38,f25]) ).
fof(f25,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/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f61,plain,
~ sP0(sK2,sK4,sK5),
inference(unit_resulting_resolution,[],[f23,f24,f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X3,X1,X0] :
( ( sP0(X3,X1,X0)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ sP0(X3,X1,X0) ) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X3,X1,X0] :
( ( sP0(X3,X1,X0)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ sP0(X3,X1,X0) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f24,plain,
sK2 != sK5,
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
sK2 != sK4,
inference(cnf_transformation,[],[f13]) ).
fof(f37,plain,
! [X2,X1] : sP0(X2,X1,X2),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( sP0(X0,X1,X2)
| X0 != X2 ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU151+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.31 % Computer : n003.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 11:04:35 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.15/0.31 % (5080)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.33 % (5083)WARNING: value z3 for option sas not known
% 0.15/0.33 % (5087)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.33 % (5081)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.33 % (5085)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.33 % (5082)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.33 % (5084)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.33 % (5086)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.33 % (5083)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.33 TRYING [1]
% 0.15/0.33 TRYING [2]
% 0.15/0.33 TRYING [3]
% 0.15/0.33 % (5087)First to succeed.
% 0.15/0.33 TRYING [4]
% 0.15/0.33 % (5086)Also succeeded, but the first one will report.
% 0.15/0.33 TRYING [1]
% 0.15/0.33 TRYING [1]
% 0.15/0.33 % (5087)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5080"
% 0.15/0.33 TRYING [2]
% 0.15/0.33 % (5083)Also succeeded, but the first one will report.
% 0.15/0.33 TRYING [3]
% 0.15/0.33 % (5087)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.33 % (5087)------------------------------
% 0.15/0.33 % (5087)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.33 % (5087)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (5087)Memory used [KB]: 829
% 0.15/0.33 % (5087)Time elapsed: 0.005 s
% 0.15/0.33 % (5087)Instructions burned: 7 (million)
% 0.15/0.33 % (5080)Success in time 0.018 s
%------------------------------------------------------------------------------