TSTP Solution File: SET903+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET903+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n024.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:13:55 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 96 ( 86 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 106 ( 40 ~; 33 |; 32 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 34 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f97,plain,
$false,
inference(trivial_inequality_removal,[],[f96]) ).
fof(f96,plain,
empty_set != empty_set,
inference(superposition,[],[f28,f92]) ).
fof(f92,plain,
empty_set = sK2,
inference(trivial_inequality_removal,[],[f90]) ).
fof(f90,plain,
( empty_set != empty_set
| empty_set = sK2 ),
inference(superposition,[],[f29,f86]) ).
fof(f86,plain,
( empty_set = sK3
| empty_set = sK2 ),
inference(trivial_inequality_removal,[],[f84]) ).
fof(f84,plain,
( sK2 != sK2
| empty_set = sK3
| empty_set = sK2 ),
inference(superposition,[],[f27,f80]) ).
fof(f80,plain,
( sK2 = sK3
| empty_set = sK3
| empty_set = sK2 ),
inference(duplicate_literal_removal,[],[f70]) ).
fof(f70,plain,
( sK2 = sK3
| empty_set = sK3
| empty_set = sK2
| empty_set = sK3
| empty_set = sK2 ),
inference(superposition,[],[f58,f57]) ).
fof(f57,plain,
( sK3 = singleton(sK1)
| empty_set = sK3
| empty_set = sK2 ),
inference(resolution,[],[f56,f36]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| singleton(X1) = X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( singleton(X1) = X0
& singleton(X1) = X2 )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ( singleton(X0) = X2
& singleton(X0) = X1 )
| ~ sP0(X2,X0,X1) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X2,X0,X1] :
( ( singleton(X0) = X2
& singleton(X0) = X1 )
| ~ sP0(X2,X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f56,plain,
( sP0(sK3,sK1,sK2)
| empty_set = sK2
| empty_set = sK3 ),
inference(equality_resolution,[],[f51]) ).
fof(f51,plain,
! [X0] :
( singleton(X0) != singleton(sK1)
| empty_set = sK2
| sP0(sK3,X0,sK2)
| empty_set = sK3 ),
inference(superposition,[],[f39,f26]) ).
fof(f26,plain,
singleton(sK1) = set_union2(sK2,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( empty_set != sK3
& empty_set != sK2
& sK2 != sK3
& singleton(sK1) = set_union2(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f12,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( empty_set != X2
& empty_set != X1
& X1 != X2
& singleton(X0) = set_union2(X1,X2) )
=> ( empty_set != sK3
& empty_set != sK2
& sK2 != sK3
& singleton(sK1) = set_union2(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1,X2] :
( empty_set != X2
& empty_set != X1
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( empty_set != X2
& empty_set != X1
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X1,X2] :
~ ( empty_set != X2
& empty_set != X1
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_zfmisc_1) ).
fof(f39,plain,
! [X2,X0,X1] :
( singleton(X0) != set_union2(X1,X2)
| empty_set = X1
| sP0(X2,X0,X1)
| empty_set = X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( empty_set = X2
& singleton(X0) = X1 )
| ( singleton(X0) = X2
& empty_set = X1 )
| sP0(X2,X0,X1)
| singleton(X0) != set_union2(X1,X2) ),
inference(definition_folding,[],[f15,f16]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( empty_set = X2
& singleton(X0) = X1 )
| ( singleton(X0) = X2
& empty_set = X1 )
| ( singleton(X0) = X2
& singleton(X0) = X1 )
| singleton(X0) != set_union2(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X2] :
~ ( ~ ( empty_set = X2
& singleton(X0) = X1 )
& ~ ( singleton(X0) = X2
& empty_set = X1 )
& ~ ( singleton(X0) = X2
& singleton(X0) = X1 )
& singleton(X0) = set_union2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_zfmisc_1) ).
fof(f58,plain,
( sK2 = singleton(sK1)
| empty_set = sK3
| empty_set = sK2 ),
inference(resolution,[],[f56,f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| singleton(X1) = X2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f27,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
empty_set != sK3,
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET903+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 01:02:36 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (12406)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.37 % (12409)WARNING: value z3 for option sas not known
% 0.20/0.37 % (12410)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.37 % (12408)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.37 % (12412)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.20/0.37 % (12411)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.20/0.37 % (12413)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.20/0.37 % (12409)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.20/0.37 % (12407)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.37 Detected minimum model sizes of [3]
% 0.20/0.37 Detected maximum model sizes of [max]
% 0.20/0.37 TRYING [3]
% 0.20/0.38 TRYING [4]
% 0.20/0.38 % (12412)First to succeed.
% 0.20/0.38 Detected minimum model sizes of [3]
% 0.20/0.38 Detected maximum model sizes of [max]
% 0.20/0.38 TRYING [3]
% 0.20/0.38 % (12409)Also succeeded, but the first one will report.
% 0.20/0.38 % (12412)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (12412)------------------------------
% 0.20/0.38 % (12412)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.38 % (12412)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (12412)Memory used [KB]: 775
% 0.20/0.38 % (12412)Time elapsed: 0.006 s
% 0.20/0.38 % (12412)Instructions burned: 7 (million)
% 0.20/0.38 % (12412)------------------------------
% 0.20/0.38 % (12412)------------------------------
% 0.20/0.38 % (12406)Success in time 0.022 s
%------------------------------------------------------------------------------