TSTP Solution File: SEU127+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU127+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 : n016.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:06 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 123 ( 5 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 144 ( 55 ~; 49 |; 28 &)
% ( 8 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 89 ( 79 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f189,plain,
$false,
inference(unit_resulting_resolution,[],[f112,f107,f71,f60]) ).
fof(f60,plain,
! [X2,X0,X1,X4] :
( ~ sP1(X0,X1,X2)
| ~ in(X4,X2)
| sP0(X1,X4,X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ( ( ~ sP0(X1,sK5(X0,X1,X2),X0)
| ~ in(sK5(X0,X1,X2),X2) )
& ( sP0(X1,sK5(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ sP0(X1,X4,X0) )
& ( sP0(X1,X4,X0)
| ~ in(X4,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f36,f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ sP0(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP0(X1,X3,X0)
| in(X3,X2) ) )
=> ( ( ~ sP0(X1,sK5(X0,X1,X2),X0)
| ~ in(sK5(X0,X1,X2),X2) )
& ( sP0(X1,sK5(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ? [X3] :
( ( ~ sP0(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP0(X1,X3,X0)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ sP0(X1,X4,X0) )
& ( sP0(X1,X4,X0)
| ~ in(X4,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| ? [X3] :
( ( ~ sP0(X1,X3,X0)
| ~ in(X3,X2) )
& ( sP0(X1,X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ sP0(X1,X3,X0) )
& ( sP0(X1,X3,X0)
| ~ in(X3,X2) ) )
| ~ sP1(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( sP1(X0,X1,X2)
<=> ! [X3] :
( in(X3,X2)
<=> sP0(X1,X3,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f71,plain,
! [X0,X1] : sP1(X0,X1,set_intersection2(X0,X1)),
inference(equality_resolution,[],[f67]) ).
fof(f67,plain,
! [X2,X0,X1] :
( sP1(X0,X1,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ~ sP1(X0,X1,X2) )
& ( sP1(X0,X1,X2)
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> sP1(X0,X1,X2) ),
inference(definition_folding,[],[f4,f27,f26]) ).
fof(f26,plain,
! [X1,X3,X0] :
( sP0(X1,X3,X0)
<=> ( in(X3,X1)
& in(X3,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f107,plain,
in(sK4(set_intersection2(sK2,sK3),sK2),set_intersection2(sK2,sK3)),
inference(unit_resulting_resolution,[],[f47,f56]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK4(X0,X1),X1)
& in(sK4(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f32,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK4(X0,X1),X1)
& in(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f47,plain,
~ subset(set_intersection2(sK2,sK3),sK2),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
~ subset(set_intersection2(sK2,sK3),sK2),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f20,f29]) ).
fof(f29,plain,
( ? [X0,X1] : ~ subset(set_intersection2(X0,X1),X0)
=> ~ subset(set_intersection2(sK2,sK3),sK2) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] : ~ subset(set_intersection2(X0,X1),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f112,plain,
! [X0] : ~ sP0(X0,sK4(set_intersection2(sK2,sK3),sK2),sK2),
inference(unit_resulting_resolution,[],[f110,f64]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| in(X1,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ~ in(X1,X0)
| ~ in(X1,X2) )
& ( ( in(X1,X0)
& in(X1,X2) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f40]) ).
fof(f40,plain,
! [X1,X3,X0] :
( ( sP0(X1,X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ sP0(X1,X3,X0) ) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
! [X1,X3,X0] :
( ( sP0(X1,X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ sP0(X1,X3,X0) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f110,plain,
~ in(sK4(set_intersection2(sK2,sK3),sK2),sK2),
inference(unit_resulting_resolution,[],[f47,f57]) ).
fof(f57,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SEU127+1 : TPTP v8.1.2. Released v3.3.0.
% 0.04/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 11:52:00 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % (5021)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32 % (5024)WARNING: value z3 for option sas not known
% 0.15/0.32 % (5023)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.32 % (5024)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.32 % (5028)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.32 % (5026)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.32 % (5027)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.32 % (5022)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.32 % (5025)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.32 TRYING [1]
% 0.15/0.32 TRYING [2]
% 0.15/0.32 % (5028)First to succeed.
% 0.15/0.32 TRYING [3]
% 0.15/0.32 % (5024)Also succeeded, but the first one will report.
% 0.15/0.32 % (5028)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5021"
% 0.15/0.32 % (5028)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.32 % (5028)------------------------------
% 0.15/0.32 % (5028)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.32 % (5028)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (5028)Memory used [KB]: 837
% 0.15/0.32 % (5028)Time elapsed: 0.005 s
% 0.15/0.32 % (5028)Instructions burned: 8 (million)
% 0.15/0.32 % (5021)Success in time 0.017 s
%------------------------------------------------------------------------------