TSTP Solution File: KRS181+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KRS181+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n017.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:56 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 83 ( 31 ~; 20 |; 22 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 51 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f108,plain,
$false,
inference(subsumption_resolution,[],[f107,f59]) ).
fof(f59,plain,
nota(sK0,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( ~ nota(sK1,sK2)
& nota(sK0,sK2)
& isa(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f27,f30]) ).
fof(f30,plain,
( ? [X0,X1,X2] :
( ~ nota(X1,X2)
& nota(X0,X2)
& isa(X0,X1) )
=> ( ~ nota(sK1,sK2)
& nota(sK0,sK2)
& isa(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ~ nota(X1,X2)
& nota(X0,X2)
& isa(X0,X1) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
? [X0,X1,X2] :
( ~ nota(X1,X2)
& nota(X0,X2)
& isa(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X0,X1,X2] :
( ( nota(X0,X2)
& isa(X0,X1) )
=> nota(X1,X2) ),
inference(rectify,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X10] :
( ( nota(X0,X10)
& isa(X0,X1) )
=> nota(X1,X10) ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X0,X1,X10] :
( ( nota(X0,X10)
& isa(X0,X1) )
=> nota(X1,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_isa_nota) ).
fof(f107,plain,
~ nota(sK0,sK2),
inference(subsumption_resolution,[],[f104,f60]) ).
fof(f60,plain,
~ nota(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f104,plain,
( nota(sK1,sK2)
| ~ nota(sK0,sK2) ),
inference(resolution,[],[f102,f66]) ).
fof(f66,plain,
! [X0,X1] :
( ~ status(sK3(X0,X1),sK4(X0,X1),X1)
| ~ nota(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( ( ( ~ status(sK3(X0,X1),sK4(X0,X1),X1)
& status(sK3(X0,X1),sK4(X0,X1),X0) )
| ~ nota(X0,X1) )
& ( nota(X0,X1)
| ! [X4,X5] :
( status(X4,X5,X1)
| ~ status(X4,X5,X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f34,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
=> ( ~ status(sK3(X0,X1),sK4(X0,X1),X1)
& status(sK3(X0,X1),sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0,X1] :
( ( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
| ~ nota(X0,X1) )
& ( nota(X0,X1)
| ! [X4,X5] :
( status(X4,X5,X1)
| ~ status(X4,X5,X0) ) ) ),
inference(rectify,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
| ~ nota(X0,X1) )
& ( nota(X0,X1)
| ! [X2,X3] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
<=> nota(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota) ).
fof(f102,plain,
! [X0] :
( status(sK3(sK0,sK2),sK4(sK0,sK2),X0)
| nota(sK1,X0) ),
inference(resolution,[],[f101,f64]) ).
fof(f64,plain,
! [X0,X1,X4,X5] :
( ~ status(X4,X5,X0)
| status(X4,X5,X1)
| nota(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f101,plain,
status(sK3(sK0,sK2),sK4(sK0,sK2),sK1),
inference(resolution,[],[f97,f58]) ).
fof(f58,plain,
isa(sK0,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f97,plain,
! [X0] :
( ~ isa(sK0,X0)
| status(sK3(sK0,sK2),sK4(sK0,sK2),X0) ),
inference(resolution,[],[f95,f63]) ).
fof(f63,plain,
! [X2,X3,X0,X1] :
( ~ status(X2,X3,X0)
| status(X2,X3,X1)
| ~ isa(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X1)
| ~ status(X2,X3,X0) )
| ~ isa(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( isa(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
<=> isa(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa) ).
fof(f95,plain,
status(sK3(sK0,sK2),sK4(sK0,sK2),sK0),
inference(resolution,[],[f65,f59]) ).
fof(f65,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| status(sK3(X0,X1),sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS181+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.14/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 19:50:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (17385)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.37 % (17387)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.37 Detected minimum model sizes of [1,1,1,1,1]
% 0.20/0.37 Detected maximum model sizes of [max,3,max,max,9]
% 0.20/0.37 TRYING [1,1,1,1,1]
% 0.20/0.37 TRYING [2,1,1,1,2]
% 0.20/0.37 % (17386)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.37 % (17388)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.20/0.37 % (17389)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.20/0.37 % (17390)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.20/0.37 % (17391)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.20/0.37 TRYING [2,2,1,1,2]
% 0.20/0.37 % (17392)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.37 TRYING [2,2,2,1,2]
% 0.20/0.37 TRYING [1]
% 0.20/0.37 TRYING [2]
% 0.20/0.37 TRYING [2,2,1,2,2]
% 0.20/0.37 Detected minimum model sizes of [1,1,1,1,1]
% 0.20/0.37 Detected maximum model sizes of [max,3,max,max,9]
% 0.20/0.37 TRYING [1]
% 0.20/0.37 TRYING [1,1,1,1,1]
% 0.20/0.37 TRYING [3]
% 0.20/0.37 TRYING [2]
% 0.20/0.37 % (17391)First to succeed.
% 0.20/0.37 TRYING [3,3,1,1,2]
% 0.20/0.37 TRYING [2,1,1,1,2]
% 0.20/0.37 % (17388)Also succeeded, but the first one will report.
% 0.20/0.37 % (17390)Also succeeded, but the first one will report.
% 0.20/0.37 TRYING [3]
% 0.20/0.37 TRYING [2,2,1,1,2]
% 0.20/0.37 % (17391)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-17385"
% 0.20/0.37 TRYING [2,2,2,2,2]
% 0.20/0.38 TRYING [2,2,2,1,2]
% 0.20/0.38 TRYING [4]
% 0.20/0.38 % (17391)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (17391)------------------------------
% 0.20/0.38 % (17391)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.38 % (17391)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (17391)Memory used [KB]: 844
% 0.20/0.38 % (17391)Time elapsed: 0.004 s
% 0.20/0.38 % (17391)Instructions burned: 4 (million)
% 0.20/0.38 % (17385)Success in time 0.02 s
%------------------------------------------------------------------------------