TSTP Solution File: SET877+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET877+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 : n025.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:52 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 76 ( 50 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 84 ( 33 ~; 29 |; 15 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 35 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f62,plain,
$false,
inference(trivial_inequality_removal,[],[f61]) ).
fof(f61,plain,
sK0 != sK0,
inference(superposition,[],[f25,f55]) ).
fof(f55,plain,
sK0 = sK1,
inference(resolution,[],[f54,f38]) ).
fof(f38,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK2(X0,X1) != X0
| ~ in(sK2(X0,X1),X1) )
& ( sK2(X0,X1) = X0
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f17,f18]) ).
fof(f18,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK2(X0,X1) != X0
| ~ in(sK2(X0,X1),X1) )
& ( sK2(X0,X1) = X0
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f54,plain,
in(sK0,singleton(sK1)),
inference(trivial_inequality_removal,[],[f49]) ).
fof(f49,plain,
( singleton(sK0) != singleton(sK0)
| in(sK0,singleton(sK1)) ),
inference(superposition,[],[f46,f24]) ).
fof(f24,plain,
singleton(sK0) = set_intersection2(singleton(sK0),singleton(sK1)),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
( sK0 != sK1
& singleton(sK0) = set_intersection2(singleton(sK0),singleton(sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f14]) ).
fof(f14,plain,
( ? [X0,X1] :
( X0 != X1
& singleton(X0) = set_intersection2(singleton(X0),singleton(X1)) )
=> ( sK0 != sK1
& singleton(sK0) = set_intersection2(singleton(sK0),singleton(sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1] :
( X0 != X1
& singleton(X0) = set_intersection2(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] :
( singleton(X0) = set_intersection2(singleton(X0),singleton(X1))
=> X0 = X1 ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1] :
( singleton(X0) = set_intersection2(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_zfmisc_1) ).
fof(f46,plain,
! [X0,X1] :
( singleton(X1) != set_intersection2(singleton(X1),X0)
| in(X1,X0) ),
inference(superposition,[],[f29,f27]) ).
fof(f27,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f29,plain,
! [X0,X1] :
( singleton(X1) != set_intersection2(X0,singleton(X1))
| in(X1,X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( in(X1,X0)
| singleton(X1) != set_intersection2(X0,singleton(X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( singleton(X1) = set_intersection2(X0,singleton(X1))
=> in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_zfmisc_1) ).
fof(f25,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SET877+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n025.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 : Tue Apr 30 01:58:56 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (22603)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.32 % (22606)WARNING: value z3 for option sas not known
% 0.16/0.32 % (22608)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.16/0.32 % (22609)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.16/0.32 % (22606)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.16/0.32 % (22610)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.16/0.32 % (22604)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.32 % (22609)First to succeed.
% 0.16/0.32 % (22610)Also succeeded, but the first one will report.
% 0.16/0.33 % (22609)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for theBenchmark
% 0.16/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.33 % (22609)------------------------------
% 0.16/0.33 % (22609)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.16/0.33 % (22609)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (22609)Memory used [KB]: 769
% 0.16/0.33 % (22609)Time elapsed: 0.003 s
% 0.16/0.33 % (22609)Instructions burned: 4 (million)
% 0.16/0.33 % (22609)------------------------------
% 0.16/0.33 % (22609)------------------------------
% 0.16/0.33 % (22603)Success in time 0.013 s
%------------------------------------------------------------------------------