TSTP Solution File: SET597+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET597+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_sat --cores 0 -t %d %s
% Computer : n007.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:25:02 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 77 ( 13 unt; 0 def)
% Number of atoms : 208 ( 29 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 218 ( 87 ~; 92 |; 17 &)
% ( 15 <=>; 5 =>; 0 <=; 2 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 55 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f300,plain,
$false,
inference(avatar_sat_refutation,[],[f73,f77,f82,f83,f88,f89,f92,f104,f209,f215,f259,f262,f268,f299]) ).
fof(f299,plain,
( spl7_25
| ~ spl7_4
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f288,f58,f70,f265]) ).
fof(f265,plain,
( spl7_25
<=> subset(sF6,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_25])]) ).
fof(f70,plain,
( spl7_4
<=> subset(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f58,plain,
( spl7_1
<=> subset(sK2,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f288,plain,
( ~ subset(sK0,sK1)
| subset(sF6,sK1)
| ~ spl7_1 ),
inference(resolution,[],[f203,f59]) ).
fof(f59,plain,
( subset(sK2,sK1)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f203,plain,
! [X0] :
( ~ subset(sK2,X0)
| subset(sF6,X0)
| ~ subset(sK0,X0) ),
inference(superposition,[],[f43,f50]) ).
fof(f50,plain,
sF6 = union(sK2,sK0),
introduced(function_definition,[]) ).
fof(f43,plain,
! [X2,X0,X1] :
( subset(union(X2,X1),X0)
| ~ subset(X1,X0)
| ~ subset(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X2,X0] :
( ~ subset(X1,X0)
| ~ subset(X2,X0)
| subset(union(X2,X1),X0) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X1,X2,X0] :
( subset(union(X2,X1),X0)
| ~ subset(X1,X0)
| ~ subset(X2,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X2,X0] :
( ( subset(X1,X0)
& subset(X2,X0) )
=> subset(union(X2,X1),X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X2,X0] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(union(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_subset) ).
fof(f268,plain,
( spl7_3
| ~ spl7_25
| ~ spl7_24 ),
inference(avatar_split_clause,[],[f263,f256,f265,f66]) ).
fof(f66,plain,
( spl7_3
<=> sF6 = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f256,plain,
( spl7_24
<=> subset(sK1,sF6) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_24])]) ).
fof(f263,plain,
( ~ subset(sF6,sK1)
| sF6 = sK1
| ~ spl7_24 ),
inference(resolution,[],[f258,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f258,plain,
( subset(sK1,sF6)
| ~ spl7_24 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f262,plain,
spl7_23,
inference(avatar_contradiction_clause,[],[f260]) ).
fof(f260,plain,
( $false
| spl7_23 ),
inference(resolution,[],[f105,f254]) ).
fof(f254,plain,
( ~ subset(sK0,sF6)
| spl7_23 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f252,plain,
( spl7_23
<=> subset(sK0,sF6) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_23])]) ).
fof(f105,plain,
subset(sK0,sF6),
inference(superposition,[],[f95,f50]) ).
fof(f95,plain,
! [X0,X1] : subset(X0,union(X1,X0)),
inference(superposition,[],[f44,f45]) ).
fof(f45,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f44,plain,
! [X0,X1] : subset(X1,union(X1,X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X1,X0] : subset(X1,union(X1,X0)),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] : subset(X0,union(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_union) ).
fof(f259,plain,
( ~ spl7_23
| spl7_24
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f249,f75,f256,f252]) ).
fof(f75,plain,
( spl7_5
<=> ! [X3] :
( ~ subset(sK2,X3)
| ~ subset(sK0,X3)
| subset(sK1,X3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f249,plain,
( subset(sK1,sF6)
| ~ subset(sK0,sF6)
| ~ spl7_5 ),
inference(resolution,[],[f90,f76]) ).
fof(f76,plain,
( ! [X3] :
( ~ subset(sK2,X3)
| ~ subset(sK0,X3)
| subset(sK1,X3) )
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f90,plain,
subset(sK2,sF6),
inference(superposition,[],[f44,f50]) ).
fof(f215,plain,
( ~ spl7_2
| spl7_7
| ~ spl7_5
| ~ spl7_6 ),
inference(avatar_split_clause,[],[f211,f79,f75,f85,f62]) ).
fof(f62,plain,
( spl7_2
<=> subset(sK0,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f85,plain,
( spl7_7
<=> subset(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_7])]) ).
fof(f79,plain,
( spl7_6
<=> subset(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f211,plain,
( subset(sK1,sK3)
| ~ subset(sK0,sK3)
| ~ spl7_5
| ~ spl7_6 ),
inference(resolution,[],[f76,f81]) ).
fof(f81,plain,
( subset(sK2,sK3)
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f209,plain,
( spl7_5
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f206,f66,f75]) ).
fof(f206,plain,
( ! [X7] :
( subset(sK1,X7)
| ~ subset(sK2,X7)
| ~ subset(sK0,X7) )
| ~ spl7_3 ),
inference(superposition,[],[f43,f99]) ).
fof(f99,plain,
( union(sK0,sK2) = sK1
| ~ spl7_3 ),
inference(forward_demodulation,[],[f98,f67]) ).
fof(f67,plain,
( sF6 = sK1
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f98,plain,
sF6 = union(sK0,sK2),
inference(superposition,[],[f50,f45]) ).
fof(f104,plain,
( spl7_4
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f103,f66,f70]) ).
fof(f103,plain,
( subset(sK0,sK1)
| ~ spl7_3 ),
inference(superposition,[],[f44,f99]) ).
fof(f92,plain,
( spl7_1
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f91,f66,f58]) ).
fof(f91,plain,
( subset(sK2,sK1)
| ~ spl7_3 ),
inference(forward_demodulation,[],[f90,f67]) ).
fof(f89,plain,
( spl7_3
| spl7_4 ),
inference(avatar_split_clause,[],[f52,f70,f66]) ).
fof(f52,plain,
( subset(sK0,sK1)
| sF6 = sK1 ),
inference(definition_folding,[],[f27,f50]) ).
fof(f27,plain,
( subset(sK0,sK1)
| union(sK2,sK0) = sK1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
? [X0,X1,X2] :
( union(X2,X0) = X1
<~> ( ! [X3] :
( ~ subset(X0,X3)
| subset(X1,X3)
| ~ subset(X2,X3) )
& subset(X2,X1)
& subset(X0,X1) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
? [X1,X2,X0] :
( union(X2,X0) = X1
<~> ( ! [X3] :
( subset(X1,X3)
| ~ subset(X2,X3)
| ~ subset(X0,X3) )
& subset(X2,X1)
& subset(X0,X1) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X1,X2,X0] :
( union(X2,X0) = X1
<=> ( ! [X3] :
( ( subset(X2,X3)
& subset(X0,X3) )
=> subset(X1,X3) )
& subset(X2,X1)
& subset(X0,X1) ) ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X2,X0,X1] :
( union(X1,X2) = X0
<=> ( subset(X1,X0)
& subset(X2,X0)
& ! [X3] :
( ( subset(X1,X3)
& subset(X2,X3) )
=> subset(X0,X3) ) ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X2,X0,X1] :
( union(X1,X2) = X0
<=> ( subset(X1,X0)
& subset(X2,X0)
& ! [X3] :
( ( subset(X1,X3)
& subset(X2,X3) )
=> subset(X0,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th56) ).
fof(f88,plain,
( ~ spl7_7
| ~ spl7_1
| ~ spl7_3
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f54,f70,f66,f58,f85]) ).
fof(f54,plain,
( ~ subset(sK0,sK1)
| sF6 != sK1
| ~ subset(sK2,sK1)
| ~ subset(sK1,sK3) ),
inference(definition_folding,[],[f25,f50]) ).
fof(f25,plain,
( ~ subset(sK0,sK1)
| ~ subset(sK2,sK1)
| ~ subset(sK1,sK3)
| union(sK2,sK0) != sK1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f83,plain,
( spl7_3
| spl7_1 ),
inference(avatar_split_clause,[],[f51,f58,f66]) ).
fof(f51,plain,
( subset(sK2,sK1)
| sF6 = sK1 ),
inference(definition_folding,[],[f28,f50]) ).
fof(f28,plain,
( subset(sK2,sK1)
| union(sK2,sK0) = sK1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f82,plain,
( ~ spl7_1
| spl7_6
| ~ spl7_3
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f55,f70,f66,f79,f58]) ).
fof(f55,plain,
( ~ subset(sK0,sK1)
| sF6 != sK1
| subset(sK2,sK3)
| ~ subset(sK2,sK1) ),
inference(definition_folding,[],[f24,f50]) ).
fof(f24,plain,
( ~ subset(sK0,sK1)
| ~ subset(sK2,sK1)
| subset(sK2,sK3)
| union(sK2,sK0) != sK1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f77,plain,
( spl7_3
| spl7_5 ),
inference(avatar_split_clause,[],[f56,f75,f66]) ).
fof(f56,plain,
! [X3] :
( ~ subset(sK2,X3)
| sF6 = sK1
| subset(sK1,X3)
| ~ subset(sK0,X3) ),
inference(definition_folding,[],[f23,f50]) ).
fof(f23,plain,
! [X3] :
( ~ subset(sK2,X3)
| subset(sK1,X3)
| ~ subset(sK0,X3)
| union(sK2,sK0) = sK1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f73,plain,
( ~ spl7_1
| spl7_2
| ~ spl7_3
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f53,f70,f66,f62,f58]) ).
fof(f53,plain,
( ~ subset(sK0,sK1)
| sF6 != sK1
| subset(sK0,sK3)
| ~ subset(sK2,sK1) ),
inference(definition_folding,[],[f26,f50]) ).
fof(f26,plain,
( ~ subset(sK0,sK1)
| ~ subset(sK2,sK1)
| subset(sK0,sK3)
| union(sK2,sK0) != sK1 ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET597+3 : TPTP v8.1.0. Released v2.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.13/0.34 % Computer : n007.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 13:46:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 % (30901)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.47 TRYING [1]
% 0.20/0.47 TRYING [2]
% 0.20/0.47 TRYING [3]
% 0.20/0.48 TRYING [4]
% 0.20/0.48 TRYING [5]
% 0.20/0.48 % (30909)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.50 % (30899)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (30901)Instruction limit reached!
% 0.20/0.50 % (30901)------------------------------
% 0.20/0.50 % (30901)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (30901)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (30901)Termination reason: Unknown
% 0.20/0.50 % (30901)Termination phase: Finite model building SAT solving
% 0.20/0.50
% 0.20/0.50 % (30901)Memory used [KB]: 7164
% 0.20/0.50 % (30901)Time elapsed: 0.089 s
% 0.20/0.50 % (30901)Instructions burned: 53 (million)
% 0.20/0.50 % (30901)------------------------------
% 0.20/0.50 % (30901)------------------------------
% 0.20/0.51 % (30915)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.51 % (30918)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.51 % (30895)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.51 % (30923)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.52 % (30896)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (30898)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (30896)Refutation not found, incomplete strategy% (30896)------------------------------
% 0.20/0.52 % (30896)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (30896)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (30896)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52
% 0.20/0.52 % (30896)Memory used [KB]: 5500
% 0.20/0.52 % (30896)Time elapsed: 0.122 s
% 0.20/0.52 % (30896)Instructions burned: 3 (million)
% 0.20/0.52 % (30896)------------------------------
% 0.20/0.52 % (30896)------------------------------
% 0.20/0.52 % (30907)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.52 % (30911)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 % (30898)First to succeed.
% 0.20/0.52 % (30905)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.53 % (30897)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.53 % (30898)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (30898)------------------------------
% 0.20/0.53 % (30898)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (30898)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (30898)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (30898)Memory used [KB]: 5500
% 0.20/0.53 % (30898)Time elapsed: 0.131 s
% 0.20/0.53 % (30898)Instructions burned: 7 (million)
% 0.20/0.53 % (30898)------------------------------
% 0.20/0.53 % (30898)------------------------------
% 0.20/0.53 % (30891)Success in time 0.177 s
%------------------------------------------------------------------------------