TSTP Solution File: SEU120+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU120+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 : n029.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 Apr 30 15:22:16 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 89 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 45 ~; 27 |; 22 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 46 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f76,plain,
$false,
inference(subsumption_resolution,[],[f75,f50]) ).
fof(f50,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0] :
( ( empty_set = X0
| in(sK4(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f27,f28]) ).
fof(f28,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f26]) ).
fof(f26,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(f75,plain,
in(sK3,empty_set),
inference(forward_demodulation,[],[f68,f59]) ).
fof(f59,plain,
empty_set = set_intersection2(sK1,sK2),
inference(subsumption_resolution,[],[f58,f46]) ).
fof(f46,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f58,plain,
( disjoint(sK1,sK2)
| empty_set = set_intersection2(sK1,sK2) ),
inference(resolution,[],[f57,f41]) ).
fof(f41,plain,
! [X0] :
( in(sK4(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f29]) ).
fof(f57,plain,
! [X0] :
( ~ in(X0,set_intersection2(sK1,sK2))
| disjoint(sK1,sK2) ),
inference(resolution,[],[f36,f38]) ).
fof(f38,plain,
( sP0(sK2,sK1)
| disjoint(sK1,sK2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( ( disjoint(sK1,sK2)
& in(sK3,set_intersection2(sK1,sK2)) )
| sP0(sK2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f20,f24,f23]) ).
fof(f23,plain,
( ? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| sP0(X1,X0) )
=> ( ( disjoint(sK1,sK2)
& ? [X2] : in(X2,set_intersection2(sK1,sK2)) )
| sP0(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
( ? [X2] : in(X2,set_intersection2(sK1,sK2))
=> in(sK3,set_intersection2(sK1,sK2)) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| sP0(X1,X0) ),
inference(definition_folding,[],[f16,f19]) ).
fof(f19,plain,
! [X1,X0] :
( ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) )
| ~ sP0(X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
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(ennf_transformation,[],[f14]) ).
fof(f14,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,[],[f13]) ).
fof(f13,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,[],[f12]) ).
fof(f12,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(f36,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1)
| ~ in(X2,set_intersection2(X1,X0)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( ! [X2] : ~ in(X2,set_intersection2(X1,X0))
& ~ disjoint(X1,X0) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) )
| ~ sP0(X1,X0) ),
inference(nnf_transformation,[],[f19]) ).
fof(f68,plain,
in(sK3,set_intersection2(sK1,sK2)),
inference(unit_resulting_resolution,[],[f62,f55]) ).
fof(f55,plain,
( ~ disjoint(sK1,sK2)
| in(sK3,set_intersection2(sK1,sK2)) ),
inference(resolution,[],[f37,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ~ disjoint(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
( sP0(sK2,sK1)
| in(sK3,set_intersection2(sK1,sK2)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f62,plain,
disjoint(sK1,sK2),
inference(unit_resulting_resolution,[],[f59,f47]) ).
fof(f47,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.36 % Computer : n029.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Apr 29 21:07:04 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.37 % (6238)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.38 % (6241)WARNING: value z3 for option sas not known
% 0.13/0.38 % (6240)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.38 % (6245)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.13/0.38 % (6242)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.38 % (6243)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.13/0.38 % (6244)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.13/0.38 % (6241)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.13/0.38 TRYING [1]
% 0.13/0.38 TRYING [2]
% 0.13/0.38 % (6245)First to succeed.
% 0.13/0.38 TRYING [3]
% 0.13/0.38 % (6239)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.38 % (6244)Also succeeded, but the first one will report.
% 0.13/0.38 TRYING [1]
% 0.13/0.38 TRYING [2]
% 0.13/0.38 TRYING [4]
% 0.13/0.39 % (6243)Also succeeded, but the first one will report.
% 0.13/0.39 % (6245)Refutation found. Thanks to Tanya!
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.39 % (6245)------------------------------
% 0.13/0.39 % (6245)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.39 % (6245)Termination reason: Refutation
% 0.13/0.39
% 0.13/0.39 % (6245)Memory used [KB]: 761
% 0.13/0.39 % (6245)Time elapsed: 0.004 s
% 0.13/0.39 % (6245)Instructions burned: 4 (million)
% 0.13/0.39 % (6245)------------------------------
% 0.13/0.39 % (6245)------------------------------
% 0.13/0.39 % (6238)Success in time 0.019 s
%------------------------------------------------------------------------------