TSTP Solution File: SET880+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET880+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n008.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 : Wed Aug 31 18:22:39 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 80 ( 50 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 92 ( 35 ~; 31 |; 17 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 34 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,plain,
$false,
inference(subsumption_resolution,[],[f35,f32]) ).
fof(f32,plain,
~ in(sK1,singleton(sK2)),
inference(unit_resulting_resolution,[],[f27,f30]) ).
fof(f30,plain,
! [X3,X1] :
( ~ in(X3,singleton(X1))
| X1 = X3 ),
inference(equality_resolution,[],[f20]) ).
fof(f20,plain,
! [X3,X0,X1] :
( X1 = X3
| ~ in(X3,X0)
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| ( ( sK0(X0,X1) != X1
| ~ in(sK0(X0,X1),X0) )
& ( sK0(X0,X1) = X1
| in(sK0(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( in(X3,X0)
| X1 != X3 )
& ( X1 = X3
| ~ in(X3,X0) ) )
| singleton(X1) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f14]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X2] :
( ( X1 != X2
| ~ in(X2,X0) )
& ( X1 = X2
| in(X2,X0) ) )
=> ( ( sK0(X0,X1) != X1
| ~ in(sK0(X0,X1),X0) )
& ( sK0(X0,X1) = X1
| in(sK0(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| ? [X2] :
( ( X1 != X2
| ~ in(X2,X0) )
& ( X1 = X2
| in(X2,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X0)
| X1 != X3 )
& ( X1 = X3
| ~ in(X3,X0) ) )
| singleton(X1) != X0 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| ? [X2] :
( ( X1 != X2
| ~ in(X2,X0) )
& ( X1 = X2
| in(X2,X0) ) ) )
& ( ! [X2] :
( ( in(X2,X0)
| X1 != X2 )
& ( X1 = X2
| ~ in(X2,X0) ) )
| singleton(X1) != X0 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( singleton(X1) = X0
<=> ! [X2] :
( in(X2,X0)
<=> X1 = X2 ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ! [X2] :
( X0 = X2
<=> in(X2,X1) )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f27,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( sK1 != sK2
& empty_set = set_difference(singleton(sK1),singleton(sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f11,f18]) ).
fof(f18,plain,
( ? [X0,X1] :
( X0 != X1
& empty_set = set_difference(singleton(X0),singleton(X1)) )
=> ( sK1 != sK2
& empty_set = set_difference(singleton(sK1),singleton(sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1] :
( X0 != X1
& empty_set = set_difference(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1,X0] :
( empty_set = set_difference(singleton(X0),singleton(X1))
=> X0 = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1,X0] :
( empty_set = set_difference(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_zfmisc_1) ).
fof(f35,plain,
in(sK1,singleton(sK2)),
inference(trivial_inequality_removal,[],[f34]) ).
fof(f34,plain,
( empty_set != empty_set
| in(sK1,singleton(sK2)) ),
inference(superposition,[],[f24,f26]) ).
fof(f26,plain,
empty_set = set_difference(singleton(sK1),singleton(sK2)),
inference(cnf_transformation,[],[f19]) ).
fof(f24,plain,
! [X0,X1] :
( empty_set != set_difference(singleton(X1),X0)
| in(X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( empty_set = set_difference(singleton(X1),X0)
| ~ in(X1,X0) )
& ( in(X1,X0)
| empty_set != set_difference(singleton(X1),X0) ) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( ( empty_set = set_difference(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( empty_set = set_difference(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l36_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET880+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:31:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.54 % (11234)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.55 % (11232)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.55 % (11229)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (11229)First to succeed.
% 0.20/0.55 % (11236)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.55 % (11229)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (11229)------------------------------
% 0.20/0.55 % (11229)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (11229)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (11229)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (11229)Memory used [KB]: 5884
% 0.20/0.55 % (11229)Time elapsed: 0.144 s
% 0.20/0.55 % (11229)Instructions burned: 2 (million)
% 0.20/0.55 % (11229)------------------------------
% 0.20/0.55 % (11229)------------------------------
% 0.20/0.55 % (11225)Success in time 0.201 s
%------------------------------------------------------------------------------