TSTP Solution File: SET874+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET874+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 : n013.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:38 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 96 ( 67 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 121 ( 45 ~; 45 |; 24 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 54 ( 46 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f62,plain,
$false,
inference(unit_resulting_resolution,[],[f54,f44,f37]) ).
fof(f37,plain,
! [X0,X1] :
( ~ in(X0,X1)
| set_union2(singleton(X0),X1) = X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( set_union2(singleton(X0),X1) = X1
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(f44,plain,
unordered_pair(sK1,sK2) != set_union2(singleton(sK1),unordered_pair(sK1,sK2)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
unordered_pair(sK1,sK2) != set_union2(singleton(sK1),unordered_pair(sK1,sK2)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f20,f27]) ).
fof(f27,plain,
( ? [X0,X1] : unordered_pair(X0,X1) != set_union2(singleton(X0),unordered_pair(X0,X1))
=> unordered_pair(sK1,sK2) != set_union2(singleton(sK1),unordered_pair(sK1,sK2)) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] : unordered_pair(X0,X1) != set_union2(singleton(X0),unordered_pair(X0,X1)),
inference(ennf_transformation,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X1,X0] : unordered_pair(X0,X1) = set_union2(singleton(X0),unordered_pair(X0,X1)),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X1,X0] : unordered_pair(X0,X1) = set_union2(singleton(X0),unordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_zfmisc_1) ).
fof(f54,plain,
! [X2,X3] : in(X3,unordered_pair(X3,X2)),
inference(equality_resolution,[],[f53]) ).
fof(f53,plain,
! [X2,X3,X1] :
( in(X3,X1)
| unordered_pair(X3,X2) != X1 ),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| unordered_pair(X0,X2) != X1 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( X0 = X3
| X2 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( X0 != X3
& X2 != X3 ) ) )
| unordered_pair(X0,X2) != X1 )
& ( unordered_pair(X0,X2) = X1
| ( ( ~ in(sK0(X0,X1,X2),X1)
| ( sK0(X0,X1,X2) != X0
& sK0(X0,X1,X2) != X2 ) )
& ( in(sK0(X0,X1,X2),X1)
| sK0(X0,X1,X2) = X0
| sK0(X0,X1,X2) = X2 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f24,f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X1)
| ( X0 != X4
& X2 != X4 ) )
& ( in(X4,X1)
| X0 = X4
| X2 = X4 ) )
=> ( ( ~ in(sK0(X0,X1,X2),X1)
| ( sK0(X0,X1,X2) != X0
& sK0(X0,X1,X2) != X2 ) )
& ( in(sK0(X0,X1,X2),X1)
| sK0(X0,X1,X2) = X0
| sK0(X0,X1,X2) = X2 ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( X0 = X3
| X2 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( X0 != X3
& X2 != X3 ) ) )
| unordered_pair(X0,X2) != X1 )
& ( unordered_pair(X0,X2) = X1
| ? [X4] :
( ( ~ in(X4,X1)
| ( X0 != X4
& X2 != X4 ) )
& ( in(X4,X1)
| X0 = X4
| X2 = X4 ) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( ( X2 = X3
| X0 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( X2 != X3
& X0 != X3 ) ) )
| unordered_pair(X2,X0) != X1 )
& ( unordered_pair(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( X2 != X3
& X0 != X3 ) )
& ( in(X3,X1)
| X2 = X3
| X0 = X3 ) ) ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( ( X2 = X3
| X0 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( X2 != X3
& X0 != X3 ) ) )
| unordered_pair(X2,X0) != X1 )
& ( unordered_pair(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( X2 != X3
& X0 != X3 ) )
& ( in(X3,X1)
| X2 = X3
| X0 = X3 ) ) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X2,X1,X0] :
( ! [X3] :
( ( X2 = X3
| X0 = X3 )
<=> in(X3,X1) )
<=> unordered_pair(X2,X0) = X1 ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X2,X0] :
( ! [X3] :
( ( X1 = X3
| X0 = X3 )
<=> in(X3,X2) )
<=> unordered_pair(X0,X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET874+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/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.12/0.35 % Computer : n013.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Aug 30 14:24:17 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.51 % (12031)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.51 % (12023)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.51 % (12027)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.20/0.52 % (12030)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.20/0.52 % (12039)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (12030)First to succeed.
% 0.20/0.52 % (12030)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (12030)------------------------------
% 0.20/0.52 % (12030)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (12030)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (12030)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (12030)Memory used [KB]: 5884
% 0.20/0.52 % (12030)Time elapsed: 0.110 s
% 0.20/0.52 % (12030)Instructions burned: 2 (million)
% 0.20/0.52 % (12030)------------------------------
% 0.20/0.52 % (12030)------------------------------
% 0.20/0.52 % (12022)Success in time 0.167 s
%------------------------------------------------------------------------------