TSTP Solution File: SEU151+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU151+3 : 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 : n006.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:26:55 EDT 2022
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 124 ( 94 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 159 ( 65 ~; 48 |; 40 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 77 ( 61 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f60,plain,
$false,
inference(subsumption_resolution,[],[f59,f37]) ).
fof(f37,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f36]) ).
fof(f36,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f24]) ).
fof(f24,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK0(X0,X1,X2) != X0
& sK0(X0,X1,X2) != X1 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X0
| sK0(X0,X1,X2) = X1
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) )
=> ( ( ( sK0(X0,X1,X2) != X0
& sK0(X0,X1,X2) != X1 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X0
| sK0(X0,X1,X2) = X1
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1,X0,X2] :
( ( unordered_pair(X1,X0) = 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(X1,X0) != X2 ) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
! [X1,X0,X2] :
( ( unordered_pair(X1,X0) = 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(X1,X0) != X2 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1,X0,X2] :
( unordered_pair(X1,X0) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0,X2] :
( ! [X3] :
( ( X1 = X3
| X0 = X3 )
<=> in(X3,X2) )
<=> unordered_pair(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f59,plain,
~ in(sK4,unordered_pair(sK1,sK4)),
inference(forward_demodulation,[],[f56,f40]) ).
fof(f40,plain,
unordered_pair(sK1,sK4) = unordered_pair(sK2,sK3),
inference(forward_demodulation,[],[f39,f33]) ).
fof(f33,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f22]) ).
fof(f22,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(f39,plain,
unordered_pair(sK4,sK1) = unordered_pair(sK2,sK3),
inference(forward_demodulation,[],[f30,f33]) ).
fof(f30,plain,
unordered_pair(sK4,sK1) = unordered_pair(sK3,sK2),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( sK4 != sK3
& unordered_pair(sK4,sK1) = unordered_pair(sK3,sK2)
& sK4 != sK2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2,X3] :
( X2 != X3
& unordered_pair(X3,X0) = unordered_pair(X2,X1)
& X1 != X3 )
=> ( sK4 != sK3
& unordered_pair(sK4,sK1) = unordered_pair(sK3,sK2)
& sK4 != sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1,X2,X3] :
( X2 != X3
& unordered_pair(X3,X0) = unordered_pair(X2,X1)
& X1 != X3 ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
? [X3,X2,X1,X0] :
( X0 != X1
& unordered_pair(X0,X3) = unordered_pair(X1,X2)
& X0 != X2 ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1,X2,X3] :
~ ( X0 != X1
& unordered_pair(X0,X3) = unordered_pair(X1,X2)
& X0 != X2 ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X2,X3,X1] :
~ ( X0 != X3
& unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2 ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0,X2,X3,X1] :
~ ( X0 != X3
& unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f56,plain,
~ in(sK4,unordered_pair(sK2,sK3)),
inference(unit_resulting_resolution,[],[f29,f31,f38]) ).
fof(f38,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f23]) ).
fof(f23,plain,
! [X2,X0,X1,X4] :
( X0 = X4
| X1 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f31,plain,
sK4 != sK3,
inference(cnf_transformation,[],[f20]) ).
fof(f29,plain,
sK4 != sK2,
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU151+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % 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.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 16:08:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48 % (28599)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.48 % (28591)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.18/0.48 TRYING [1]
% 0.18/0.48 % (28599)Instruction limit reached!
% 0.18/0.48 % (28599)------------------------------
% 0.18/0.48 % (28599)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48 % (28599)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48 % (28599)Termination reason: Unknown
% 0.18/0.48 % (28599)Termination phase: Finite model building constraint generation
% 0.18/0.48
% 0.18/0.48 % (28599)Memory used [KB]: 5884
% 0.18/0.48 % (28599)Time elapsed: 0.087 s
% 0.18/0.48 % (28599)Instructions burned: 3 (million)
% 0.18/0.48 % (28599)------------------------------
% 0.18/0.48 % (28599)------------------------------
% 0.18/0.49 % (28591)First to succeed.
% 0.18/0.49 % (28604)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.18/0.49 % (28591)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (28591)------------------------------
% 0.18/0.49 % (28591)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (28591)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (28591)Termination reason: Refutation
% 0.18/0.49
% 0.18/0.49 % (28591)Memory used [KB]: 5884
% 0.18/0.49 % (28591)Time elapsed: 0.087 s
% 0.18/0.49 % (28591)Instructions burned: 3 (million)
% 0.18/0.49 % (28591)------------------------------
% 0.18/0.49 % (28591)------------------------------
% 0.18/0.49 % (28580)Success in time 0.148 s
%------------------------------------------------------------------------------