TSTP Solution File: SET875+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET875+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_sat --cores 0 -t %d %s
% Computer : n017.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:25:59 EDT 2022
% Result : Theorem 1.44s 0.55s
% Output : Refutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 78 ( 35 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 89 ( 37 ~; 29 |; 19 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 37 !; 7 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_5,type,
sQ6_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_6,type,
sQ7_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_7,type,
sQ8_eqProxy: ( $real * $real ) > $o ).
fof(f82,plain,
$false,
inference(subsumption_resolution,[],[f81,f42]) ).
fof(f42,plain,
! [X2] : in(X2,singleton(X2)),
inference(literal_reordering,[],[f41]) ).
fof(f41,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X1] :
( in(X2,X1)
| singleton(X2) != X1 ),
inference(equality_resolution,[],[f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( in(X2,X1)
| X0 != X2
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ( ( ~ in(sK0(X0,X1),X1)
| sK0(X0,X1) != X0 )
& ( in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f17,f18]) ).
fof(f18,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ in(X3,X1)
| X0 != X3 )
& ( in(X3,X1)
| X0 = X3 ) )
=> ( ( ~ in(sK0(X0,X1),X1)
| sK0(X0,X1) != X0 )
& ( in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| X0 != X3 )
& ( in(X3,X1)
| X0 = X3 ) ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) ) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ! [X2] :
( X0 = X2
<=> in(X2,X1) )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f81,plain,
~ in(sK3,singleton(sK3)),
inference(resolution,[],[f45,f46]) ).
fof(f46,plain,
disjoint(singleton(sK3),singleton(sK3)),
inference(literal_reordering,[],[f38]) ).
fof(f38,plain,
disjoint(singleton(sK3),singleton(sK3)),
inference(definition_unfolding,[],[f35,f36]) ).
fof(f36,plain,
sK2 = sK3,
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
( sK2 = sK3
& disjoint(singleton(sK3),singleton(sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f12,f23]) ).
fof(f23,plain,
( ? [X0,X1] :
( X0 = X1
& disjoint(singleton(X1),singleton(X0)) )
=> ( sK2 = sK3
& disjoint(singleton(sK3),singleton(sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1] :
( X0 = X1
& disjoint(singleton(X1),singleton(X0)) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X0,X1] :
~ ( X0 = X1
& disjoint(singleton(X1),singleton(X0)) ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1,X0] :
~ ( disjoint(singleton(X0),singleton(X1))
& X0 = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1,X0] :
~ ( disjoint(singleton(X0),singleton(X1))
& X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_zfmisc_1) ).
fof(f35,plain,
disjoint(singleton(sK3),singleton(sK2)),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
! [X0,X1] :
( ~ disjoint(singleton(X1),X0)
| ~ in(X1,X0) ),
inference(literal_reordering,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ disjoint(singleton(X1),X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ disjoint(singleton(X1),X0)
| ~ in(X1,X0) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( ~ disjoint(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
~ ( disjoint(singleton(X0),X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET875+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n017.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 13:51:50 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.54 % (9023)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 1.44/0.55 % (9023)First to succeed.
% 1.44/0.55 % (9015)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 1.44/0.55 TRYING [1]
% 1.44/0.55 % (9023)Refutation found. Thanks to Tanya!
% 1.44/0.55 % SZS status Theorem for theBenchmark
% 1.44/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 1.44/0.55 % (9023)------------------------------
% 1.44/0.55 % (9023)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.55 % (9023)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.55 % (9023)Termination reason: Refutation
% 1.44/0.55
% 1.44/0.55 % (9023)Memory used [KB]: 5756
% 1.44/0.55 % (9023)Time elapsed: 0.008 s
% 1.44/0.55 % (9023)Instructions burned: 3 (million)
% 1.44/0.55 % (9023)------------------------------
% 1.44/0.55 % (9023)------------------------------
% 1.44/0.55 % (9008)Success in time 0.199 s
%------------------------------------------------------------------------------