TSTP Solution File: KRS096+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KRS096+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n006.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 : Sun May 5 07:19:31 EDT 2024
% Result : Unsatisfiable 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 6 unt; 0 def)
% Number of atoms : 206 ( 22 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 238 ( 85 ~; 76 |; 61 &)
% ( 9 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 90 ( 65 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f125,plain,
$false,
inference(avatar_sat_refutation,[],[f117,f120,f124]) ).
fof(f124,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f123]) ).
fof(f123,plain,
( $false
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f122,f55]) ).
fof(f55,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
cUnsatisfiable(i2003_11_14_17_20_18265),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f122,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_18265)
| ~ spl6_2 ),
inference(resolution,[],[f121,f71]) ).
fof(f71,plain,
! [X0] :
( sP1(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ sP1(X0) )
& ( sP1(X0)
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> sP1(X0) ),
inference(definition_folding,[],[f21,f41,f40]) ).
fof(f40,plain,
! [X0] :
( sP0(X0)
<=> ? [X4] :
( cc(X4)
& rr(X0,X4) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f41,plain,
! [X0] :
( sP1(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& sP0(X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f21,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X2)
& rr(X0,X1) )
=> X1 = X2 )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ! [X5,X6] :
( ( rr(X3,X6)
& rr(X3,X5) )
=> X5 = X6 )
& ? [X4] :
( cd(X4)
& rr(X3,X4) )
& ? [X4] :
( cc(X4)
& rr(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f121,plain,
( ~ sP1(i2003_11_14_17_20_18265)
| ~ spl6_2 ),
inference(resolution,[],[f116,f94]) ).
fof(f94,plain,
! [X0] :
( ~ cc(sK4(X0))
| ~ sP1(X0) ),
inference(resolution,[],[f63,f58]) ).
fof(f58,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0] :
( cc(X0)
=> ~ cd(X0) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X3] :
( cc(X3)
=> ~ cd(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f63,plain,
! [X0] :
( cd(sK4(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0] :
( ( sP1(X0)
| ( sK2(X0) != sK3(X0)
& rr(X0,sK3(X0))
& rr(X0,sK2(X0)) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ~ sP0(X0) )
& ( ( ! [X4,X5] :
( X4 = X5
| ~ rr(X0,X5)
| ~ rr(X0,X4) )
& cd(sK4(X0))
& rr(X0,sK4(X0))
& sP0(X0) )
| ~ sP1(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f46,f48,f47]) ).
fof(f47,plain,
! [X0] :
( ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
=> ( sK2(X0) != sK3(X0)
& rr(X0,sK3(X0))
& rr(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f48,plain,
! [X0] :
( ? [X6] :
( cd(X6)
& rr(X0,X6) )
=> ( cd(sK4(X0))
& rr(X0,sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0] :
( ( sP1(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ~ sP0(X0) )
& ( ( ! [X4,X5] :
( X4 = X5
| ~ rr(X0,X5)
| ~ rr(X0,X4) )
& ? [X6] :
( cd(X6)
& rr(X0,X6) )
& sP0(X0) )
| ~ sP1(X0) ) ),
inference(rectify,[],[f45]) ).
fof(f45,plain,
! [X0] :
( ( sP1(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ~ sP0(X0) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& sP0(X0) )
| ~ sP1(X0) ) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
! [X0] :
( ( sP1(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ~ sP0(X0) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& sP0(X0) )
| ~ sP1(X0) ) ),
inference(nnf_transformation,[],[f41]) ).
fof(f116,plain,
( cc(sK4(i2003_11_14_17_20_18265))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f114]) ).
fof(f114,plain,
( spl6_2
<=> cc(sK4(i2003_11_14_17_20_18265)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f120,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f119]) ).
fof(f119,plain,
( $false
| spl6_1 ),
inference(subsumption_resolution,[],[f118,f55]) ).
fof(f118,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_18265)
| spl6_1 ),
inference(resolution,[],[f112,f92]) ).
fof(f92,plain,
! [X0] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f71,f61]) ).
fof(f61,plain,
! [X0] :
( ~ sP1(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f112,plain,
( ~ sP0(i2003_11_14_17_20_18265)
| spl6_1 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f110,plain,
( spl6_1
<=> sP0(i2003_11_14_17_20_18265) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f117,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f108,f114,f110]) ).
fof(f108,plain,
( cc(sK4(i2003_11_14_17_20_18265))
| ~ sP0(i2003_11_14_17_20_18265) ),
inference(superposition,[],[f69,f106]) ).
fof(f106,plain,
sK4(i2003_11_14_17_20_18265) = sK5(i2003_11_14_17_20_18265),
inference(resolution,[],[f105,f55]) ).
fof(f105,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sK4(X0) = sK5(X0) ),
inference(resolution,[],[f104,f71]) ).
fof(f104,plain,
! [X0] :
( ~ sP1(X0)
| sK4(X0) = sK5(X0) ),
inference(subsumption_resolution,[],[f102,f61]) ).
fof(f102,plain,
! [X0] :
( sK4(X0) = sK5(X0)
| ~ sP1(X0)
| ~ sP0(X0) ),
inference(resolution,[],[f99,f68]) ).
fof(f68,plain,
! [X0] :
( rr(X0,sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ cc(X1)
| ~ rr(X0,X1) ) )
& ( ( cc(sK5(X0))
& rr(X0,sK5(X0)) )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f51,f52]) ).
fof(f52,plain,
! [X0] :
( ? [X2] :
( cc(X2)
& rr(X0,X2) )
=> ( cc(sK5(X0))
& rr(X0,sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f51,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ cc(X1)
| ~ rr(X0,X1) ) )
& ( ? [X2] :
( cc(X2)
& rr(X0,X2) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f50]) ).
fof(f50,plain,
! [X0] :
( ( sP0(X0)
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ? [X4] :
( cc(X4)
& rr(X0,X4) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f40]) ).
fof(f99,plain,
! [X0,X1] :
( ~ rr(X1,X0)
| sK4(X1) = X0
| ~ sP1(X1) ),
inference(duplicate_literal_removal,[],[f97]) ).
fof(f97,plain,
! [X0,X1] :
( sK4(X1) = X0
| ~ rr(X1,X0)
| ~ sP1(X1)
| ~ sP1(X1) ),
inference(resolution,[],[f64,f62]) ).
fof(f62,plain,
! [X0] :
( rr(X0,sK4(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f64,plain,
! [X0,X4,X5] :
( ~ rr(X0,X5)
| X4 = X5
| ~ rr(X0,X4)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f69,plain,
! [X0] :
( cc(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS096+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 19:53:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (27071)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (27074)WARNING: value z3 for option sas not known
% 0.15/0.38 % (27074)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (27074)First to succeed.
% 0.15/0.38 % (27074)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27071"
% 0.15/0.38 % (27074)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (27074)------------------------------
% 0.15/0.38 % (27074)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (27074)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (27074)Memory used [KB]: 780
% 0.15/0.38 % (27074)Time elapsed: 0.007 s
% 0.15/0.38 % (27074)Instructions burned: 6 (million)
% 0.15/0.38 % (27071)Success in time 0.025 s
%------------------------------------------------------------------------------