TSTP Solution File: SET884+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET884+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 : n024.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.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 6 unt; 0 def)
% Number of atoms : 184 ( 111 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 234 ( 88 ~; 78 |; 51 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 99 ( 83 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f93,plain,
$false,
inference(subsumption_resolution,[],[f92,f46]) ).
fof(f46,plain,
sK3 != sK1,
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( sK3 != sK1
& subset(singleton(sK3),unordered_pair(sK1,sK2))
& sK3 != sK2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f27,f28]) ).
fof(f28,plain,
( ? [X0,X1,X2] :
( X0 != X2
& subset(singleton(X2),unordered_pair(X0,X1))
& X1 != X2 )
=> ( sK3 != sK1
& subset(singleton(sK3),unordered_pair(sK1,sK2))
& sK3 != sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1,X2] :
( X0 != X2
& subset(singleton(X2),unordered_pair(X0,X1))
& X1 != X2 ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
? [X2,X1,X0] :
( X0 != X2
& subset(singleton(X0),unordered_pair(X2,X1))
& X0 != X1 ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X0,X1,X2] :
~ ( X0 != X2
& subset(singleton(X0),unordered_pair(X2,X1))
& X0 != X1 ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X2,X1] :
~ ( X0 != X2
& X0 != X1
& subset(singleton(X0),unordered_pair(X1,X2)) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X2,X1] :
~ ( X0 != X2
& X0 != X1
& subset(singleton(X0),unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_zfmisc_1) ).
fof(f92,plain,
sK3 = sK1,
inference(subsumption_resolution,[],[f91,f44]) ).
fof(f44,plain,
sK3 != sK2,
inference(cnf_transformation,[],[f29]) ).
fof(f91,plain,
( sK3 = sK2
| sK3 = sK1 ),
inference(resolution,[],[f88,f58]) ).
fof(f58,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f57]) ).
fof(f57,plain,
! [X2,X1] :
( in(X2,X1)
| singleton(X2) != X1 ),
inference(equality_resolution,[],[f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( in(X2,X1)
| X0 != X2
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ( ( ~ in(sK4(X0,X1),X1)
| sK4(X0,X1) != X0 )
& ( in(sK4(X0,X1),X1)
| sK4(X0,X1) = X0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ in(X3,X1)
| X0 != X3 )
& ( in(X3,X1)
| X0 = X3 ) )
=> ( ( ~ in(sK4(X0,X1),X1)
| sK4(X0,X1) != X0 )
& ( in(sK4(X0,X1),X1)
| sK4(X0,X1) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,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,[],[f30]) ).
fof(f30,plain,
! [X1,X0] :
( ( ! [X2] :
( ( X1 = X2
| ~ in(X2,X0) )
& ( in(X2,X0)
| X1 != X2 ) )
| singleton(X1) != X0 )
& ( singleton(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| X1 != X2 )
& ( in(X2,X0)
| X1 = X2 ) ) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( ! [X2] :
( X1 = X2
<=> in(X2,X0) )
<=> singleton(X1) = X0 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f88,plain,
! [X4] :
( ~ in(X4,singleton(sK3))
| sK1 = X4
| sK2 = X4 ),
inference(resolution,[],[f55,f71]) ).
fof(f71,plain,
! [X0] :
( in(X0,unordered_pair(sK1,sK2))
| ~ in(X0,singleton(sK3)) ),
inference(resolution,[],[f42,f45]) ).
fof(f45,plain,
subset(singleton(sK3),unordered_pair(sK1,sK2)),
inference(cnf_transformation,[],[f29]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ subset(X1,X0)
| ~ in(X2,X1)
| in(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( subset(X1,X0)
=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f55,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X2,X0,X1,X4] :
( X1 = X4
| X0 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X0 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X0
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f22,f23]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X0 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X0
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X0,X2,X1] :
( ( unordered_pair(X0,X2) = X1
| ? [X3] :
( ( ( X2 != X3
& X0 != X3 )
| ~ in(X3,X1) )
& ( X2 = X3
| X0 = X3
| in(X3,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ( X2 != X3
& X0 != X3 ) )
& ( X2 = X3
| X0 = X3
| ~ in(X3,X1) ) )
| unordered_pair(X0,X2) != X1 ) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
! [X0,X2,X1] :
( ( unordered_pair(X0,X2) = X1
| ? [X3] :
( ( ( X2 != X3
& X0 != X3 )
| ~ in(X3,X1) )
& ( X2 = X3
| X0 = X3
| in(X3,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ( X2 != X3
& X0 != X3 ) )
& ( X2 = X3
| X0 = X3
| ~ in(X3,X1) ) )
| unordered_pair(X0,X2) != X1 ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X2,X1] :
( unordered_pair(X0,X2) = X1
<=> ! [X3] :
( in(X3,X1)
<=> ( X2 = X3
| X0 = X3 ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X2,X1] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET884+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_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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 14:30:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (24300)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.21/0.51 % (24312)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.51 % (24311)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (24302)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.52 % (24312)Instruction limit reached!
% 0.21/0.52 % (24312)------------------------------
% 0.21/0.52 % (24312)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (24302)First to succeed.
% 0.21/0.52 % (24312)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (24312)Termination reason: Unknown
% 0.21/0.52 % (24312)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (24312)Memory used [KB]: 5884
% 0.21/0.52 % (24312)Time elapsed: 0.110 s
% 0.21/0.52 % (24312)Instructions burned: 3 (million)
% 0.21/0.52 % (24312)------------------------------
% 0.21/0.52 % (24312)------------------------------
% 0.21/0.53 % (24302)Refutation found. Thanks to Tanya!
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (24302)------------------------------
% 0.21/0.53 % (24302)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (24302)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (24302)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (24302)Memory used [KB]: 6012
% 0.21/0.53 % (24302)Time elapsed: 0.114 s
% 0.21/0.53 % (24302)Instructions burned: 3 (million)
% 0.21/0.53 % (24302)------------------------------
% 0.21/0.53 % (24302)------------------------------
% 0.21/0.53 % (24292)Success in time 0.168 s
%------------------------------------------------------------------------------