TSTP Solution File: KRS215+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KRS215+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n020.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:16 EDT 2022
% Result : Theorem 0.22s 0.42s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS215+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.04/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Tue Jun 7 17:32:36 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.42 % SZS status Theorem
% 0.22/0.42 % SZS output begin IncompleteProof
% 0.22/0.42 cnf(c0, axiom,
% 0.22/0.42 ~nota(csa,thm)).
% 0.22/0.42 cnf(c1, plain,
% 0.22/0.42 ~nota(csa,thm),
% 0.22/0.42 inference(start, [], [c0])).
% 0.22/0.42
% 0.22/0.42 cnf(c2, axiom,
% 0.22/0.42 nota(X0,X1) | status(X2,X3,X1) | ~status(X2,X3,X0)).
% 0.22/0.42 cnf(a0, assumption,
% 0.22/0.42 csa = X0).
% 0.22/0.42 cnf(a1, assumption,
% 0.22/0.42 thm = X1).
% 0.22/0.42 cnf(c3, plain,
% 0.22/0.42 $false,
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.22/0.42 cnf(c4, plain,
% 0.22/0.42 status(X2,X3,X1) | ~status(X2,X3,X0),
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.22/0.42
% 0.22/0.42 cnf(c5, axiom,
% 0.22/0.42 model(X4,X5) | ~model(X4,X6) | ~status(X6,X5,thm)).
% 0.22/0.42 cnf(a2, assumption,
% 0.22/0.42 X2 = X6).
% 0.22/0.42 cnf(a3, assumption,
% 0.22/0.42 X3 = X5).
% 0.22/0.42 cnf(a4, assumption,
% 0.22/0.42 X1 = thm).
% 0.22/0.42 cnf(c6, plain,
% 0.22/0.42 ~status(X2,X3,X0),
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.22/0.42 cnf(c7, plain,
% 0.22/0.42 model(X4,X5) | ~model(X4,X6),
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.22/0.42
% 0.22/0.42 cnf(c8, axiom,
% 0.22/0.42 ~model(X7,sK63)).
% 0.22/0.42 cnf(a5, assumption,
% 0.22/0.42 X4 = X7).
% 0.22/0.42 cnf(a6, assumption,
% 0.22/0.42 X5 = sK63).
% 0.22/0.42 cnf(c9, plain,
% 0.22/0.42 ~model(X4,X6),
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 0.22/0.42 cnf(c10, plain,
% 0.22/0.42 $false,
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 0.22/0.42
% 0.22/0.42 cnf(c11, axiom,
% 0.22/0.42 model(sK62,sK60)).
% 0.22/0.42 cnf(a7, assumption,
% 0.22/0.42 X4 = sK62).
% 0.22/0.42 cnf(a8, assumption,
% 0.22/0.42 X6 = sK60).
% 0.22/0.42 cnf(c12, plain,
% 0.22/0.42 $false,
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c11])).
% 0.22/0.42 cnf(c13, plain,
% 0.22/0.42 $false,
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c11])).
% 0.22/0.42
% 0.22/0.42 cnf(c14, axiom,
% 0.22/0.42 status(X8,X9,csa) | ~model(X10,not(X9)) | ~model(X10,X8)).
% 0.22/0.42 cnf(a9, assumption,
% 0.22/0.42 X2 = X8).
% 0.22/0.42 cnf(a10, assumption,
% 0.22/0.42 X3 = X9).
% 0.22/0.42 cnf(a11, assumption,
% 0.22/0.42 X0 = csa).
% 0.22/0.42 cnf(c15, plain,
% 0.22/0.42 $false,
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c6, c14])).
% 0.22/0.42 cnf(c16, plain,
% 0.22/0.42 ~model(X10,not(X9)) | ~model(X10,X8),
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c6, c14])).
% 0.22/0.42
% 0.22/0.42 cnf(c17, axiom,
% 0.22/0.42 model(X11,X12) | model(X11,not(X12))).
% 0.22/0.42 cnf(a12, assumption,
% 0.22/0.42 X10 = X11).
% 0.22/0.42 cnf(a13, assumption,
% 0.22/0.42 not(X9) = not(X12)).
% 0.22/0.42 cnf(c18, plain,
% 0.22/0.42 ~model(X10,X8),
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a12, a13])], [c16, c17])).
% 0.22/0.42 cnf(c19, plain,
% 0.22/0.42 model(X11,X12),
% 0.22/0.42 inference(strict_predicate_extension, [assumptions([a12, a13])], [c16, c17])).
% 0.22/0.42
% 0.22/0.42 cnf(c20, plain,
% 0.22/0.42 ~model(X4,X5)).
% 0.22/0.42 cnf(a14, assumption,
% 0.22/0.42 X11 = X4).
% 0.22/0.42 cnf(a15, assumption,
% 0.22/0.42 X12 = X5).
% 0.22/0.42 cnf(c21, plain,
% 0.22/0.42 $false,
% 0.22/0.42 inference(predicate_reduction, [assumptions([a14, a15])], [c19, c20])).
% 0.22/0.42
% 0.22/0.42 cnf(c22, plain,
% 0.22/0.42 model(X4,X6)).
% 0.22/0.42 cnf(a16, assumption,
% 0.22/0.42 X10 = X4).
% 0.22/0.42 cnf(a17, assumption,
% 0.22/0.42 X8 = X6).
% 0.22/0.42 cnf(c23, plain,
% 0.22/0.42 $false,
% 0.22/0.42 inference(predicate_reduction, [assumptions([a16, a17])], [c18, c22])).
% 0.22/0.42
% 0.22/0.42 cnf(c24, plain,
% 0.22/0.42 $false,
% 0.22/0.42 inference(constraint_solving, [
% 0.22/0.42 bind(X0, csa),
% 0.22/0.42 bind(X1, thm),
% 0.22/0.42 bind(X2, sK60),
% 0.22/0.42 bind(X3, sK63),
% 0.22/0.42 bind(X4, sK62),
% 0.22/0.42 bind(X5, sK63),
% 0.22/0.42 bind(X6, sK60),
% 0.22/0.42 bind(X7, sK62),
% 0.22/0.42 bind(X8, sK60),
% 0.22/0.42 bind(X9, sK63),
% 0.22/0.42 bind(X10, sK62),
% 0.22/0.42 bind(X11, sK62),
% 0.22/0.42 bind(X12, sK63)
% 0.22/0.42 ],
% 0.22/0.42 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.22/0.42
% 0.22/0.42 % SZS output end IncompleteProof
%------------------------------------------------------------------------------