TSTP Solution File: KRS136+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KRS136+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 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 : 600s
% DateTime : Sun Jul 17 03:13:05 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS136+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 16:51:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % SZS output begin IncompleteProof
% 0.12/0.35 cnf(c0, axiom,
% 0.12/0.35 xsd_integer(sK0) | ~xsd_string(sK0) | cowlNothing(sK1) | ~cowlThing(sK1)).
% 0.12/0.35 cnf(c1, plain,
% 0.12/0.35 xsd_integer(sK0) | ~xsd_string(sK0) | cowlNothing(sK1) | ~cowlThing(sK1),
% 0.12/0.35 inference(start, [], [c0])).
% 0.12/0.35
% 0.12/0.35 cnf(c2, axiom,
% 0.12/0.35 ~xsd_integer(X0) | ~xsd_string(X0)).
% 0.12/0.35 cnf(a0, assumption,
% 0.12/0.35 sK0 = X0).
% 0.12/0.35 cnf(c3, plain,
% 0.12/0.35 ~xsd_string(sK0) | cowlNothing(sK1) | ~cowlThing(sK1),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35 cnf(c4, plain,
% 0.12/0.35 ~xsd_string(X0),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35
% 0.12/0.35 cnf(c5, axiom,
% 0.12/0.35 ~xsd_integer(sK0) | xsd_string(sK0) | cowlNothing(sK1) | ~cowlThing(sK1)).
% 0.12/0.35 cnf(a1, assumption,
% 0.12/0.35 X0 = sK0).
% 0.12/0.35 cnf(c6, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.35 cnf(c7, plain,
% 0.12/0.35 ~xsd_integer(sK0) | cowlNothing(sK1) | ~cowlThing(sK1),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.35
% 0.12/0.35 cnf(c8, plain,
% 0.12/0.35 xsd_integer(sK0)).
% 0.12/0.35 cnf(a2, assumption,
% 0.12/0.35 sK0 = sK0).
% 0.12/0.35 cnf(c9, plain,
% 0.12/0.35 cowlNothing(sK1) | ~cowlThing(sK1),
% 0.12/0.35 inference(predicate_reduction, [assumptions([a2])], [c7, c8])).
% 0.12/0.35
% 0.12/0.35 cnf(c10, axiom,
% 0.12/0.35 ~cowlNothing(X1)).
% 0.12/0.35 cnf(a3, assumption,
% 0.12/0.35 sK1 = X1).
% 0.12/0.35 cnf(c11, plain,
% 0.12/0.35 ~cowlThing(sK1),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c9, c10])).
% 0.12/0.35 cnf(c12, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c9, c10])).
% 0.12/0.35
% 0.12/0.35 cnf(c13, axiom,
% 0.12/0.35 cowlThing(X2)).
% 0.12/0.35 cnf(a4, assumption,
% 0.12/0.35 sK1 = X2).
% 0.12/0.35 cnf(c14, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c11, c13])).
% 0.12/0.35 cnf(c15, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c11, c13])).
% 0.12/0.35
% 0.12/0.35 cnf(c16, axiom,
% 0.12/0.35 xsd_string(X3) | xsd_integer(X3)).
% 0.12/0.35 cnf(a5, assumption,
% 0.12/0.35 sK0 = X3).
% 0.12/0.35 cnf(c17, plain,
% 0.12/0.35 cowlNothing(sK1) | ~cowlThing(sK1),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c3, c16])).
% 0.12/0.35 cnf(c18, plain,
% 0.12/0.35 xsd_integer(X3),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c3, c16])).
% 0.12/0.35
% 0.12/0.35 cnf(c19, plain,
% 0.12/0.35 ~xsd_integer(sK0)).
% 0.12/0.35 cnf(a6, assumption,
% 0.12/0.35 X3 = sK0).
% 0.12/0.35 cnf(c20, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(predicate_reduction, [assumptions([a6])], [c18, c19])).
% 0.12/0.35
% 0.12/0.35 cnf(c21, plain,
% 0.12/0.35 ~cowlNothing(sK1)).
% 0.12/0.35 cnf(a7, assumption,
% 0.12/0.35 sK1 = sK1).
% 0.12/0.35 cnf(c22, plain,
% 0.12/0.35 ~cowlThing(sK1),
% 0.12/0.35 inference(predicate_reduction, [assumptions([a7])], [c17, c21])).
% 0.12/0.35
% 0.12/0.35 cnf(c23, plain,
% 0.12/0.35 cowlThing(sK1)).
% 0.12/0.35 cnf(a8, assumption,
% 0.12/0.35 sK1 = sK1).
% 0.12/0.35 cnf(c24, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(predicate_reduction, [assumptions([a8])], [c22, c23])).
% 0.12/0.35
% 0.12/0.35 cnf(c25, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(constraint_solving, [
% 0.12/0.35 bind(X0, sK0),
% 0.12/0.35 bind(X1, sK1),
% 0.12/0.35 bind(X2, sK1),
% 0.12/0.35 bind(X3, sK0)
% 0.12/0.35 ],
% 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.12/0.35
% 0.12/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------