TSTP Solution File: KRS134+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KRS134+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n018.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 : Mon May 20 23:22:15 EDT 2024
% Result : Theorem 0.25s 0.42s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 60 ( 5 unt; 0 def)
% Number of atoms : 189 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 208 ( 79 ~; 75 |; 30 &)
% ( 11 <=>; 11 =>; 0 <=; 2 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 9 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 45 ( 25 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,plain,
$false,
inference(avatar_sat_refutation,[],[f39,f44,f66,f67,f69,f74,f76,f79,f83]) ).
fof(f83,plain,
( spl5_2
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f82]) ).
fof(f82,plain,
( $false
| spl5_2
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f81,f38]) ).
fof(f38,plain,
( ~ cA(sK2)
| spl5_2 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl5_2
<=> cA(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f81,plain,
( cA(sK2)
| ~ spl5_3 ),
inference(resolution,[],[f30,f43]) ).
fof(f43,plain,
( rprop(sK1,sK2)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f41,plain,
( spl5_3
<=> rprop(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f30,plain,
! [X0,X1] :
( ~ rprop(X0,X1)
| cA(X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( cA(X1)
| ~ rprop(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( rprop(X0,X1)
=> cA(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f79,plain,
( ~ spl5_7
| ~ spl5_8 ),
inference(avatar_contradiction_clause,[],[f78]) ).
fof(f78,plain,
( $false
| ~ spl5_7
| ~ spl5_8 ),
inference(subsumption_resolution,[],[f77,f60]) ).
fof(f60,plain,
( xsd_string(sK3)
| ~ spl5_7 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f59,plain,
( spl5_7
<=> xsd_string(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_7])]) ).
fof(f77,plain,
( ~ xsd_string(sK3)
| ~ spl5_8 ),
inference(resolution,[],[f65,f28]) ).
fof(f28,plain,
! [X0] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0] :
( ( xsd_string(X0)
| xsd_integer(X0) )
& ( ~ xsd_integer(X0)
| ~ xsd_string(X0) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f65,plain,
( xsd_integer(sK3)
| ~ spl5_8 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f63,plain,
( spl5_8
<=> xsd_integer(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_8])]) ).
fof(f76,plain,
~ spl5_6,
inference(avatar_contradiction_clause,[],[f75]) ).
fof(f75,plain,
( $false
| ~ spl5_6 ),
inference(subsumption_resolution,[],[f57,f27]) ).
fof(f27,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(f57,plain,
( cowlNothing(sK4)
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f55,plain,
( spl5_6
<=> cowlNothing(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).
fof(f74,plain,
( spl5_7
| spl5_8 ),
inference(avatar_split_clause,[],[f70,f63,f59]) ).
fof(f70,plain,
( xsd_string(sK3)
| spl5_8 ),
inference(resolution,[],[f29,f64]) ).
fof(f64,plain,
( ~ xsd_integer(sK3)
| spl5_8 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f29,plain,
! [X0] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f69,plain,
spl5_5,
inference(avatar_contradiction_clause,[],[f68]) ).
fof(f68,plain,
( $false
| spl5_5 ),
inference(resolution,[],[f26,f53]) ).
fof(f53,plain,
( ~ cowlThing(sK4)
| spl5_5 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f51,plain,
( spl5_5
<=> cowlThing(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
fof(f26,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f67,plain,
( ~ spl5_5
| spl5_6
| spl5_7
| ~ spl5_8
| spl5_1 ),
inference(avatar_split_clause,[],[f24,f32,f63,f59,f55,f51]) ).
fof(f32,plain,
( spl5_1
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f24,plain,
( sP0
| ~ xsd_integer(sK3)
| xsd_string(sK3)
| cowlNothing(sK4)
| ~ cowlThing(sK4) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( sP0
| ( ( xsd_integer(sK3)
| ~ xsd_string(sK3) )
& ( ~ xsd_integer(sK3)
| xsd_string(sK3) ) )
| cowlNothing(sK4)
| ~ cowlThing(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f16,f18,f17]) ).
fof(f17,plain,
( ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
=> ( ( xsd_integer(sK3)
| ~ xsd_string(sK3) )
& ( ~ xsd_integer(sK3)
| xsd_string(sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) )
=> ( cowlNothing(sK4)
| ~ cowlThing(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( sP0
| ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
| ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
( sP0
| ? [X2] :
( ( xsd_integer(X2)
| ~ xsd_string(X2) )
& ( ~ xsd_integer(X2)
| xsd_string(X2) ) )
| ? [X3] :
( cowlNothing(X3)
| ~ cowlThing(X3) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
( sP0
| ? [X2] :
( xsd_string(X2)
<~> ~ xsd_integer(X2) )
| ? [X3] :
( cowlNothing(X3)
| ~ cowlThing(X3) ) ),
inference(definition_folding,[],[f7,f9]) ).
fof(f9,plain,
( ? [X0] :
( ? [X1] :
( ~ cA(X1)
& rprop(X0,X1) )
& cowlThing(X0) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f7,plain,
( ? [X0] :
( ? [X1] :
( ~ cA(X1)
& rprop(X0,X1) )
& cowlThing(X0) )
| ? [X2] :
( xsd_string(X2)
<~> ~ xsd_integer(X2) )
| ? [X3] :
( cowlNothing(X3)
| ~ cowlThing(X3) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
~ ( ! [X0] :
( cowlThing(X0)
=> ! [X1] :
( rprop(X0,X1)
=> cA(X1) ) )
& ! [X2] :
( xsd_string(X2)
<=> ~ xsd_integer(X2) )
& ! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ) ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ( ! [X0] :
( cowlThing(X0)
=> ! [X1] :
( rprop(X0,X1)
=> cA(X1) ) )
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
( ! [X0] :
( cowlThing(X0)
=> ! [X1] :
( rprop(X0,X1)
=> cA(X1) ) )
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(f66,plain,
( ~ spl5_5
| spl5_6
| ~ spl5_7
| spl5_8
| spl5_1 ),
inference(avatar_split_clause,[],[f25,f32,f63,f59,f55,f51]) ).
fof(f25,plain,
( sP0
| xsd_integer(sK3)
| ~ xsd_string(sK3)
| cowlNothing(sK4)
| ~ cowlThing(sK4) ),
inference(cnf_transformation,[],[f19]) ).
fof(f44,plain,
( ~ spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f22,f41,f32]) ).
fof(f22,plain,
( rprop(sK1,sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ( ~ cA(sK2)
& rprop(sK1,sK2)
& cowlThing(sK1) )
| ~ sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f11,f13,f12]) ).
fof(f12,plain,
( ? [X0] :
( ? [X1] :
( ~ cA(X1)
& rprop(X0,X1) )
& cowlThing(X0) )
=> ( ? [X1] :
( ~ cA(X1)
& rprop(sK1,X1) )
& cowlThing(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X1] :
( ~ cA(X1)
& rprop(sK1,X1) )
=> ( ~ cA(sK2)
& rprop(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ? [X0] :
( ? [X1] :
( ~ cA(X1)
& rprop(X0,X1) )
& cowlThing(X0) )
| ~ sP0 ),
inference(nnf_transformation,[],[f9]) ).
fof(f39,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f23,f36,f32]) ).
fof(f23,plain,
( ~ cA(sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : KRS134+1 : TPTP v8.2.0. Released v3.1.0.
% 0.08/0.17 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.17/0.39 % Computer : n018.cluster.edu
% 0.17/0.39 % Model : x86_64 x86_64
% 0.17/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39 % Memory : 8042.1875MB
% 0.17/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.40 % CPULimit : 300
% 0.17/0.40 % WCLimit : 300
% 0.17/0.40 % DateTime : Sat May 18 22:13:08 EDT 2024
% 0.17/0.40 % CPUTime :
% 0.17/0.40 % (19130)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.42 % (19136)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.17/0.42 % (19131)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.17/0.42 % (19134)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.17/0.42 % (19132)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.17/0.42 TRYING [1]
% 0.17/0.42 Detected minimum model sizes of [1,1,1,1]
% 0.17/0.42 Detected maximum model sizes of [1,1,1,1]
% 0.17/0.42 TRYING [2]
% 0.17/0.42 TRYING [1,1,1,1]
% 0.17/0.42 Detected minimum model sizes of [1,1,1,1]
% 0.17/0.42 Cannot enumerate next child to try in an incomplete setup
% 0.17/0.42 % (19136)First to succeed.
% 0.17/0.42 % (19134)Refutation not found, incomplete strategy% (19134)------------------------------
% 0.17/0.42 % (19134)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.17/0.42 % (19134)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.42
% 0.17/0.42 % (19134)Memory used [KB]: 730
% 0.17/0.42 % (19134)Time elapsed: 0.003 s
% 0.17/0.42 % (19131)Also succeeded, but the first one will report.
% 0.17/0.42 % (19134)Instructions burned: 3 (million)
% 0.17/0.42 Detected maximum model sizes of [1,1,1,1]
% 0.17/0.42 TRYING [1,1,1,1]
% 0.17/0.42 Cannot enumerate next child to try in an incomplete setup
% 0.17/0.42 % (19132)Refutation not found, incomplete strategy% (19132)------------------------------
% 0.17/0.42 % (19132)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.17/0.42 % (19132)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.42
% 0.17/0.42 % (19134)------------------------------
% 0.17/0.42 % (19134)------------------------------
% 0.17/0.42 % (19132)Memory used [KB]: 734
% 0.17/0.42 % (19132)Time elapsed: 0.002 s
% 0.17/0.42 % (19132)Instructions burned: 3 (million)
% 0.17/0.42 % (19132)------------------------------
% 0.17/0.42 % (19132)------------------------------
% 0.17/0.42 % (19136)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19130"
% 0.25/0.42 % (19136)Refutation found. Thanks to Tanya!
% 0.25/0.42 % SZS status Theorem for theBenchmark
% 0.25/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.42 % (19136)------------------------------
% 0.25/0.42 % (19136)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.25/0.42 % (19136)Termination reason: Refutation
% 0.25/0.42
% 0.25/0.42 % (19136)Memory used [KB]: 752
% 0.25/0.42 % (19136)Time elapsed: 0.004 s
% 0.25/0.42 % (19136)Instructions burned: 4 (million)
% 0.25/0.42 % (19130)Success in time 0.019 s
%------------------------------------------------------------------------------