TSTP Solution File: SET602+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET602+3 : TPTP v8.1.0. Released v2.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 : n001.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:21:34 EDT 2022
% Result : Theorem 0.19s 0.57s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 34 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 16 ~; 10 |; 6 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,plain,
$false,
inference(unit_resulting_resolution,[],[f29,f25,f20]) ).
fof(f20,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| difference(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ( subset(X0,X1)
| difference(X0,X1) != empty_set )
& ( difference(X0,X1) = empty_set
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> difference(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_empty_set) ).
fof(f25,plain,
empty_set != difference(sK0,sK0),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
empty_set != difference(sK0,sK0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f15]) ).
fof(f15,plain,
( ? [X0] : empty_set != difference(X0,X0)
=> empty_set != difference(sK0,sK0) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0] : empty_set != difference(X0,X0),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0] : empty_set = difference(X0,X0),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0] : empty_set = difference(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_self_difference_is_empty_set) ).
fof(f29,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( subset(X1,X0)
| X0 != X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
<=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET602+3 : TPTP v8.1.0. Released v2.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.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:25:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54 % (31713)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.55 % (31721)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.19/0.55 % (31713)Refutation not found, incomplete strategy% (31713)------------------------------
% 0.19/0.55 % (31713)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (31713)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55 % (31713)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.55
% 0.19/0.55 % (31713)Memory used [KB]: 5884
% 0.19/0.55 % (31713)Time elapsed: 0.135 s
% 0.19/0.55 % (31713)Instructions burned: 2 (million)
% 0.19/0.55 % (31713)------------------------------
% 0.19/0.55 % (31713)------------------------------
% 0.19/0.55 % (31715)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.19/0.57 % (31716)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.57 % (31715)First to succeed.
% 0.19/0.57 % (31715)Refutation found. Thanks to Tanya!
% 0.19/0.57 % SZS status Theorem for theBenchmark
% 0.19/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.57 % (31715)------------------------------
% 0.19/0.57 % (31715)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (31715)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (31715)Termination reason: Refutation
% 0.19/0.57
% 0.19/0.57 % (31715)Memory used [KB]: 5884
% 0.19/0.57 % (31715)Time elapsed: 0.154 s
% 0.19/0.57 % (31715)Instructions burned: 2 (million)
% 0.19/0.57 % (31715)------------------------------
% 0.19/0.57 % (31715)------------------------------
% 0.19/0.57 % (31711)Success in time 0.222 s
%------------------------------------------------------------------------------