TSTP Solution File: KRS067+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KRS067+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 : n029.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:12:54 EDT 2022
% Result : Unsatisfiable 0.13s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS067+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 19:02:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36 % SZS output begin IncompleteProof
% 0.13/0.36 cnf(c0, axiom,
% 0.13/0.36 ~cc(X0) | ~ca(X0)).
% 0.13/0.36 cnf(c1, plain,
% 0.13/0.36 ~cc(X0) | ~ca(X0),
% 0.13/0.36 inference(start, [], [c0])).
% 0.13/0.36
% 0.13/0.36 cnf(c2, axiom,
% 0.13/0.36 cc(X1) | sP1(X1) | sP0(X1) | ~sP2(X1)).
% 0.13/0.36 cnf(a0, assumption,
% 0.13/0.36 X0 = X1).
% 0.13/0.36 cnf(c3, plain,
% 0.13/0.36 ~ca(X0),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.36 cnf(c4, plain,
% 0.13/0.36 sP1(X1) | sP0(X1) | ~sP2(X1),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.36
% 0.13/0.36 cnf(c5, axiom,
% 0.13/0.36 ca(X2) | ~sP1(X2)).
% 0.13/0.36 cnf(a1, assumption,
% 0.13/0.36 X1 = X2).
% 0.13/0.36 cnf(c6, plain,
% 0.13/0.36 sP0(X1) | ~sP2(X1),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.36 cnf(c7, plain,
% 0.13/0.36 ca(X2),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.36
% 0.13/0.36 cnf(c8, axiom,
% 0.13/0.36 ~cb(X3) | ~ca(X3)).
% 0.13/0.36 cnf(a2, assumption,
% 0.13/0.36 X2 = X3).
% 0.13/0.36 cnf(c9, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.36 cnf(c10, plain,
% 0.13/0.36 ~cb(X3),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.36
% 0.13/0.36 cnf(c11, axiom,
% 0.13/0.36 cb(X4) | ~sP1(X4)).
% 0.13/0.36 cnf(a3, assumption,
% 0.13/0.36 X3 = X4).
% 0.13/0.36 cnf(c12, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.36 cnf(c13, plain,
% 0.13/0.36 ~sP1(X4),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.36
% 0.13/0.36 cnf(c14, plain,
% 0.13/0.36 sP1(X1)).
% 0.13/0.36 cnf(a4, assumption,
% 0.13/0.36 X4 = X1).
% 0.13/0.36 cnf(c15, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a4])], [c13, c14])).
% 0.13/0.36
% 0.13/0.36 cnf(c16, axiom,
% 0.13/0.36 cc(X5) | ~sP0(X5)).
% 0.13/0.36 cnf(a5, assumption,
% 0.13/0.36 X1 = X5).
% 0.13/0.36 cnf(c17, plain,
% 0.13/0.36 ~sP2(X1),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c6, c16])).
% 0.13/0.36 cnf(c18, plain,
% 0.13/0.36 cc(X5),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c6, c16])).
% 0.13/0.36
% 0.13/0.36 cnf(c19, plain,
% 0.13/0.36 ~cc(X0)).
% 0.13/0.36 cnf(a6, assumption,
% 0.13/0.36 X5 = X0).
% 0.13/0.36 cnf(c20, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a6])], [c18, c19])).
% 0.13/0.36
% 0.13/0.36 cnf(c21, axiom,
% 0.13/0.36 sP2(X6) | ~cUnsatisfiable(X6)).
% 0.13/0.36 cnf(a7, assumption,
% 0.13/0.36 X1 = X6).
% 0.13/0.36 cnf(c22, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c17, c21])).
% 0.13/0.36 cnf(c23, plain,
% 0.13/0.36 ~cUnsatisfiable(X6),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c17, c21])).
% 0.13/0.36
% 0.13/0.36 cnf(c24, axiom,
% 0.13/0.36 cUnsatisfiable(i2003_11_14_17_18_1956)).
% 0.13/0.36 cnf(a8, assumption,
% 0.13/0.36 X6 = i2003_11_14_17_18_1956).
% 0.13/0.36 cnf(c25, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c23, c24])).
% 0.13/0.36 cnf(c26, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c23, c24])).
% 0.13/0.36
% 0.13/0.36 cnf(c27, axiom,
% 0.13/0.36 ca(X7) | sP1(X7) | sP0(X7) | ~sP2(X7)).
% 0.13/0.36 cnf(a9, assumption,
% 0.13/0.36 X0 = X7).
% 0.13/0.36 cnf(c28, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a9])], [c3, c27])).
% 0.13/0.36 cnf(c29, plain,
% 0.13/0.36 sP1(X7) | sP0(X7) | ~sP2(X7),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a9])], [c3, c27])).
% 0.13/0.36
% 0.13/0.36 cnf(c30, plain,
% 0.13/0.36 ~sP1(X1)).
% 0.13/0.36 cnf(a10, assumption,
% 0.13/0.36 X7 = X1).
% 0.13/0.36 cnf(c31, plain,
% 0.13/0.36 sP0(X7) | ~sP2(X7),
% 0.13/0.36 inference(predicate_reduction, [assumptions([a10])], [c29, c30])).
% 0.13/0.36
% 0.13/0.36 cnf(c32, axiom,
% 0.13/0.36 cb(X8) | ~sP0(X8)).
% 0.13/0.36 cnf(a11, assumption,
% 0.13/0.36 X7 = X8).
% 0.13/0.36 cnf(c33, plain,
% 0.13/0.36 ~sP2(X7),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a11])], [c31, c32])).
% 0.13/0.36 cnf(c34, plain,
% 0.13/0.36 cb(X8),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a11])], [c31, c32])).
% 0.13/0.36
% 0.13/0.36 cnf(c35, axiom,
% 0.13/0.36 ~cc(X9) | ~cb(X9)).
% 0.13/0.36 cnf(a12, assumption,
% 0.13/0.36 X8 = X9).
% 0.13/0.36 cnf(c36, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a12])], [c34, c35])).
% 0.13/0.36 cnf(c37, plain,
% 0.13/0.36 ~cc(X9),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a12])], [c34, c35])).
% 0.13/0.36
% 0.13/0.36 cnf(c38, plain,
% 0.13/0.36 cc(X0)).
% 0.13/0.36 cnf(a13, assumption,
% 0.13/0.36 X9 = X0).
% 0.13/0.36 cnf(c39, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a13])], [c37, c38])).
% 0.13/0.36
% 0.13/0.36 cnf(c40, plain,
% 0.13/0.36 sP2(X1)).
% 0.13/0.36 cnf(a14, assumption,
% 0.13/0.36 X7 = X1).
% 0.13/0.36 cnf(c41, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a14])], [c33, c40])).
% 0.13/0.36
% 0.13/0.36 cnf(c42, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(constraint_solving, [
% 0.13/0.36 bind(X0, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X1, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X2, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X3, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X4, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X5, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X6, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X7, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X8, i2003_11_14_17_18_1956),
% 0.13/0.36 bind(X9, i2003_11_14_17_18_1956)
% 0.13/0.36 ],
% 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 0.13/0.36
% 0.13/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------