TSTP Solution File: SET879+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET879+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 : n014.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.21s 0.57s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 2 unt; 0 def)
% Number of atoms : 132 ( 74 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 155 ( 64 ~; 65 |; 16 &)
% ( 7 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 39 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f70,plain,
$false,
inference(avatar_sat_refutation,[],[f45,f46,f64,f69]) ).
fof(f69,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f68]) ).
fof(f68,plain,
( $false
| ~ spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f67,f36]) ).
fof(f36,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X2,X0] :
( in(X2,X0)
| singleton(X2) != X0 ),
inference(equality_resolution,[],[f25]) ).
fof(f25,plain,
! [X2,X0,X1] :
( in(X2,X0)
| X1 != X2
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X1 = X2
| ~ in(X2,X0) )
& ( in(X2,X0)
| X1 != X2 ) )
| singleton(X1) != X0 )
& ( singleton(X1) = X0
| ( ( ~ in(sK0(X0,X1),X0)
| sK0(X0,X1) != X1 )
& ( in(sK0(X0,X1),X0)
| sK0(X0,X1) = X1 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f12]) ).
fof(f12,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ in(X3,X0)
| X1 != X3 )
& ( in(X3,X0)
| X1 = X3 ) )
=> ( ( ~ in(sK0(X0,X1),X0)
| sK0(X0,X1) != X1 )
& ( in(sK0(X0,X1),X0)
| sK0(X0,X1) = X1 ) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X1 = X2
| ~ in(X2,X0) )
& ( in(X2,X0)
| X1 != X2 ) )
| singleton(X1) != X0 )
& ( singleton(X1) = X0
| ? [X3] :
( ( ~ in(X3,X0)
| X1 != X3 )
& ( in(X3,X0)
| X1 = X3 ) ) ) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X1,X0] :
( ( ! [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,
! [X1,X0] :
( ! [X2] :
( X0 = X2
<=> in(X2,X1) )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f67,plain,
( ~ in(sK3,singleton(sK3))
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f66]) ).
fof(f66,plain,
( singleton(sK3) != singleton(sK3)
| ~ in(sK3,singleton(sK3))
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f29,f65]) ).
fof(f65,plain,
( singleton(sK3) = set_difference(singleton(sK3),singleton(sK3))
| ~ spl5_1
| ~ spl5_2 ),
inference(forward_demodulation,[],[f40,f43]) ).
fof(f43,plain,
( sK2 = sK3
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl5_2
<=> sK2 = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f40,plain,
( set_difference(singleton(sK2),singleton(sK3)) = singleton(sK2)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl5_1
<=> set_difference(singleton(sK2),singleton(sK3)) = singleton(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f29,plain,
! [X0,X1] :
( singleton(X0) != set_difference(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( singleton(X0) = set_difference(singleton(X0),X1)
| in(X0,X1) )
& ( ~ in(X0,X1)
| singleton(X0) != set_difference(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = set_difference(singleton(X0),X1)
<=> ~ in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l34_zfmisc_1) ).
fof(f64,plain,
( spl5_1
| spl5_2 ),
inference(avatar_contradiction_clause,[],[f63]) ).
fof(f63,plain,
( $false
| spl5_1
| spl5_2 ),
inference(subsumption_resolution,[],[f61,f44]) ).
fof(f44,plain,
( sK2 != sK3
| spl5_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f61,plain,
( sK2 = sK3
| spl5_1 ),
inference(trivial_inequality_removal,[],[f59]) ).
fof(f59,plain,
( singleton(sK2) != singleton(sK2)
| sK2 = sK3
| spl5_1 ),
inference(superposition,[],[f39,f50]) ).
fof(f50,plain,
! [X2,X3] :
( set_difference(singleton(X2),singleton(X3)) = singleton(X2)
| X2 = X3 ),
inference(resolution,[],[f30,f34]) ).
fof(f34,plain,
! [X2,X1] :
( ~ in(X2,singleton(X1))
| X1 = X2 ),
inference(equality_resolution,[],[f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ in(X2,X0)
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f30,plain,
! [X0,X1] :
( in(X0,X1)
| singleton(X0) = set_difference(singleton(X0),X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f39,plain,
( set_difference(singleton(sK2),singleton(sK3)) != singleton(sK2)
| spl5_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f46,plain,
( spl5_2
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f32,f38,f42]) ).
fof(f32,plain,
( set_difference(singleton(sK2),singleton(sK3)) != singleton(sK2)
| sK2 = sK3 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( ( sK2 = sK3
| set_difference(singleton(sK2),singleton(sK3)) != singleton(sK2) )
& ( sK2 != sK3
| set_difference(singleton(sK2),singleton(sK3)) = singleton(sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1] :
( ( X0 = X1
| singleton(X0) != set_difference(singleton(X0),singleton(X1)) )
& ( X0 != X1
| singleton(X0) = set_difference(singleton(X0),singleton(X1)) ) )
=> ( ( sK2 = sK3
| set_difference(singleton(sK2),singleton(sK3)) != singleton(sK2) )
& ( sK2 != sK3
| set_difference(singleton(sK2),singleton(sK3)) = singleton(sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1] :
( ( X0 = X1
| singleton(X0) != set_difference(singleton(X0),singleton(X1)) )
& ( X0 != X1
| singleton(X0) = set_difference(singleton(X0),singleton(X1)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,plain,
? [X0,X1] :
( singleton(X0) = set_difference(singleton(X0),singleton(X1))
<~> X0 != X1 ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X1,X0] :
( singleton(X0) = set_difference(singleton(X0),singleton(X1))
<=> X0 != X1 ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X1,X0] :
( singleton(X0) = set_difference(singleton(X0),singleton(X1))
<=> X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_zfmisc_1) ).
fof(f45,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f31,f42,f38]) ).
fof(f31,plain,
( sK2 != sK3
| set_difference(singleton(sK2),singleton(sK3)) = singleton(sK2) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET879+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/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.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:29:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.53 % (11411)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.55 % (11432)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.55 % (11411)Refutation not found, incomplete strategy% (11411)------------------------------
% 0.21/0.55 % (11411)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (11411)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (11411)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.55
% 0.21/0.55 % (11411)Memory used [KB]: 5884
% 0.21/0.55 % (11411)Time elapsed: 0.117 s
% 0.21/0.55 % (11411)Instructions burned: 2 (million)
% 0.21/0.55 % (11411)------------------------------
% 0.21/0.55 % (11411)------------------------------
% 0.21/0.55 % (11425)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.56 % (11417)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.56 % (11433)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.56 % (11433)Refutation not found, incomplete strategy% (11433)------------------------------
% 0.21/0.56 % (11433)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56 % (11433)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56 % (11433)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.56
% 0.21/0.56 % (11433)Memory used [KB]: 1407
% 0.21/0.56 % (11433)Time elapsed: 0.069 s
% 0.21/0.56 % (11433)Instructions burned: 1 (million)
% 0.21/0.56 % (11433)------------------------------
% 0.21/0.56 % (11433)------------------------------
% 0.21/0.56 % (11425)First to succeed.
% 0.21/0.57 % (11425)Refutation found. Thanks to Tanya!
% 0.21/0.57 % SZS status Theorem for theBenchmark
% 0.21/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57 % (11425)------------------------------
% 0.21/0.57 % (11425)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (11425)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (11425)Termination reason: Refutation
% 0.21/0.57
% 0.21/0.57 % (11425)Memory used [KB]: 5884
% 0.21/0.57 % (11425)Time elapsed: 0.081 s
% 0.21/0.57 % (11425)Instructions burned: 3 (million)
% 0.21/0.57 % (11425)------------------------------
% 0.21/0.57 % (11425)------------------------------
% 0.21/0.57 % (11409)Success in time 0.205 s
%------------------------------------------------------------------------------