TSTP Solution File: SET878+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET878+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 : n027.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.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 16 unt; 0 def)
% Number of atoms : 101 ( 73 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 121 ( 48 ~; 44 |; 24 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 64 ( 54 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(unit_resulting_resolution,[],[f45,f50,f34]) ).
fof(f34,plain,
! [X0,X1] :
( ~ in(X0,X1)
| singleton(X0) = set_intersection2(X1,singleton(X0)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( singleton(X0) = set_intersection2(X1,singleton(X0))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( in(X0,X1)
=> singleton(X0) = set_intersection2(X1,singleton(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_zfmisc_1) ).
fof(f50,plain,
set_intersection2(unordered_pair(sK1,sK2),singleton(sK2)) != singleton(sK2),
inference(superposition,[],[f49,f32]) ).
fof(f32,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f49,plain,
set_intersection2(singleton(sK2),unordered_pair(sK1,sK2)) != singleton(sK2),
inference(forward_demodulation,[],[f33,f35]) ).
fof(f35,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f33,plain,
set_intersection2(singleton(sK2),unordered_pair(sK2,sK1)) != singleton(sK2),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
set_intersection2(singleton(sK2),unordered_pair(sK2,sK1)) != singleton(sK2),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1] : set_intersection2(singleton(X1),unordered_pair(X1,X0)) != singleton(X1)
=> set_intersection2(singleton(sK2),unordered_pair(sK2,sK1)) != singleton(sK2) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] : set_intersection2(singleton(X1),unordered_pair(X1,X0)) != singleton(X1),
inference(rectify,[],[f16]) ).
fof(f16,plain,
? [X1,X0] : singleton(X0) != set_intersection2(singleton(X0),unordered_pair(X0,X1)),
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] : singleton(X0) = set_intersection2(singleton(X0),unordered_pair(X0,X1)),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X1] : singleton(X0) = set_intersection2(singleton(X0),unordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_zfmisc_1) ).
fof(f45,plain,
! [X1,X4] : in(X4,unordered_pair(X1,X4)),
inference(equality_resolution,[],[f44]) ).
fof(f44,plain,
! [X0,X1,X4] :
( in(X4,X0)
| unordered_pair(X1,X4) != X0 ),
inference(equality_resolution,[],[f38]) ).
fof(f38,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| X2 != X4
| unordered_pair(X1,X2) != X0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( unordered_pair(X1,X2) = X0
| ( ( ( sK3(X0,X1,X2) != X2
& sK3(X0,X1,X2) != X1 )
| ~ in(sK3(X0,X1,X2),X0) )
& ( sK3(X0,X1,X2) = X2
| sK3(X0,X1,X2) = X1
| in(sK3(X0,X1,X2),X0) ) ) )
& ( ! [X4] :
( ( in(X4,X0)
| ( X2 != X4
& X1 != X4 ) )
& ( X2 = X4
| X1 = X4
| ~ in(X4,X0) ) )
| unordered_pair(X1,X2) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f25,f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X2 != X3
& X1 != X3 )
| ~ in(X3,X0) )
& ( X2 = X3
| X1 = X3
| in(X3,X0) ) )
=> ( ( ( sK3(X0,X1,X2) != X2
& sK3(X0,X1,X2) != X1 )
| ~ in(sK3(X0,X1,X2),X0) )
& ( sK3(X0,X1,X2) = X2
| sK3(X0,X1,X2) = X1
| in(sK3(X0,X1,X2),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( unordered_pair(X1,X2) = X0
| ? [X3] :
( ( ( X2 != X3
& X1 != X3 )
| ~ in(X3,X0) )
& ( X2 = X3
| X1 = X3
| in(X3,X0) ) ) )
& ( ! [X4] :
( ( in(X4,X0)
| ( X2 != X4
& X1 != X4 ) )
& ( X2 = X4
| X1 = X4
| ~ in(X4,X0) ) )
| unordered_pair(X1,X2) != X0 ) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X2,X0,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.04/0.12 % Problem : SET878+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.14/0.34 % Computer : n027.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.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 14:43:16 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.51 % (8973)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.51 % (8972)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.51 % (8989)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.52 % (8973)Refutation not found, incomplete strategy% (8973)------------------------------
% 0.21/0.52 % (8973)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (8989)First to succeed.
% 0.21/0.52 % (8973)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (8973)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.52
% 0.21/0.52 % (8973)Memory used [KB]: 5884
% 0.21/0.52 % (8973)Time elapsed: 0.103 s
% 0.21/0.52 % (8973)Instructions burned: 2 (million)
% 0.21/0.52 % (8973)------------------------------
% 0.21/0.52 % (8973)------------------------------
% 0.21/0.52 % (8989)Refutation found. Thanks to Tanya!
% 0.21/0.52 % SZS status Theorem for theBenchmark
% 0.21/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52 % (8989)------------------------------
% 0.21/0.52 % (8989)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (8989)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (8989)Termination reason: Refutation
% 0.21/0.52
% 0.21/0.52 % (8989)Memory used [KB]: 1407
% 0.21/0.52 % (8989)Time elapsed: 0.108 s
% 0.21/0.52 % (8989)Instructions burned: 3 (million)
% 0.21/0.52 % (8989)------------------------------
% 0.21/0.52 % (8989)------------------------------
% 0.21/0.52 % (8965)Success in time 0.167 s
%------------------------------------------------------------------------------