TSTP Solution File: KRS180+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : KRS180+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n024.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 17:29:57 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 7 unt; 0 def)
% Number of atoms : 133 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 139 ( 49 ~; 43 |; 23 &)
% ( 7 <=>; 14 =>; 0 <=; 3 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 138 ( 114 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f67,plain,
$false,
inference(unit_resulting_resolution,[],[f61,f60,f65,f44]) ).
fof(f44,plain,
( xora(sK3,sK2)
| nota(sK3,sK2)
| nevera(sK3,sK2) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X2,X3] :
( status(X2,X3,sK3)
& ( nevera(sK3,sK2)
| xora(sK3,sK2)
| nota(sK3,sK2) )
& isa(sK3,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f34,f35]) ).
fof(f35,plain,
( ? [X0,X1] :
! [X2,X3] :
( status(X2,X3,X1)
& ( nevera(X1,X0)
| xora(X1,X0)
| nota(X1,X0) )
& isa(X1,X0) )
=> ! [X3,X2] :
( status(X2,X3,sK3)
& ( nevera(sK3,sK2)
| xora(sK3,sK2)
| nota(sK3,sK2) )
& isa(sK3,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
? [X0,X1] :
! [X2,X3] :
( status(X2,X3,X1)
& ( nevera(X1,X0)
| xora(X1,X0)
| nota(X1,X0) )
& isa(X1,X0) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
? [X1,X0] :
! [X2,X3] :
( status(X2,X3,X0)
& ( nevera(X0,X1)
| xora(X0,X1)
| nota(X0,X1) )
& isa(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
? [X1,X0] :
! [X2,X3] :
( ( nevera(X0,X1)
| xora(X0,X1)
| nota(X0,X1) )
& isa(X0,X1)
& status(X2,X3,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X1,X0] :
? [X2,X3] :
( status(X2,X3,X0)
=> ~ ( ( nevera(X0,X1)
| xora(X0,X1)
| nota(X0,X1) )
& isa(X0,X1) ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X1,X0] :
? [X2,X3] :
( status(X2,X3,X0)
=> ~ ( ( nevera(X0,X1)
| xora(X0,X1)
| nota(X0,X1) )
& isa(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_exclusive) ).
fof(f65,plain,
~ nevera(sK3,sK2),
inference(resolution,[],[f59,f45]) ).
fof(f45,plain,
! [X2,X3] : status(X2,X3,sK3),
inference(cnf_transformation,[],[f36]) ).
fof(f59,plain,
! [X8,X6,X7] :
( ~ status(X6,X7,X8)
| ~ nevera(X8,sK2) ),
inference(resolution,[],[f53,f40]) ).
fof(f40,plain,
! [X2,X3,X0,X1] :
( ~ status(X3,X2,X1)
| ~ status(X3,X2,X0)
| ~ nevera(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ! [X2,X3] :
( ~ status(X3,X2,X1)
| ~ status(X3,X2,X0) )
| ~ nevera(X0,X1) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X1,X0] :
( ! [X2,X3] :
( ~ status(X3,X2,X0)
| ~ status(X3,X2,X1) )
| ~ nevera(X1,X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( nevera(X1,X0)
=> ! [X3,X2] :
( status(X3,X2,X1)
=> ~ status(X3,X2,X0) ) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ! [X3,X2] :
( status(X3,X2,X1)
=> ~ status(X3,X2,X0) )
<=> nevera(X1,X0) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( nevera(X0,X1)
<=> ! [X3,X2] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera) ).
fof(f53,plain,
! [X0,X1] : status(X0,X1,sK2),
inference(resolution,[],[f48,f43]) ).
fof(f43,plain,
isa(sK3,sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f48,plain,
! [X3,X4,X5] :
( ~ isa(sK3,X3)
| status(X4,X5,X3) ),
inference(resolution,[],[f45,f46]) ).
fof(f46,plain,
! [X2,X3,X0,X1] :
( ~ status(X3,X2,X1)
| ~ isa(X1,X0)
| status(X3,X2,X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ~ isa(X1,X0)
| ! [X2,X3] :
( status(X3,X2,X0)
| ~ status(X3,X2,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( ~ isa(X0,X1)
| ! [X2,X3] :
( status(X3,X2,X1)
| ~ status(X3,X2,X0) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( isa(X0,X1)
=> ! [X3,X2] :
( status(X3,X2,X0)
=> status(X3,X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ! [X3,X2] :
( status(X3,X2,X0)
=> status(X3,X2,X1) )
<=> isa(X0,X1) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( isa(X0,X1)
<=> ! [X3,X2] :
( status(X2,X3,X0)
=> status(X2,X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa) ).
fof(f60,plain,
! [X9] : ~ nota(X9,sK2),
inference(resolution,[],[f53,f42]) ).
fof(f42,plain,
! [X0,X1] :
( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
| ~ nota(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
& status(sK0(X0,X1),sK1(X0,X1),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
=> ( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
& status(sK0(X0,X1),sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) ) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ~ nota(X0,X1)
| ? [X3,X2] :
( ~ status(X3,X2,X1)
& status(X3,X2,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( nota(X0,X1)
=> ? [X3,X2] :
( ~ status(X3,X2,X1)
& status(X3,X2,X0) ) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( nota(X0,X1)
<=> ? [X3,X2] :
( ~ status(X3,X2,X1)
& status(X3,X2,X0) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( nota(X0,X1)
<=> ? [X3,X2] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota) ).
fof(f61,plain,
~ xora(sK3,sK2),
inference(resolution,[],[f57,f45]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,X2)
| ~ xora(X2,sK2) ),
inference(resolution,[],[f53,f39]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0)
| ~ xora(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ! [X2,X3] :
( ( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) )
& ( status(X2,X3,X1)
| status(X2,X3,X0) ) )
| ~ xora(X0,X1) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) )
| ~ xora(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( xora(X0,X1)
=> ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( ! [X2,X3] :
( status(X2,X3,X0)
<~> status(X2,X3,X1) )
<=> xora(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xora) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KRS180+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n024.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 : Tue Aug 30 00:37:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (10012)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (10020)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.52 % (10016)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.52 % (10012)Instruction limit reached!
% 0.21/0.52 % (10012)------------------------------
% 0.21/0.52 % (10012)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (10012)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (10012)Termination reason: Unknown
% 0.21/0.52 % (10012)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (10012)Memory used [KB]: 6012
% 0.21/0.52 % (10012)Time elapsed: 0.110 s
% 0.21/0.52 % (10012)Instructions burned: 3 (million)
% 0.21/0.52 % (10012)------------------------------
% 0.21/0.52 % (10012)------------------------------
% 0.21/0.52 % (10033)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.53 % (10029)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.21/0.53 % (10033)First to succeed.
% 0.21/0.53 % (10024)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.53 % (10033)Refutation found. Thanks to Tanya!
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (10033)------------------------------
% 0.21/0.53 % (10033)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (10033)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (10033)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (10033)Memory used [KB]: 1407
% 0.21/0.53 % (10033)Time elapsed: 0.084 s
% 0.21/0.53 % (10033)Instructions burned: 2 (million)
% 0.21/0.53 % (10033)------------------------------
% 0.21/0.53 % (10033)------------------------------
% 0.21/0.53 % (10009)Success in time 0.17 s
%------------------------------------------------------------------------------