TSTP Solution File: KRS143+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KRS143+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 : n026.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:06 EDT 2022
% Result : Theorem 2.36s 0.69s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS143+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 7 05:37:01 EDT 2022
% 0.11/0.33 % CPUTime :
% 2.36/0.69 % SZS status Theorem
% 2.36/0.69 % SZS output begin IncompleteProof
% 2.36/0.69 cnf(c0, axiom,
% 2.36/0.69 sP0(sK6) | ~rp(sK6,X0) | sP1 | cowlNothing(sK7) | ~cowlThing(sK7)).
% 2.36/0.69 cnf(c1, plain,
% 2.36/0.69 sP0(sK6) | ~rp(sK6,X0) | sP1 | cowlNothing(sK7) | ~cowlThing(sK7),
% 2.36/0.69 inference(start, [], [c0])).
% 2.36/0.69
% 2.36/0.69 cnf(c2, axiom,
% 2.36/0.69 rp(X1,sK4(X1)) | ~sP0(X1)).
% 2.36/0.69 cnf(a0, assumption,
% 2.36/0.69 sK6 = X1).
% 2.36/0.69 cnf(c3, plain,
% 2.36/0.69 ~rp(sK6,X0) | sP1 | cowlNothing(sK7) | ~cowlThing(sK7),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.36/0.69 cnf(c4, plain,
% 2.36/0.69 rp(X1,sK4(X1)),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.36/0.69
% 2.36/0.69 cnf(c5, axiom,
% 2.36/0.69 X2 = X3 | ~rp(X4,X3) | ~rp(X4,X2) | ~cc(X4)).
% 2.36/0.69 cnf(a1, assumption,
% 2.36/0.69 X1 = X4).
% 2.36/0.69 cnf(a2, assumption,
% 2.36/0.69 sK4(X1) = X2).
% 2.36/0.69 cnf(c6, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 2.36/0.69 cnf(c7, plain,
% 2.36/0.69 X2 = X3 | ~rp(X4,X3) | ~cc(X4),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 2.36/0.69
% 2.36/0.69 cnf(c8, axiom,
% 2.36/0.69 sK4(X5) != sK5(X5) | ~sP0(X5)).
% 2.36/0.69 cnf(a3, assumption,
% 2.36/0.69 sK5(X5) = X3).
% 2.36/0.69 cnf(c9, plain,
% 2.36/0.69 ~rp(X4,X3) | ~cc(X4),
% 2.36/0.69 inference(strict_subterm_extension, [assumptions([a3])], [c7, c8])).
% 2.36/0.69 cnf(c10, plain,
% 2.36/0.69 ~sP0(X5),
% 2.36/0.69 inference(strict_subterm_extension, [assumptions([a3])], [c7, c8])).
% 2.36/0.69 cnf(c11, plain,
% 2.36/0.69 sK4(X5) != X2,
% 2.36/0.69 inference(strict_subterm_extension, [assumptions([a3])], [c7, c8])).
% 2.36/0.69
% 2.36/0.69 cnf(a4, assumption,
% 2.36/0.69 sK4(X5) = X2).
% 2.36/0.69 cnf(c12, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(reflexivity, [assumptions([a4])], [c11])).
% 2.36/0.69
% 2.36/0.69 cnf(c13, plain,
% 2.36/0.69 sP0(sK6)).
% 2.36/0.69 cnf(a5, assumption,
% 2.36/0.69 X5 = sK6).
% 2.36/0.69 cnf(c14, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(predicate_reduction, [assumptions([a5])], [c10, c13])).
% 2.36/0.69
% 2.36/0.69 cnf(c15, axiom,
% 2.36/0.69 rp(X6,sK5(X6)) | ~sP0(X6)).
% 2.36/0.69 cnf(a6, assumption,
% 2.36/0.69 X4 = X6).
% 2.36/0.69 cnf(a7, assumption,
% 2.36/0.69 X3 = sK5(X6)).
% 2.36/0.69 cnf(c16, plain,
% 2.36/0.69 ~cc(X4),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c15])).
% 2.36/0.69 cnf(c17, plain,
% 2.36/0.69 ~sP0(X6),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c15])).
% 2.36/0.69
% 2.36/0.69 cnf(c18, plain,
% 2.36/0.69 sP0(sK6)).
% 2.36/0.69 cnf(a8, assumption,
% 2.36/0.69 X6 = sK6).
% 2.36/0.69 cnf(c19, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(predicate_reduction, [assumptions([a8])], [c17, c18])).
% 2.36/0.69
% 2.36/0.69 cnf(c20, axiom,
% 2.36/0.69 cc(sK6) | sP1 | cowlNothing(sK7) | ~cowlThing(sK7)).
% 2.36/0.69 cnf(a9, assumption,
% 2.36/0.69 X4 = sK6).
% 2.36/0.69 cnf(c21, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a9])], [c16, c20])).
% 2.36/0.69 cnf(c22, plain,
% 2.36/0.69 sP1 | cowlNothing(sK7) | ~cowlThing(sK7),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a9])], [c16, c20])).
% 2.36/0.69
% 2.36/0.69 cnf(c23, axiom,
% 2.36/0.69 xsd_integer(sK3) | ~xsd_string(sK3) | ~sP1).
% 2.36/0.69 cnf(c24, plain,
% 2.36/0.69 cowlNothing(sK7) | ~cowlThing(sK7),
% 2.36/0.69 inference(strict_predicate_extension, [], [c22, c23])).
% 2.36/0.69 cnf(c25, plain,
% 2.36/0.69 xsd_integer(sK3) | ~xsd_string(sK3),
% 2.36/0.69 inference(strict_predicate_extension, [], [c22, c23])).
% 2.36/0.69
% 2.36/0.69 cnf(c26, axiom,
% 2.36/0.69 ~xsd_integer(X7) | ~xsd_string(X7)).
% 2.36/0.69 cnf(a10, assumption,
% 2.36/0.69 sK3 = X7).
% 2.36/0.69 cnf(c27, plain,
% 2.36/0.69 ~xsd_string(sK3),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a10])], [c25, c26])).
% 2.36/0.69 cnf(c28, plain,
% 2.36/0.69 ~xsd_string(X7),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a10])], [c25, c26])).
% 2.36/0.69
% 2.36/0.69 cnf(c29, axiom,
% 2.36/0.69 ~xsd_integer(sK3) | xsd_string(sK3) | ~sP1).
% 2.36/0.69 cnf(a11, assumption,
% 2.36/0.69 X7 = sK3).
% 2.36/0.69 cnf(c30, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a11])], [c28, c29])).
% 2.36/0.69 cnf(c31, plain,
% 2.36/0.69 ~xsd_integer(sK3) | ~sP1,
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a11])], [c28, c29])).
% 2.36/0.69
% 2.36/0.69 cnf(c32, plain,
% 2.36/0.69 xsd_integer(sK3)).
% 2.36/0.69 cnf(a12, assumption,
% 2.36/0.69 sK3 = sK3).
% 2.36/0.69 cnf(c33, plain,
% 2.36/0.69 ~sP1,
% 2.36/0.69 inference(predicate_reduction, [assumptions([a12])], [c31, c32])).
% 2.36/0.69
% 2.36/0.69 cnf(c34, plain,
% 2.36/0.69 sP1).
% 2.36/0.69 cnf(c35, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(predicate_reduction, [], [c33, c34])).
% 2.36/0.69
% 2.36/0.69 cnf(c36, axiom,
% 2.36/0.69 xsd_string(X8) | xsd_integer(X8)).
% 2.36/0.69 cnf(a13, assumption,
% 2.36/0.69 sK3 = X8).
% 2.36/0.69 cnf(c37, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a13])], [c27, c36])).
% 2.36/0.69 cnf(c38, plain,
% 2.36/0.69 xsd_integer(X8),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a13])], [c27, c36])).
% 2.36/0.69
% 2.36/0.69 cnf(c39, plain,
% 2.36/0.69 ~xsd_integer(sK3)).
% 2.36/0.69 cnf(a14, assumption,
% 2.36/0.69 X8 = sK3).
% 2.36/0.69 cnf(c40, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(predicate_reduction, [assumptions([a14])], [c38, c39])).
% 2.36/0.69
% 2.36/0.69 cnf(c41, axiom,
% 2.36/0.69 ~cowlNothing(X9)).
% 2.36/0.69 cnf(a15, assumption,
% 2.36/0.69 sK7 = X9).
% 2.36/0.69 cnf(c42, plain,
% 2.36/0.69 ~cowlThing(sK7),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a15])], [c24, c41])).
% 2.36/0.69 cnf(c43, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a15])], [c24, c41])).
% 2.36/0.69
% 2.36/0.69 cnf(c44, axiom,
% 2.36/0.69 cowlThing(X10)).
% 2.36/0.69 cnf(a16, assumption,
% 2.36/0.69 sK7 = X10).
% 2.36/0.69 cnf(c45, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a16])], [c42, c44])).
% 2.36/0.69 cnf(c46, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a16])], [c42, c44])).
% 2.36/0.69
% 2.36/0.69 cnf(c47, axiom,
% 2.36/0.69 rp(X11,sK2(X11)) | ~cc(X11)).
% 2.36/0.69 cnf(a17, assumption,
% 2.36/0.69 sK6 = X11).
% 2.36/0.69 cnf(a18, assumption,
% 2.36/0.69 X0 = sK2(X11)).
% 2.36/0.69 cnf(c48, plain,
% 2.36/0.69 sP1 | cowlNothing(sK7) | ~cowlThing(sK7),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a17, a18])], [c3, c47])).
% 2.36/0.69 cnf(c49, plain,
% 2.36/0.69 ~cc(X11),
% 2.36/0.69 inference(strict_predicate_extension, [assumptions([a17, a18])], [c3, c47])).
% 2.36/0.69
% 2.36/0.69 cnf(c50, plain,
% 2.36/0.69 cc(X4)).
% 2.36/0.69 cnf(a19, assumption,
% 2.36/0.69 X11 = X4).
% 2.36/0.69 cnf(c51, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(predicate_reduction, [assumptions([a19])], [c49, c50])).
% 2.36/0.69
% 2.36/0.69 cnf(c52, plain,
% 2.36/0.69 ~sP1).
% 2.36/0.69 cnf(c53, plain,
% 2.36/0.69 cowlNothing(sK7) | ~cowlThing(sK7),
% 2.36/0.69 inference(predicate_reduction, [], [c48, c52])).
% 2.36/0.69
% 2.36/0.69 cnf(c54, plain,
% 2.36/0.69 ~cowlNothing(sK7)).
% 2.36/0.69 cnf(a20, assumption,
% 2.36/0.69 sK7 = sK7).
% 2.36/0.69 cnf(c55, plain,
% 2.36/0.69 ~cowlThing(sK7),
% 2.36/0.69 inference(predicate_reduction, [assumptions([a20])], [c53, c54])).
% 2.36/0.69
% 2.36/0.69 cnf(c56, plain,
% 2.36/0.69 cowlThing(sK7)).
% 2.36/0.69 cnf(a21, assumption,
% 2.36/0.69 sK7 = sK7).
% 2.36/0.69 cnf(c57, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(predicate_reduction, [assumptions([a21])], [c55, c56])).
% 2.36/0.69
% 2.36/0.69 cnf(c58, plain,
% 2.36/0.69 $false,
% 2.36/0.69 inference(constraint_solving, [
% 2.36/0.69 bind(X0, sK2(X11)),
% 2.36/0.69 bind(X1, sK6),
% 2.36/0.69 bind(X2, sK4(X1)),
% 2.36/0.69 bind(X3, sK5(X5)),
% 2.36/0.69 bind(X4, sK6),
% 2.36/0.69 bind(X5, sK6),
% 2.36/0.69 bind(X6, sK6),
% 2.36/0.69 bind(X7, sK3),
% 2.36/0.69 bind(X8, sK3),
% 2.36/0.69 bind(X9, sK7),
% 2.36/0.69 bind(X10, sK7),
% 2.36/0.69 bind(X11, sK6)
% 2.36/0.69 ],
% 2.36/0.69 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 2.36/0.69
% 2.36/0.69 % SZS output end IncompleteProof
%------------------------------------------------------------------------------