TSTP Solution File: SET928+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET928+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 : 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:22:46 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 4 unt; 0 def)
% Number of atoms : 157 ( 34 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 180 ( 79 ~; 68 |; 24 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 56 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f100,plain,
$false,
inference(avatar_sat_refutation,[],[f60,f61,f62,f86,f97,f99]) ).
fof(f99,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f98]) ).
fof(f98,plain,
( $false
| ~ spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f93,f55]) ).
fof(f55,plain,
( in(sK2,sK4)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f53,plain,
( spl5_2
<=> in(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f93,plain,
( ~ in(sK2,sK4)
| ~ spl5_1 ),
inference(resolution,[],[f89,f41]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ disjoint(unordered_pair(X1,X0),X2)
| ~ in(X1,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ~ in(X1,X2)
| ~ disjoint(unordered_pair(X1,X0),X2) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ in(X0,X1)
| ~ disjoint(unordered_pair(X0,X2),X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X2,X1,X0] :
~ ( disjoint(unordered_pair(X0,X2),X1)
& in(X0,X1) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X0,X2,X1] :
~ ( disjoint(unordered_pair(X0,X1),X2)
& in(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_zfmisc_1) ).
fof(f89,plain,
( disjoint(unordered_pair(sK2,sK3),sK4)
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f88]) ).
fof(f88,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK2,sK3)
| disjoint(unordered_pair(sK2,sK3),sK4)
| ~ spl5_1 ),
inference(superposition,[],[f45,f50]) ).
fof(f50,plain,
( unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f49,plain,
( spl5_1
<=> unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f45,plain,
! [X0,X1] :
( set_difference(X1,X0) != X1
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( set_difference(X1,X0) = X1
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| set_difference(X1,X0) != X1 ) ),
inference(rectify,[],[f34]) ).
fof(f34,plain,
! [X1,X0] :
( ( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) )
& ( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X1,X0] :
( set_difference(X0,X1) = X0
<=> disjoint(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f97,plain,
( ~ spl5_1
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f96]) ).
fof(f96,plain,
( $false
| ~ spl5_1
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f92,f59]) ).
fof(f59,plain,
( in(sK3,sK4)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f57,plain,
( spl5_3
<=> in(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f92,plain,
( ~ in(sK3,sK4)
| ~ spl5_1 ),
inference(resolution,[],[f89,f63]) ).
fof(f63,plain,
! [X2,X0,X1] :
( ~ disjoint(unordered_pair(X1,X0),X2)
| ~ in(X0,X2) ),
inference(superposition,[],[f41,f44]) ).
fof(f44,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f86,plain,
( spl5_1
| spl5_2
| spl5_3 ),
inference(avatar_contradiction_clause,[],[f85]) ).
fof(f85,plain,
( $false
| spl5_1
| spl5_2
| spl5_3 ),
inference(subsumption_resolution,[],[f83,f51]) ).
fof(f51,plain,
( unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4)
| spl5_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f83,plain,
( unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4)
| spl5_2
| spl5_3 ),
inference(resolution,[],[f75,f46]) ).
fof(f46,plain,
! [X0,X1] :
( ~ disjoint(X1,X0)
| set_difference(X1,X0) = X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f75,plain,
( disjoint(unordered_pair(sK2,sK3),sK4)
| spl5_2
| spl5_3 ),
inference(resolution,[],[f67,f58]) ).
fof(f58,plain,
( ~ in(sK3,sK4)
| spl5_3 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f67,plain,
( ! [X0] :
( in(X0,sK4)
| disjoint(unordered_pair(sK2,X0),sK4) )
| spl5_2 ),
inference(resolution,[],[f47,f54]) ).
fof(f54,plain,
( ~ in(sK2,sK4)
| spl5_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f47,plain,
! [X2,X0,X1] :
( in(X2,X0)
| in(X1,X0)
| disjoint(unordered_pair(X2,X1),X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( in(X2,X0)
| disjoint(unordered_pair(X2,X1),X0)
| in(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X2,X0,X1] :
~ ( ~ in(X1,X0)
& ~ in(X2,X0)
& ~ disjoint(unordered_pair(X2,X1),X0) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X2,X0] :
~ ( ~ in(X2,X1)
& ~ in(X0,X1)
& ~ disjoint(unordered_pair(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t57_zfmisc_1) ).
fof(f62,plain,
( ~ spl5_2
| spl5_1 ),
inference(avatar_split_clause,[],[f39,f49,f53]) ).
fof(f39,plain,
( unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4)
| ~ in(sK2,sK4) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( ( in(sK2,sK4)
| in(sK3,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) )
& ( ( ~ in(sK2,sK4)
& ~ in(sK3,sK4) )
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f27,f28]) ).
fof(f28,plain,
( ? [X0,X1,X2] :
( ( in(X0,X2)
| in(X1,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X0,X2)
& ~ in(X1,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) )
=> ( ( in(sK2,sK4)
| in(sK3,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) )
& ( ( ~ in(sK2,sK4)
& ~ in(sK3,sK4) )
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ( in(X0,X2)
| in(X1,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X0,X2)
& ~ in(X1,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
? [X1,X2,X0] :
( ( in(X1,X0)
| in(X2,X0)
| unordered_pair(X1,X2) != set_difference(unordered_pair(X1,X2),X0) )
& ( ( ~ in(X1,X0)
& ~ in(X2,X0) )
| unordered_pair(X1,X2) = set_difference(unordered_pair(X1,X2),X0) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
? [X1,X2,X0] :
( ( in(X1,X0)
| in(X2,X0)
| unordered_pair(X1,X2) != set_difference(unordered_pair(X1,X2),X0) )
& ( ( ~ in(X1,X0)
& ~ in(X2,X0) )
| unordered_pair(X1,X2) = set_difference(unordered_pair(X1,X2),X0) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f20,plain,
? [X1,X2,X0] :
( unordered_pair(X1,X2) = set_difference(unordered_pair(X1,X2),X0)
<~> ( ~ in(X1,X0)
& ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X2,X0,X1] :
( ( ~ in(X1,X0)
& ~ in(X2,X0) )
<=> unordered_pair(X1,X2) = set_difference(unordered_pair(X1,X2),X0) ),
inference(rectify,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X2,X0,X1] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<=> ( ~ in(X0,X2)
& ~ in(X1,X2) ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X2,X0,X1] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<=> ( ~ in(X0,X2)
& ~ in(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t72_zfmisc_1) ).
fof(f61,plain,
( ~ spl5_3
| spl5_1 ),
inference(avatar_split_clause,[],[f38,f49,f57]) ).
fof(f38,plain,
( unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4)
| ~ in(sK3,sK4) ),
inference(cnf_transformation,[],[f29]) ).
fof(f60,plain,
( ~ spl5_1
| spl5_2
| spl5_3 ),
inference(avatar_split_clause,[],[f40,f57,f53,f49]) ).
fof(f40,plain,
( in(sK3,sK4)
| in(sK2,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET928+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.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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 Aug 30 13:55:05 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.49 % (21547)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.20/0.50 % (21547)Refutation not found, incomplete strategy% (21547)------------------------------
% 0.20/0.50 % (21547)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (21539)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.20/0.50 % (21539)First to succeed.
% 0.20/0.50 % (21547)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (21547)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50
% 0.20/0.50 % (21547)Memory used [KB]: 1407
% 0.20/0.50 % (21547)Time elapsed: 0.071 s
% 0.20/0.50 % (21547)Instructions burned: 2 (million)
% 0.20/0.50 % (21547)------------------------------
% 0.20/0.50 % (21547)------------------------------
% 0.20/0.50 % (21539)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (21539)------------------------------
% 0.20/0.50 % (21539)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (21539)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (21539)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (21539)Memory used [KB]: 6012
% 0.20/0.50 % (21539)Time elapsed: 0.075 s
% 0.20/0.50 % (21539)Instructions burned: 4 (million)
% 0.20/0.50 % (21539)------------------------------
% 0.20/0.50 % (21539)------------------------------
% 0.20/0.50 % (21523)Success in time 0.149 s
%------------------------------------------------------------------------------