TSTP Solution File: SET917+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET917+1 : 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 : n017.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:22:44 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 41 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 21 ~; 9 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46,plain,
$false,
inference(subsumption_resolution,[],[f45,f38]) ).
fof(f38,plain,
in(sK0,sK1),
inference(resolution,[],[f28,f31]) ).
fof(f31,plain,
! [X0,X1] :
( disjoint(singleton(X1),X0)
| in(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( in(X1,X0)
| disjoint(singleton(X1),X0) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( in(X0,X1)
| disjoint(singleton(X0),X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(f28,plain,
~ disjoint(singleton(sK0),sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( singleton(sK0) != set_intersection2(singleton(sK0),sK1)
& ~ disjoint(singleton(sK0),sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1] :
( singleton(X0) != set_intersection2(singleton(X0),X1)
& ~ disjoint(singleton(X0),X1) )
=> ( singleton(sK0) != set_intersection2(singleton(sK0),sK1)
& ~ disjoint(singleton(sK0),sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1] :
( singleton(X0) != set_intersection2(singleton(X0),X1)
& ~ disjoint(singleton(X0),X1) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
? [X1,X0] :
( set_intersection2(singleton(X1),X0) != singleton(X1)
& ~ disjoint(singleton(X1),X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X1,X0] :
( disjoint(singleton(X1),X0)
| set_intersection2(singleton(X1),X0) = singleton(X1) ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X1,X0] :
( singleton(X0) = set_intersection2(singleton(X0),X1)
| disjoint(singleton(X0),X1) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X1,X0] :
( singleton(X0) = set_intersection2(singleton(X0),X1)
| disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t58_zfmisc_1) ).
fof(f45,plain,
~ in(sK0,sK1),
inference(trivial_inequality_removal,[],[f44]) ).
fof(f44,plain,
( ~ in(sK0,sK1)
| singleton(sK0) != singleton(sK0) ),
inference(superposition,[],[f40,f30]) ).
fof(f30,plain,
! [X0,X1] :
( singleton(X0) = set_intersection2(X1,singleton(X0))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( singleton(X0) = set_intersection2(X1,singleton(X0))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( in(X0,X1)
=> singleton(X0) = set_intersection2(X1,singleton(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_zfmisc_1) ).
fof(f40,plain,
set_intersection2(sK1,singleton(sK0)) != singleton(sK0),
inference(superposition,[],[f29,f36]) ).
fof(f36,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f29,plain,
singleton(sK0) != set_intersection2(singleton(sK0),sK1),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET917+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/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 : n017.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.35 % DateTime : Tue Aug 30 13:54:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (17470)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)
% 0.20/0.49 % (17468)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.49 % (17463)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50 % (17463)First to succeed.
% 0.20/0.50 % (17463)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (17463)------------------------------
% 0.20/0.50 % (17463)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (17463)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (17463)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (17463)Memory used [KB]: 5884
% 0.20/0.50 % (17463)Time elapsed: 0.100 s
% 0.20/0.50 % (17463)Instructions burned: 2 (million)
% 0.20/0.50 % (17463)------------------------------
% 0.20/0.50 % (17463)------------------------------
% 0.20/0.50 % (17458)Success in time 0.149 s
%------------------------------------------------------------------------------