TSTP Solution File: SEU144+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU144+1 : TPTP v8.1.0. Released v3.3.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 : n004.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:52 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 2 unt; 0 def)
% Number of atoms : 150 ( 31 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 169 ( 64 ~; 69 |; 23 &)
% ( 8 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 53 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f73,plain,
$false,
inference(avatar_sat_refutation,[],[f45,f46,f65,f72]) ).
fof(f72,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f71]) ).
fof(f71,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f69,f39]) ).
fof(f39,plain,
( subset(singleton(sK2),sK3)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl4_1
<=> subset(singleton(sK2),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f69,plain,
( ~ subset(singleton(sK2),sK3)
| spl4_2 ),
inference(unit_resulting_resolution,[],[f36,f44,f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f14]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) )
=> ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f44,plain,
( ~ in(sK2,sK3)
| spl4_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl4_2
<=> in(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f36,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X2,X0] :
( in(X2,X0)
| singleton(X2) != X0 ),
inference(equality_resolution,[],[f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( in(X2,X0)
| X1 != X2
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X1 = X2
| ~ in(X2,X0) )
& ( in(X2,X0)
| X1 != X2 ) )
| singleton(X1) != X0 )
& ( singleton(X1) = X0
| ( ( ~ in(sK1(X0,X1),X0)
| sK1(X0,X1) != X1 )
& ( in(sK1(X0,X1),X0)
| sK1(X0,X1) = X1 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f17,f18]) ).
fof(f18,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ in(X3,X0)
| X1 != X3 )
& ( in(X3,X0)
| X1 = X3 ) )
=> ( ( ~ in(sK1(X0,X1),X0)
| sK1(X0,X1) != X1 )
& ( in(sK1(X0,X1),X0)
| sK1(X0,X1) = X1 ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( ( X1 = X2
| ~ in(X2,X0) )
& ( in(X2,X0)
| X1 != X2 ) )
| singleton(X1) != X0 )
& ( singleton(X1) = X0
| ? [X3] :
( ( ~ in(X3,X0)
| X1 != X3 )
& ( in(X3,X0)
| X1 = X3 ) ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( ( ! [X2] :
( ( X0 = X2
| ~ in(X2,X1) )
& ( in(X2,X1)
| X0 != X2 ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) ) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ! [X2] :
( X0 = X2
<=> in(X2,X1) )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f65,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f64,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f62,f43]) ).
fof(f43,plain,
( in(sK2,sK3)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f62,plain,
( ~ in(sK2,sK3)
| spl4_1 ),
inference(backward_demodulation,[],[f50,f56]) ).
fof(f56,plain,
( sK0(singleton(sK2),sK3) = sK2
| spl4_1 ),
inference(unit_resulting_resolution,[],[f51,f34]) ).
fof(f34,plain,
! [X2,X1] :
( ~ in(X2,singleton(X1))
| X1 = X2 ),
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ in(X2,X0)
| singleton(X1) != X0 ),
inference(cnf_transformation,[],[f19]) ).
fof(f51,plain,
( in(sK0(singleton(sK2),sK3),singleton(sK2))
| spl4_1 ),
inference(unit_resulting_resolution,[],[f40,f24]) ).
fof(f24,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f40,plain,
( ~ subset(singleton(sK2),sK3)
| spl4_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f50,plain,
( ~ in(sK0(singleton(sK2),sK3),sK3)
| spl4_1 ),
inference(unit_resulting_resolution,[],[f40,f25]) ).
fof(f25,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f46,plain,
( spl4_2
| spl4_1 ),
inference(avatar_split_clause,[],[f31,f38,f42]) ).
fof(f31,plain,
( subset(singleton(sK2),sK3)
| in(sK2,sK3) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( ( ~ subset(singleton(sK2),sK3)
| ~ in(sK2,sK3) )
& ( subset(singleton(sK2),sK3)
| in(sK2,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1] :
( ( ~ subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( subset(singleton(X0),X1)
| in(X0,X1) ) )
=> ( ( ~ subset(singleton(sK2),sK3)
| ~ in(sK2,sK3) )
& ( subset(singleton(sK2),sK3)
| in(sK2,sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( ( ~ subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( subset(singleton(X0),X1)
| in(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
? [X0,X1] :
( in(X0,X1)
<~> subset(singleton(X0),X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X1,X0] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X1,X0] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f45,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f32,f42,f38]) ).
fof(f32,plain,
( ~ in(sK2,sK3)
| ~ subset(singleton(sK2),sK3) ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU144+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:40:34 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (26876)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.20/0.51 % (26891)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51 % (26884)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (26876)First to succeed.
% 0.20/0.52 % (26876)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 % (26876)------------------------------
% 0.20/0.52 % (26876)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (26876)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (26876)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (26876)Memory used [KB]: 6012
% 0.20/0.52 % (26876)Time elapsed: 0.109 s
% 0.20/0.52 % (26876)Instructions burned: 2 (million)
% 0.20/0.52 % (26876)------------------------------
% 0.20/0.52 % (26876)------------------------------
% 0.20/0.52 % (26872)Success in time 0.161 s
%------------------------------------------------------------------------------