TSTP Solution File: SEU117+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU117+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_sat --cores 0 -t %d %s
% Computer : n019.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:31:59 EDT 2022
% Result : Theorem 1.28s 0.52s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 50 ( 14 unt; 0 def)
% Number of atoms : 108 ( 5 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 96 ( 38 ~; 36 |; 6 &)
% ( 10 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 43 ( 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f884,plain,
$false,
inference(avatar_sat_refutation,[],[f356,f367,f534,f633,f878]) ).
fof(f878,plain,
( ~ spl15_10
| ~ spl15_19 ),
inference(avatar_contradiction_clause,[],[f874]) ).
fof(f874,plain,
( $false
| ~ spl15_10
| ~ spl15_19 ),
inference(resolution,[],[f870,f135]) ).
fof(f135,plain,
~ element(sK10,sF13),
inference(definition_folding,[],[f123,f134]) ).
fof(f134,plain,
sF13 = powerset(sK11),
introduced(function_definition,[]) ).
fof(f123,plain,
~ element(sK10,powerset(sK11)),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
? [X0,X1] :
( ~ element(X0,powerset(X1))
& element(X0,finite_subsets(X1)) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
~ ! [X0,X1] :
( element(X0,finite_subsets(X1))
=> element(X0,powerset(X1)) ),
inference(rectify,[],[f32]) ).
fof(f32,negated_conjecture,
~ ! [X1,X0] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
inference(negated_conjecture,[],[f31]) ).
fof(f31,conjecture,
! [X1,X0] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_finsub_1) ).
fof(f870,plain,
( element(sK10,sF13)
| ~ spl15_10
| ~ spl15_19 ),
inference(resolution,[],[f864,f267]) ).
fof(f267,plain,
! [X0] :
( ~ subset(X0,sK11)
| element(X0,sF13) ),
inference(superposition,[],[f130,f134]) ).
fof(f130,plain,
! [X0,X1] :
( element(X1,powerset(X0))
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X1,X0] :
( subset(X1,X0)
<=> element(X1,powerset(X0)) ),
inference(rectify,[],[f28]) ).
fof(f28,axiom,
! [X1,X0] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f864,plain,
( subset(sK10,sK11)
| ~ spl15_10
| ~ spl15_19 ),
inference(resolution,[],[f632,f355]) ).
fof(f355,plain,
( in(sK10,sF14)
| ~ spl15_10 ),
inference(avatar_component_clause,[],[f353]) ).
fof(f353,plain,
( spl15_10
<=> in(sK10,sF14) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_10])]) ).
fof(f632,plain,
( ! [X0] :
( ~ in(X0,sF14)
| subset(X0,sK11) )
| ~ spl15_19 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f631,plain,
( spl15_19
<=> ! [X0] :
( ~ in(X0,sF14)
| subset(X0,sK11) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_19])]) ).
fof(f633,plain,
( ~ spl15_15
| spl15_19 ),
inference(avatar_split_clause,[],[f617,f631,f525]) ).
fof(f525,plain,
( spl15_15
<=> preboolean(sF14) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_15])]) ).
fof(f617,plain,
! [X0] :
( ~ in(X0,sF14)
| ~ preboolean(sF14)
| subset(X0,sK11) ),
inference(superposition,[],[f133,f136]) ).
fof(f136,plain,
finite_subsets(sK11) = sF14,
introduced(function_definition,[]) ).
fof(f133,plain,
! [X2,X0] :
( ~ in(X2,finite_subsets(X0))
| ~ preboolean(finite_subsets(X0))
| subset(X2,X0) ),
inference(equality_resolution,[],[f96]) ).
fof(f96,plain,
! [X2,X0,X1] :
( finite_subsets(X0) != X1
| subset(X2,X0)
| ~ in(X2,X1)
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0,X1] :
( ~ preboolean(X1)
| ( ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) )
<=> finite_subsets(X0) = X1 ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,axiom,
! [X1,X0] :
( preboolean(X1)
=> ( ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) )
<=> finite_subsets(X0) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f534,plain,
spl15_15,
inference(avatar_contradiction_clause,[],[f533]) ).
fof(f533,plain,
( $false
| spl15_15 ),
inference(resolution,[],[f527,f154]) ).
fof(f154,plain,
preboolean(sF14),
inference(superposition,[],[f128,f136]) ).
fof(f128,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f527,plain,
( ~ preboolean(sF14)
| spl15_15 ),
inference(avatar_component_clause,[],[f525]) ).
fof(f367,plain,
~ spl15_9,
inference(avatar_contradiction_clause,[],[f363]) ).
fof(f363,plain,
( $false
| ~ spl15_9 ),
inference(resolution,[],[f351,f156]) ).
fof(f156,plain,
~ empty(sF14),
inference(superposition,[],[f80,f136]) ).
fof(f80,plain,
! [X0] : ~ empty(finite_subsets(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0] :
( diff_closed(finite_subsets(X0))
& ~ empty(finite_subsets(X0))
& preboolean(finite_subsets(X0))
& cup_closed(finite_subsets(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_finsub_1) ).
fof(f351,plain,
( empty(sF14)
| ~ spl15_9 ),
inference(avatar_component_clause,[],[f349]) ).
fof(f349,plain,
( spl15_9
<=> empty(sF14) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_9])]) ).
fof(f356,plain,
( spl15_9
| spl15_10 ),
inference(avatar_split_clause,[],[f331,f353,f349]) ).
fof(f331,plain,
( in(sK10,sF14)
| empty(sF14) ),
inference(resolution,[],[f110,f137]) ).
fof(f137,plain,
element(sK10,sF14),
inference(definition_folding,[],[f122,f136]) ).
fof(f122,plain,
element(sK10,finite_subsets(sK11)),
inference(cnf_transformation,[],[f64]) ).
fof(f110,plain,
! [X0,X1] :
( ~ element(X1,X0)
| empty(X0)
| in(X1,X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X1,X0] :
( empty(X0)
| in(X1,X0)
| ~ element(X1,X0) ),
inference(flattening,[],[f56]) ).
fof(f56,plain,
! [X1,X0] :
( empty(X0)
| in(X1,X0)
| ~ element(X1,X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
! [X1,X0] :
( element(X1,X0)
=> ( empty(X0)
| in(X1,X0) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 14:42:35 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.49 % (30960)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.50 % (30968)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (30959)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (30960)First to succeed.
% 1.28/0.52 % (30960)Refutation found. Thanks to Tanya!
% 1.28/0.52 % SZS status Theorem for theBenchmark
% 1.28/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.28/0.52 % (30960)------------------------------
% 1.28/0.52 % (30960)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.28/0.52 % (30960)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.28/0.52 % (30960)Termination reason: Refutation
% 1.28/0.52
% 1.28/0.52 % (30960)Memory used [KB]: 5756
% 1.28/0.52 % (30960)Time elapsed: 0.095 s
% 1.28/0.52 % (30960)Instructions burned: 17 (million)
% 1.28/0.52 % (30960)------------------------------
% 1.28/0.52 % (30960)------------------------------
% 1.28/0.52 % (30948)Success in time 0.165 s
%------------------------------------------------------------------------------