TSTP Solution File: KRS141+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KRS141+1 : TPTP v8.1.0. Released v3.1.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 : n012.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:30:55 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 13 unt; 0 def)
% Number of atoms : 155 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 193 ( 84 ~; 81 |; 19 &)
% ( 4 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 34 ( 26 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,plain,
$false,
inference(subsumption_resolution,[],[f52,f51]) ).
fof(f51,plain,
~ cc(io),
inference(subsumption_resolution,[],[f50,f46]) ).
fof(f46,plain,
( ~ cc(io)
| ~ xsd_string(sK0) ),
inference(subsumption_resolution,[],[f45,f37]) ).
fof(f37,plain,
! [X0] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(literal_reordering,[],[f23]) ).
fof(f23,plain,
! [X0] :
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,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/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f45,plain,
( xsd_integer(sK0)
| ~ xsd_string(sK0)
| ~ cc(io) ),
inference(subsumption_resolution,[],[f44,f35]) ).
fof(f35,plain,
! [X0] : ~ cowlNothing(X0),
inference(literal_reordering,[],[f21]) ).
fof(f21,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( cowlThing(X0)
& ~ cowlNothing(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(f44,plain,
( cowlNothing(sK1)
| ~ cc(io)
| xsd_integer(sK0)
| ~ xsd_string(sK0) ),
inference(subsumption_resolution,[],[f43,f32]) ).
fof(f32,plain,
! [X0] : cowlThing(X0),
inference(literal_reordering,[],[f22]) ).
fof(f22,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f43,plain,
( ~ cowlThing(io)
| ~ cc(io)
| cowlNothing(sK1)
| xsd_integer(sK0)
| ~ xsd_string(sK0) ),
inference(subsumption_resolution,[],[f36,f32]) ).
fof(f36,plain,
( ~ cowlThing(sK1)
| xsd_integer(sK0)
| cowlNothing(sK1)
| ~ cowlThing(io)
| ~ xsd_string(sK0)
| ~ cc(io) ),
inference(literal_reordering,[],[f26]) ).
fof(f26,plain,
( ~ cowlThing(sK1)
| ~ xsd_string(sK0)
| cowlNothing(sK1)
| ~ cc(io)
| ~ cowlThing(io)
| xsd_integer(sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ~ cc(io)
| ~ cowlThing(io)
| ( ( xsd_integer(sK0)
| ~ xsd_string(sK0) )
& ( ~ xsd_integer(sK0)
| xsd_string(sK0) ) )
| ~ cowlThing(sK1)
| cowlNothing(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f17,f16]) ).
fof(f16,plain,
( ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
=> ( ( xsd_integer(sK0)
| ~ xsd_string(sK0) )
& ( ~ xsd_integer(sK0)
| xsd_string(sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
=> ( ~ cowlThing(sK1)
| cowlNothing(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ~ cc(io)
| ~ cowlThing(io)
| ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
| ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
( ~ cc(io)
| ~ cowlThing(io)
| ? [X1] :
( ( xsd_integer(X1)
| ~ xsd_string(X1) )
& ( ~ xsd_integer(X1)
| xsd_string(X1) ) )
| ? [X0] :
( ~ cowlThing(X0)
| cowlNothing(X0) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
( ~ cc(io)
| ~ cowlThing(io)
| ? [X1] :
( xsd_string(X1)
<~> ~ xsd_integer(X1) )
| ? [X0] :
( ~ cowlThing(X0)
| cowlNothing(X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
~ ( cc(io)
& ! [X0] :
( cowlThing(X0)
& ~ cowlNothing(X0) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cowlThing(io) ),
inference(rectify,[],[f9]) ).
fof(f9,negated_conjecture,
~ ( ! [X0] :
( cowlThing(X0)
& ~ cowlNothing(X0) )
& cc(io)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& cowlThing(io) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
( ! [X0] :
( cowlThing(X0)
& ~ cowlNothing(X0) )
& cc(io)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& cowlThing(io) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(f50,plain,
( xsd_string(sK0)
| ~ cc(io) ),
inference(subsumption_resolution,[],[f49,f40]) ).
fof(f40,plain,
! [X0] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(literal_reordering,[],[f24]) ).
fof(f24,plain,
! [X0] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f49,plain,
( ~ cc(io)
| ~ xsd_integer(sK0)
| xsd_string(sK0) ),
inference(subsumption_resolution,[],[f48,f35]) ).
fof(f48,plain,
( ~ xsd_integer(sK0)
| xsd_string(sK0)
| ~ cc(io)
| cowlNothing(sK1) ),
inference(subsumption_resolution,[],[f47,f32]) ).
fof(f47,plain,
( xsd_string(sK0)
| ~ cc(io)
| ~ cowlThing(sK1)
| cowlNothing(sK1)
| ~ xsd_integer(sK0) ),
inference(subsumption_resolution,[],[f38,f32]) ).
fof(f38,plain,
( ~ cowlThing(io)
| ~ cc(io)
| xsd_string(sK0)
| ~ cowlThing(sK1)
| ~ xsd_integer(sK0)
| cowlNothing(sK1) ),
inference(literal_reordering,[],[f25]) ).
fof(f25,plain,
( ~ cowlThing(sK1)
| ~ xsd_integer(sK0)
| xsd_string(sK0)
| ~ cowlThing(io)
| ~ cc(io)
| cowlNothing(sK1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f52,plain,
cc(io),
inference(resolution,[],[f42,f31]) ).
fof(f31,plain,
rp(ii,io),
inference(literal_reordering,[],[f28]) ).
fof(f28,plain,
rp(ii,io),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
rp(ii,io),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f42,plain,
! [X0] :
( ~ rp(ii,X0)
| cc(X0) ),
inference(resolution,[],[f33,f34]) ).
fof(f34,plain,
cr(ii),
inference(literal_reordering,[],[f19]) ).
fof(f19,plain,
cr(ii),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
cr(ii),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f33,plain,
! [X0,X1] :
( ~ cr(X0)
| cc(X1)
| ~ rp(X0,X1) ),
inference(literal_reordering,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( cc(X1)
| ~ rp(X0,X1)
| ~ cr(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0] :
( ! [X1] :
( cc(X1)
| ~ rp(X0,X1) )
| ~ cr(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( cr(X0)
=> ! [X1] :
( rp(X0,X1)
=> cc(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS141+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/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.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 00:33:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.49 % (22511)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 (3000ds/68Mi)
% 0.20/0.49 % (22511)First to succeed.
% 0.20/0.49 % (22511)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (22511)------------------------------
% 0.20/0.50 % (22511)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (22511)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (22511)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (22511)Memory used [KB]: 5756
% 0.20/0.50 % (22511)Time elapsed: 0.005 s
% 0.20/0.50 % (22511)Instructions burned: 2 (million)
% 0.20/0.50 % (22511)------------------------------
% 0.20/0.50 % (22511)------------------------------
% 0.20/0.50 % (22496)Success in time 0.148 s
%------------------------------------------------------------------------------