TSTP Solution File: SEU134+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU134+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:49 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 48 ( 24 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 48 ( 19 ~; 16 |; 6 &)
% ( 5 <=>; 1 =>; 0 <=; 1 <~>)
% 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 16 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(subsumption_resolution,[],[f50,f48]) ).
fof(f48,plain,
empty_set != set_difference(sK0,sK1),
inference(subsumption_resolution,[],[f41,f38]) ).
fof(f38,plain,
! [X0,X1] :
( empty_set != set_difference(X1,X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X1,X0)
| empty_set != set_difference(X1,X0) )
& ( empty_set = set_difference(X1,X0)
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( subset(X1,X0)
<=> empty_set = set_difference(X1,X0) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X1,X0] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f41,plain,
( empty_set != set_difference(sK0,sK1)
| ~ subset(sK0,sK1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
( ( ~ subset(sK0,sK1)
| empty_set != set_difference(sK0,sK1) )
& ( subset(sK0,sK1)
| empty_set = set_difference(sK0,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f28,f29]) ).
fof(f29,plain,
( ? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| empty_set = set_difference(X0,X1) ) )
=> ( ( ~ subset(sK0,sK1)
| empty_set != set_difference(sK0,sK1) )
& ( subset(sK0,sK1)
| empty_set = set_difference(sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| empty_set = set_difference(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
? [X1,X0] :
( ( ~ subset(X1,X0)
| empty_set != set_difference(X1,X0) )
& ( subset(X1,X0)
| empty_set = set_difference(X1,X0) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
? [X1,X0] :
( empty_set = set_difference(X1,X0)
<~> subset(X1,X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X1,X0] :
( empty_set = set_difference(X1,X0)
<=> subset(X1,X0) ),
inference(rectify,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X1,X0] :
( subset(X0,X1)
<=> empty_set = set_difference(X0,X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X1,X0] :
( subset(X0,X1)
<=> empty_set = set_difference(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f50,plain,
empty_set = set_difference(sK0,sK1),
inference(unit_resulting_resolution,[],[f49,f37]) ).
fof(f37,plain,
! [X0,X1] :
( empty_set = set_difference(X1,X0)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f49,plain,
subset(sK0,sK1),
inference(subsumption_resolution,[],[f40,f48]) ).
fof(f40,plain,
( subset(sK0,sK1)
| empty_set = set_difference(sK0,sK1) ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU134+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/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.35 % Computer : n013.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:37:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.55 % (27641)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.55 % (27642)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.55 % (27641)First to succeed.
% 0.20/0.56 % (27642)Also succeeded, but the first one will report.
% 0.20/0.56 % (27641)Refutation found. Thanks to Tanya!
% 0.20/0.56 % SZS status Theorem for theBenchmark
% 0.20/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56 % (27641)------------------------------
% 0.20/0.56 % (27641)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (27641)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (27641)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56 % (27641)Memory used [KB]: 5884
% 0.20/0.56 % (27641)Time elapsed: 0.128 s
% 0.20/0.56 % (27641)Instructions burned: 1 (million)
% 0.20/0.56 % (27641)------------------------------
% 0.20/0.56 % (27641)------------------------------
% 0.20/0.56 % (27633)Success in time 0.197 s
%------------------------------------------------------------------------------