TSTP Solution File: SEU139+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU139+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 : 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:26:50 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 60 ( 11 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 63 ( 28 ~; 15 |; 16 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 35 ( 29 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f48,plain,
$false,
inference(subsumption_resolution,[],[f47,f37]) ).
fof(f37,plain,
! [X1] : ~ proper_subset(X1,X1),
inference(equality_resolution,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( X0 != X1
| ~ proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 )
& ( ( subset(X0,X1)
& X0 != X1 )
| ~ proper_subset(X0,X1) ) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( ( proper_subset(X1,X0)
| ~ subset(X1,X0)
| X0 = X1 )
& ( ( subset(X1,X0)
& X0 != X1 )
| ~ proper_subset(X1,X0) ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( ( proper_subset(X1,X0)
| ~ subset(X1,X0)
| X0 = X1 )
& ( ( subset(X1,X0)
& X0 != X1 )
| ~ proper_subset(X1,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X1,X0] :
( proper_subset(X1,X0)
<=> ( subset(X1,X0)
& X0 != X1 ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( proper_subset(X0,X1)
<=> ( subset(X0,X1)
& X0 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f47,plain,
proper_subset(sK0,sK0),
inference(backward_demodulation,[],[f31,f43]) ).
fof(f43,plain,
sK0 = sK1,
inference(unit_resulting_resolution,[],[f30,f40,f28]) ).
fof(f28,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| proper_subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f40,plain,
~ proper_subset(sK0,sK1),
inference(unit_resulting_resolution,[],[f31,f29]) ).
fof(f29,plain,
! [X0,X1] :
( ~ proper_subset(X1,X0)
| ~ proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| ~ proper_subset(X1,X0) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1,X0] :
( ~ proper_subset(X1,X0)
| ~ proper_subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( proper_subset(X0,X1)
=> ~ proper_subset(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_xboole_0) ).
fof(f30,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( proper_subset(sK1,sK0)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f19,f20]) ).
fof(f20,plain,
( ? [X0,X1] :
( proper_subset(X1,X0)
& subset(X0,X1) )
=> ( proper_subset(sK1,sK0)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0,X1] :
( proper_subset(X1,X0)
& subset(X0,X1) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
? [X1,X0] :
( proper_subset(X0,X1)
& subset(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1] :
~ ( proper_subset(X0,X1)
& subset(X1,X0) ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X1,X0] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X1,X0] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f31,plain,
proper_subset(sK1,sK0),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU139+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.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 14:39:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.50 % (1615)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.20/0.51 % (1631)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.51 % (1615)First to succeed.
% 0.20/0.51 % (1615)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (1615)------------------------------
% 0.20/0.52 % (1615)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (1615)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (1615)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (1615)Memory used [KB]: 5884
% 0.20/0.52 % (1615)Time elapsed: 0.110 s
% 0.20/0.52 % (1615)Instructions burned: 1 (million)
% 0.20/0.52 % (1615)------------------------------
% 0.20/0.52 % (1615)------------------------------
% 0.20/0.52 % (1605)Success in time 0.161 s
%------------------------------------------------------------------------------