TSTP Solution File: SEU143+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU143+2 : 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 : 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:26:52 EDT 2022
% Result : Theorem 1.57s 0.58s
% Output : Refutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 79 ( 44 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 83 ( 35 ~; 29 |; 13 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 39 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f366,plain,
$false,
inference(subsumption_resolution,[],[f361,f275]) ).
fof(f275,plain,
empty(empty_set),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f361,plain,
~ empty(empty_set),
inference(superposition,[],[f346,f360]) ).
fof(f360,plain,
empty_set = unordered_pair(sK1,sK1),
inference(forward_demodulation,[],[f344,f345]) ).
fof(f345,plain,
empty_set = sF13,
inference(definition_folding,[],[f306,f344]) ).
fof(f306,plain,
empty_set = unordered_pair(sK1,sK1),
inference(definition_unfolding,[],[f229,f222]) ).
fof(f222,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f59]) ).
fof(f59,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f229,plain,
empty_set = singleton(sK1),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
empty_set = singleton(sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f126,f146]) ).
fof(f146,plain,
( ? [X0] : singleton(X0) = empty_set
=> empty_set = singleton(sK1) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
? [X0] : singleton(X0) = empty_set,
inference(ennf_transformation,[],[f29]) ).
fof(f29,negated_conjecture,
~ ! [X0] : singleton(X0) != empty_set,
inference(negated_conjecture,[],[f28]) ).
fof(f28,conjecture,
! [X0] : singleton(X0) != empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f344,plain,
sF13 = unordered_pair(sK1,sK1),
introduced(function_definition,[]) ).
fof(f346,plain,
! [X0] : ~ empty(unordered_pair(X0,X0)),
inference(resolution,[],[f211,f328]) ).
fof(f328,plain,
! [X3] : in(X3,unordered_pair(X3,X3)),
inference(equality_resolution,[],[f327]) ).
fof(f327,plain,
! [X3,X1] :
( in(X3,X1)
| unordered_pair(X3,X3) != X1 ),
inference(equality_resolution,[],[f310]) ).
fof(f310,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f230,f222]) ).
fof(f230,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( ~ in(sK2(X0,X1),X1)
| sK2(X0,X1) != X0 )
& ( in(sK2(X0,X1),X1)
| sK2(X0,X1) = X0 ) ) )
& ( ! [X3] :
( ( X0 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| X0 != X3 ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f149,f150]) ).
fof(f150,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) )
=> ( ( ~ in(sK2(X0,X1),X1)
| sK2(X0,X1) != X0 )
& ( in(sK2(X0,X1),X1)
| sK2(X0,X1) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( ~ in(X2,X1)
| X0 != X2 )
& ( in(X2,X1)
| X0 = X2 ) ) )
& ( ! [X3] :
( ( X0 = X3
| ~ in(X3,X1) )
& ( in(X3,X1)
| X0 != X3 ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f148]) ).
fof(f148,plain,
! [X1,X0] :
( ( singleton(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| X1 != X2 )
& ( in(X2,X0)
| X1 = X2 ) ) )
& ( ! [X2] :
( ( X1 = X2
| ~ in(X2,X0) )
& ( in(X2,X0)
| X1 != X2 ) )
| singleton(X1) != X0 ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f86,plain,
! [X1,X0] :
( singleton(X1) = X0
<=> ! [X2] :
( X1 = X2
<=> in(X2,X0) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f211,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ empty(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0,X1] :
( ~ empty(X0)
| ~ in(X1,X0) ),
inference(ennf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1] :
~ ( in(X1,X0)
& empty(X0) ),
inference(rectify,[],[f61]) ).
fof(f61,axiom,
! [X1,X0] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU143+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/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.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 30 14:46:19 EDT 2022
% 0.15/0.36 % CPUTime :
% 1.32/0.56 % (3250)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.57/0.58 % (3271)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.57/0.58 % (3250)First to succeed.
% 1.57/0.58 % (3258)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)
% 1.57/0.58 % (3250)Refutation found. Thanks to Tanya!
% 1.57/0.58 % SZS status Theorem for theBenchmark
% 1.57/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.57/0.58 % (3250)------------------------------
% 1.57/0.58 % (3250)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.58 % (3250)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.58 % (3250)Termination reason: Refutation
% 1.57/0.58
% 1.57/0.58 % (3250)Memory used [KB]: 6140
% 1.57/0.58 % (3250)Time elapsed: 0.134 s
% 1.57/0.58 % (3250)Instructions burned: 5 (million)
% 1.57/0.58 % (3250)------------------------------
% 1.57/0.58 % (3250)------------------------------
% 1.57/0.58 % (3249)Success in time 0.219 s
%------------------------------------------------------------------------------