TSTP Solution File: LCL182-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL182-1 : TPTP v8.1.0. Released v1.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 : 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 : 600s
% DateTime : Sun Jul 17 12:07:25 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL182-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 17:31:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51 % SZS status Unsatisfiable
% 0.20/0.51 % SZS output begin IncompleteProof
% 0.20/0.51 cnf(c0, axiom,
% 0.20/0.51 ~theorem(or(not(or(not(p),q)),or(not(not(q)),not(p))))).
% 0.20/0.51 cnf(c1, plain,
% 0.20/0.51 ~theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))),
% 0.20/0.51 inference(start, [], [c0])).
% 0.20/0.51
% 0.20/0.51 cnf(c2, axiom,
% 0.20/0.51 ~theorem(X0) | ~axiom(or(not(X0),X1)) | theorem(X1)).
% 0.20/0.51 cnf(a0, assumption,
% 0.20/0.51 or(not(or(not(p),q)),or(not(not(q)),not(p))) = X1).
% 0.20/0.51 cnf(c3, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.51 cnf(c4, plain,
% 0.20/0.51 ~theorem(X0) | ~axiom(or(not(X0),X1)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.51
% 0.20/0.51 cnf(c5, axiom,
% 0.20/0.51 ~theorem(or(not(X2),X3)) | ~axiom(or(not(X4),X2)) | theorem(or(not(X4),X3))).
% 0.20/0.51 cnf(a1, assumption,
% 0.20/0.51 X0 = or(not(X4),X3)).
% 0.20/0.51 cnf(c6, plain,
% 0.20/0.51 ~axiom(or(not(X0),X1)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.51 cnf(c7, plain,
% 0.20/0.51 ~theorem(or(not(X2),X3)) | ~axiom(or(not(X4),X2)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.51
% 0.20/0.51 cnf(c8, axiom,
% 0.20/0.51 ~theorem(or(not(X5),X6)) | ~axiom(or(not(X7),X5)) | theorem(or(not(X7),X6))).
% 0.20/0.51 cnf(a2, assumption,
% 0.20/0.51 or(not(X2),X3) = or(not(X7),X6)).
% 0.20/0.51 cnf(c9, plain,
% 0.20/0.51 ~axiom(or(not(X4),X2)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.20/0.51 cnf(c10, plain,
% 0.20/0.51 ~theorem(or(not(X5),X6)) | ~axiom(or(not(X7),X5)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.20/0.51
% 0.20/0.51 cnf(c11, axiom,
% 0.20/0.51 ~theorem(or(not(X8),X9)) | ~axiom(or(not(X10),X8)) | theorem(or(not(X10),X9))).
% 0.20/0.51 cnf(a3, assumption,
% 0.20/0.51 or(not(X5),X6) = or(not(X10),X9)).
% 0.20/0.51 cnf(c12, plain,
% 0.20/0.51 ~axiom(or(not(X7),X5)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.20/0.51 cnf(c13, plain,
% 0.20/0.51 ~theorem(or(not(X8),X9)) | ~axiom(or(not(X10),X8)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.20/0.51
% 0.20/0.51 cnf(c14, axiom,
% 0.20/0.51 ~theorem(X11) | ~axiom(or(not(X11),X12)) | theorem(X12)).
% 0.20/0.51 cnf(a4, assumption,
% 0.20/0.51 or(not(X8),X9) = X12).
% 0.20/0.51 cnf(c15, plain,
% 0.20/0.51 ~axiom(or(not(X10),X8)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.20/0.51 cnf(c16, plain,
% 0.20/0.51 ~theorem(X11) | ~axiom(or(not(X11),X12)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.20/0.51
% 0.20/0.51 cnf(c17, axiom,
% 0.20/0.51 ~axiom(X13) | theorem(X13)).
% 0.20/0.51 cnf(a5, assumption,
% 0.20/0.51 X11 = X13).
% 0.20/0.51 cnf(c18, plain,
% 0.20/0.51 ~axiom(or(not(X11),X12)),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.20/0.51 cnf(c19, plain,
% 0.20/0.51 ~axiom(X13),
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.20/0.51
% 0.20/0.51 cnf(c20, axiom,
% 0.20/0.51 axiom(or(not(or(X14,X14)),X14))).
% 0.20/0.51 cnf(a6, assumption,
% 0.20/0.51 X13 = or(not(or(X14,X14)),X14)).
% 0.20/0.51 cnf(c21, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.20/0.51 cnf(c22, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.20/0.51
% 0.20/0.51 cnf(c23, axiom,
% 0.20/0.51 axiom(or(not(or(not(X15),X16)),or(not(or(X17,X15)),or(X17,X16))))).
% 0.20/0.51 cnf(a7, assumption,
% 0.20/0.51 or(not(X11),X12) = or(not(or(not(X15),X16)),or(not(or(X17,X15)),or(X17,X16)))).
% 0.20/0.51 cnf(c24, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 0.20/0.51 cnf(c25, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 0.20/0.51
% 0.20/0.51 cnf(c26, axiom,
% 0.20/0.51 axiom(or(not(or(not(X18),X19)),or(not(or(X20,X18)),or(X20,X19))))).
% 0.20/0.51 cnf(a8, assumption,
% 0.20/0.51 or(not(X10),X8) = or(not(or(not(X18),X19)),or(not(or(X20,X18)),or(X20,X19)))).
% 0.20/0.51 cnf(c27, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a8])], [c15, c26])).
% 0.20/0.51 cnf(c28, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a8])], [c15, c26])).
% 0.20/0.51
% 0.20/0.51 cnf(c29, axiom,
% 0.20/0.51 axiom(or(not(or(X21,X22)),or(X22,X21)))).
% 0.20/0.51 cnf(a9, assumption,
% 0.20/0.51 or(not(X7),X5) = or(not(or(X21,X22)),or(X22,X21))).
% 0.20/0.51 cnf(c30, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a9])], [c12, c29])).
% 0.20/0.51 cnf(c31, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a9])], [c12, c29])).
% 0.20/0.51
% 0.20/0.51 cnf(c32, axiom,
% 0.20/0.51 axiom(or(not(X23),or(X24,X23)))).
% 0.20/0.51 cnf(a10, assumption,
% 0.20/0.51 or(not(X4),X2) = or(not(X23),or(X24,X23))).
% 0.20/0.51 cnf(c33, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a10])], [c9, c32])).
% 0.20/0.51 cnf(c34, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a10])], [c9, c32])).
% 0.20/0.51
% 0.20/0.51 cnf(c35, axiom,
% 0.20/0.51 axiom(or(not(or(X25,or(X26,X27))),or(X26,or(X25,X27))))).
% 0.20/0.51 cnf(a11, assumption,
% 0.20/0.51 or(not(X0),X1) = or(not(or(X25,or(X26,X27))),or(X26,or(X25,X27)))).
% 0.20/0.51 cnf(c36, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a11])], [c6, c35])).
% 0.20/0.51 cnf(c37, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(strict_predicate_extension, [assumptions([a11])], [c6, c35])).
% 0.20/0.51
% 0.20/0.51 cnf(c38, plain,
% 0.20/0.51 $false,
% 0.20/0.51 inference(constraint_solving, [
% 0.20/0.51 bind(X0, or(not(X4),X3)),
% 0.20/0.51 bind(X1, or(not(or(not(p),q)),or(not(not(q)),not(p)))),
% 0.20/0.51 bind(X2, or(X21,X22)),
% 0.20/0.51 bind(X3, or(X17,X16)),
% 0.20/0.51 bind(X4, not(X18)),
% 0.20/0.51 bind(X5, or(not(X18),X19)),
% 0.20/0.51 bind(X6, or(X17,X16)),
% 0.20/0.51 bind(X7, or(X21,X22)),
% 0.20/0.51 bind(X8, or(X17,X15)),
% 0.20/0.51 bind(X9, or(X17,X16)),
% 0.20/0.51 bind(X10, or(not(X18),X19)),
% 0.20/0.51 bind(X11, or(not(or(X14,X14)),X14)),
% 0.20/0.51 bind(X12, or(not(X8),X9)),
% 0.20/0.51 bind(X13, or(not(or(X14,X14)),X14)),
% 0.20/0.51 bind(X14, not(p)),
% 0.20/0.51 bind(X15, or(X14,X14)),
% 0.20/0.51 bind(X16, not(p)),
% 0.20/0.51 bind(X17, not(or(X20,X18))),
% 0.20/0.51 bind(X18, q),
% 0.20/0.51 bind(X19, not(p)),
% 0.20/0.51 bind(X20, not(p)),
% 0.20/0.51 bind(X21, not(p)),
% 0.20/0.51 bind(X22, not(X18)),
% 0.20/0.51 bind(X23, not(X18)),
% 0.20/0.51 bind(X24, not(p)),
% 0.20/0.51 bind(X25, not(X4)),
% 0.20/0.51 bind(X26, not(or(X20,X18))),
% 0.20/0.51 bind(X27, not(p))
% 0.20/0.51 ],
% 0.20/0.51 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.20/0.51
% 0.20/0.51 % SZS output end IncompleteProof
%------------------------------------------------------------------------------