TSTP Solution File: SET691+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET691+4 : 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 : n029.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:54 EDT 2022
% Result : Theorem 0.22s 0.55s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 5 unt; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 131 ( 51 ~; 48 |; 20 &)
% ( 8 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 40 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f67,plain,
$false,
inference(avatar_sat_refutation,[],[f45,f46,f49,f66]) ).
fof(f66,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_contradiction_clause,[],[f65]) ).
fof(f65,plain,
( $false
| ~ spl2_1
| spl2_2 ),
inference(subsumption_resolution,[],[f62,f44]) ).
fof(f44,plain,
( ~ equal_set(sK1,empty_set)
| spl2_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl2_2
<=> equal_set(sK1,empty_set) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f62,plain,
( equal_set(sK1,empty_set)
| ~ spl2_1 ),
inference(resolution,[],[f54,f39]) ).
fof(f39,plain,
( subset(sK1,empty_set)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl2_1
<=> subset(sK1,empty_set) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f54,plain,
! [X0] :
( ~ subset(X0,empty_set)
| equal_set(X0,empty_set) ),
inference(resolution,[],[f28,f50]) ).
fof(f50,plain,
! [X0] : subset(empty_set,X0),
inference(resolution,[],[f32,f36]) ).
fof(f36,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] : ~ member(X0,empty_set),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X2] : ~ member(X2,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set) ).
fof(f32,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( ~ member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) ) )
& ( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f22,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) )
=> ( ~ member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) )
& ( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f28,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| equal_set(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) )
& ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X1,X0) )
& ( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X1,X0) )
& ( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> equal_set(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> equal_set(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f49,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f48]) ).
fof(f48,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f47,f40]) ).
fof(f40,plain,
( ~ subset(sK1,empty_set)
| spl2_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f47,plain,
( subset(sK1,empty_set)
| ~ spl2_2 ),
inference(resolution,[],[f29,f43]) ).
fof(f43,plain,
( equal_set(sK1,empty_set)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f29,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f46,plain,
( spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f34,f38,f42]) ).
fof(f34,plain,
( subset(sK1,empty_set)
| equal_set(sK1,empty_set) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ( ~ equal_set(sK1,empty_set)
| ~ subset(sK1,empty_set) )
& ( equal_set(sK1,empty_set)
| subset(sK1,empty_set) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f25,f26]) ).
fof(f26,plain,
( ? [X0] :
( ( ~ equal_set(X0,empty_set)
| ~ subset(X0,empty_set) )
& ( equal_set(X0,empty_set)
| subset(X0,empty_set) ) )
=> ( ( ~ equal_set(sK1,empty_set)
| ~ subset(sK1,empty_set) )
& ( equal_set(sK1,empty_set)
| subset(sK1,empty_set) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
? [X0] :
( ( ~ equal_set(X0,empty_set)
| ~ subset(X0,empty_set) )
& ( equal_set(X0,empty_set)
| subset(X0,empty_set) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
? [X0] :
( subset(X0,empty_set)
<~> equal_set(X0,empty_set) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0] :
( equal_set(X0,empty_set)
<=> subset(X0,empty_set) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0] :
( equal_set(X0,empty_set)
<=> subset(X0,empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI16) ).
fof(f45,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f35,f42,f38]) ).
fof(f35,plain,
( ~ equal_set(sK1,empty_set)
| ~ subset(sK1,empty_set) ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET691+4 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.15 % 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.37 % Computer : n029.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Aug 30 14:31:27 EDT 2022
% 0.15/0.38 % CPUTime :
% 0.22/0.53 % (7512)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.22/0.53 % (7530)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.54 % (7514)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.22/0.54 % (7512)First to succeed.
% 0.22/0.54 % (7521)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.54 % (7525)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.22/0.55 % (7515)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.22/0.55 % (7515)Also succeeded, but the first one will report.
% 0.22/0.55 % (7512)Refutation found. Thanks to Tanya!
% 0.22/0.55 % SZS status Theorem for theBenchmark
% 0.22/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.55 % (7512)------------------------------
% 0.22/0.55 % (7512)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.55 % (7512)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.55 % (7512)Termination reason: Refutation
% 0.22/0.55
% 0.22/0.55 % (7512)Memory used [KB]: 5884
% 0.22/0.55 % (7512)Time elapsed: 0.102 s
% 0.22/0.55 % (7512)Instructions burned: 2 (million)
% 0.22/0.55 % (7512)------------------------------
% 0.22/0.55 % (7512)------------------------------
% 0.22/0.55 % (7505)Success in time 0.164 s
%------------------------------------------------------------------------------