TSTP Solution File: SEU120+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU120+2 : 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 : n002.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:04 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 5 unt; 0 def)
% Number of atoms : 77 ( 19 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 90 ( 42 ~; 22 |; 21 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 36 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f134,plain,
$false,
inference(resolution,[],[f131,f120]) ).
fof(f120,plain,
~ disjoint(sK1,sK2),
inference(resolution,[],[f115,f71]) ).
fof(f71,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f53]) ).
fof(f53,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0] :
( ( empty_set = X0
| in(sK5(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f31,f32]) ).
fof(f32,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK5(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f115,plain,
( in(sK3,empty_set)
| ~ disjoint(sK1,sK2) ),
inference(backward_demodulation,[],[f45,f114]) ).
fof(f114,plain,
empty_set = set_intersection2(sK1,sK2),
inference(duplicate_literal_removal,[],[f111]) ).
fof(f111,plain,
( empty_set = set_intersection2(sK1,sK2)
| empty_set = set_intersection2(sK1,sK2) ),
inference(resolution,[],[f93,f54]) ).
fof(f54,plain,
! [X0] :
( in(sK5(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f33]) ).
fof(f93,plain,
! [X0] :
( ~ in(X0,set_intersection2(sK1,sK2))
| empty_set = set_intersection2(sK1,sK2) ),
inference(resolution,[],[f59,f48]) ).
fof(f48,plain,
! [X3] :
( disjoint(sK1,sK2)
| ~ in(X3,set_intersection2(sK1,sK2)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ( disjoint(sK1,sK2)
& in(sK3,set_intersection2(sK1,sK2)) )
| ( ! [X3] : ~ in(X3,set_intersection2(sK1,sK2))
& ~ disjoint(sK1,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f19,f26,f25]) ).
fof(f25,plain,
( ? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) )
=> ( ( disjoint(sK1,sK2)
& ? [X2] : in(X2,set_intersection2(sK1,sK2)) )
| ( ! [X3] : ~ in(X3,set_intersection2(sK1,sK2))
& ~ disjoint(sK1,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( ? [X2] : in(X2,set_intersection2(sK1,sK2))
=> in(sK3,set_intersection2(sK1,sK2)) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f59,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f45,plain,
( in(sK3,set_intersection2(sK1,sK2))
| ~ disjoint(sK1,sK2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f131,plain,
disjoint(sK1,sK2),
inference(trivial_inequality_removal,[],[f130]) ).
fof(f130,plain,
( empty_set != empty_set
| disjoint(sK1,sK2) ),
inference(superposition,[],[f60,f114]) ).
fof(f60,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SEU120+2 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n002.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 11:36:42 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (29112)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32 % (29113)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.32 % (29115)WARNING: value z3 for option sas not known
% 0.15/0.32 % (29114)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 % (29116)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.33 % (29118)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 % (29117)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 % (29119)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 % (29115)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 % (29118)First to succeed.
% 0.15/0.33 % (29119)Also succeeded, but the first one will report.
% 0.15/0.33 TRYING [1]
% 0.15/0.33 TRYING [2]
% 0.15/0.33 % (29118)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29112"
% 0.15/0.33 TRYING [1]
% 0.15/0.33 % (29118)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 % (29118)------------------------------
% 0.15/0.33 % (29118)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.33 % (29118)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (29118)Memory used [KB]: 844
% 0.15/0.33 % (29118)Time elapsed: 0.005 s
% 0.15/0.33 % (29118)Instructions burned: 6 (million)
% 0.15/0.33 % (29112)Success in time 0.018 s
%------------------------------------------------------------------------------