TSTP Solution File: LCL272-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL272-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n004.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:08:16 EDT 2022
% Result : Unsatisfiable 1.90s 0.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL272-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n004.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 : Mon Jul 4 17:06:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.90/0.57 % SZS status Unsatisfiable
% 1.90/0.57 % SZS output begin IncompleteProof
% 1.90/0.57 cnf(c0, axiom,
% 1.90/0.57 ~theorem(not(or(not(or(not(p),or(p,p))),not(or(not(or(p,p)),p)))))).
% 1.90/0.57 cnf(c1, plain,
% 1.90/0.57 ~theorem(not(or(not(or(not(p),or(p,p))),not(or(not(or(p,p)),p))))),
% 1.90/0.57 inference(start, [], [c0])).
% 1.90/0.57
% 1.90/0.57 cnf(c2, axiom,
% 1.90/0.57 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)).
% 1.90/0.57 cnf(a0, assumption,
% 1.90/0.57 not(or(not(or(not(p),or(p,p))),not(or(not(or(p,p)),p)))) = X1).
% 1.90/0.57 cnf(c3, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 1.90/0.57 cnf(c4, plain,
% 1.90/0.57 ~theorem(X0) | ~theorem(or(not(X0),X1)),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 1.90/0.57
% 1.90/0.57 cnf(c5, axiom,
% 1.90/0.57 ~axiom(X2) | theorem(X2)).
% 1.90/0.57 cnf(a1, assumption,
% 1.90/0.57 X0 = X2).
% 1.90/0.57 cnf(c6, plain,
% 1.90/0.57 ~theorem(or(not(X0),X1)),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 1.90/0.57 cnf(c7, plain,
% 1.90/0.57 ~axiom(X2),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 1.90/0.57
% 1.90/0.57 cnf(c8, axiom,
% 1.90/0.57 axiom(or(not(X3),or(X4,X3)))).
% 1.90/0.57 cnf(a2, assumption,
% 1.90/0.57 X2 = or(not(X3),or(X4,X3))).
% 1.90/0.57 cnf(c9, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 1.90/0.57 cnf(c10, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 1.90/0.57
% 1.90/0.57 cnf(c11, axiom,
% 1.90/0.57 ~theorem(X5) | ~theorem(or(not(X5),X6)) | theorem(X6)).
% 1.90/0.57 cnf(a3, assumption,
% 1.90/0.57 or(not(X0),X1) = X6).
% 1.90/0.57 cnf(c12, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 1.90/0.57 cnf(c13, plain,
% 1.90/0.57 ~theorem(X5) | ~theorem(or(not(X5),X6)),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 1.90/0.57
% 1.90/0.57 cnf(c14, axiom,
% 1.90/0.57 ~theorem(X7) | ~theorem(or(not(X7),X8)) | theorem(X8)).
% 1.90/0.57 cnf(a4, assumption,
% 1.90/0.57 X5 = X8).
% 1.90/0.57 cnf(c15, plain,
% 1.90/0.57 ~theorem(or(not(X5),X6)),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 1.90/0.57 cnf(c16, plain,
% 1.90/0.57 ~theorem(X7) | ~theorem(or(not(X7),X8)),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 1.90/0.57
% 1.90/0.57 cnf(c17, axiom,
% 1.90/0.57 ~axiom(X9) | theorem(X9)).
% 1.90/0.57 cnf(a5, assumption,
% 1.90/0.57 X7 = X9).
% 1.90/0.57 cnf(c18, plain,
% 1.90/0.57 ~theorem(or(not(X7),X8)),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 1.90/0.57 cnf(c19, plain,
% 1.90/0.57 ~axiom(X9),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 1.90/0.57
% 1.90/0.57 cnf(c20, axiom,
% 1.90/0.57 axiom(or(not(or(X10,X10)),X10))).
% 1.90/0.57 cnf(a6, assumption,
% 1.90/0.57 X9 = or(not(or(X10,X10)),X10)).
% 1.90/0.57 cnf(c21, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 1.90/0.57 cnf(c22, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 1.90/0.57
% 1.90/0.57 cnf(c23, axiom,
% 1.90/0.57 ~theorem(X11) | ~theorem(or(not(X11),X12)) | theorem(X12)).
% 1.90/0.57 cnf(a7, assumption,
% 1.90/0.57 or(not(X7),X8) = X12).
% 1.90/0.57 cnf(c24, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 1.90/0.57 cnf(c25, plain,
% 1.90/0.57 ~theorem(X11) | ~theorem(or(not(X11),X12)),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 1.90/0.57
% 1.90/0.57 cnf(c26, axiom,
% 1.90/0.57 ~axiom(X13) | theorem(X13)).
% 1.90/0.57 cnf(a8, assumption,
% 1.90/0.57 X11 = X13).
% 1.90/0.57 cnf(c27, plain,
% 1.90/0.57 ~theorem(or(not(X11),X12)),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 1.90/0.57 cnf(c28, plain,
% 1.90/0.57 ~axiom(X13),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 1.90/0.57
% 1.90/0.57 cnf(c29, axiom,
% 1.90/0.57 axiom(or(not(or(X14,X15)),or(X15,X14)))).
% 1.90/0.57 cnf(a9, assumption,
% 1.90/0.57 X13 = or(not(or(X14,X15)),or(X15,X14))).
% 1.90/0.57 cnf(c30, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])).
% 1.90/0.57 cnf(c31, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])).
% 1.90/0.57
% 1.90/0.57 cnf(c32, axiom,
% 1.90/0.57 ~axiom(X16) | theorem(X16)).
% 1.90/0.57 cnf(a10, assumption,
% 1.90/0.57 or(not(X11),X12) = X16).
% 1.90/0.57 cnf(c33, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a10])], [c27, c32])).
% 1.90/0.57 cnf(c34, plain,
% 1.90/0.57 ~axiom(X16),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a10])], [c27, c32])).
% 1.90/0.57
% 1.90/0.57 cnf(c35, axiom,
% 1.90/0.57 axiom(or(not(or(X17,or(X18,X19))),or(X18,or(X17,X19))))).
% 1.90/0.57 cnf(a11, assumption,
% 1.90/0.57 X16 = or(not(or(X17,or(X18,X19))),or(X18,or(X17,X19)))).
% 1.90/0.57 cnf(c36, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 1.90/0.57 cnf(c37, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 1.90/0.57
% 1.90/0.57 cnf(c38, axiom,
% 1.90/0.57 ~axiom(X20) | theorem(X20)).
% 1.90/0.57 cnf(a12, assumption,
% 1.90/0.57 or(not(X5),X6) = X20).
% 1.90/0.57 cnf(c39, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a12])], [c15, c38])).
% 1.90/0.57 cnf(c40, plain,
% 1.90/0.57 ~axiom(X20),
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a12])], [c15, c38])).
% 1.90/0.57
% 1.90/0.57 cnf(c41, axiom,
% 1.90/0.57 axiom(or(not(or(X21,X22)),or(X22,X21)))).
% 1.90/0.57 cnf(a13, assumption,
% 1.90/0.57 X20 = or(not(or(X21,X22)),or(X22,X21))).
% 1.90/0.57 cnf(c42, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 1.90/0.57 cnf(c43, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 1.90/0.57
% 1.90/0.57 cnf(c44, plain,
% 1.90/0.57 $false,
% 1.90/0.57 inference(constraint_solving, [
% 1.90/0.57 bind(X0, or(not(X3),or(X4,X3))),
% 1.90/0.57 bind(X1, not(or(not(or(not(p),or(p,p))),not(or(not(or(p,p)),p))))),
% 1.90/0.57 bind(X2, or(not(X3),or(X4,X3))),
% 1.90/0.57 bind(X3, p),
% 1.90/0.57 bind(X4, p),
% 1.90/0.57 bind(X5, or(X17,X19)),
% 1.90/0.57 bind(X6, or(not(X0),X1)),
% 1.90/0.57 bind(X7, or(not(or(X10,X10)),X10)),
% 1.90/0.57 bind(X8, or(X17,X19)),
% 1.90/0.57 bind(X9, or(not(or(X10,X10)),X10)),
% 1.90/0.57 bind(X10, p),
% 1.90/0.57 bind(X11, or(not(or(X14,X15)),or(X15,X14))),
% 1.90/0.57 bind(X12, or(not(X7),X8)),
% 1.90/0.57 bind(X13, or(not(or(X14,X15)),or(X15,X14))),
% 1.90/0.57 bind(X14, not(X0)),
% 1.90/0.57 bind(X15, not(X7)),
% 1.90/0.57 bind(X16, or(not(X11),X12)),
% 1.90/0.57 bind(X17, not(or(X14,X15))),
% 1.90/0.57 bind(X18, not(X7)),
% 1.90/0.57 bind(X19, not(X0)),
% 1.90/0.57 bind(X20, or(not(X5),X6)),
% 1.90/0.57 bind(X21, not(or(X14,X15))),
% 1.90/0.57 bind(X22, not(X0))
% 1.90/0.57 ],
% 1.90/0.57 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 1.90/0.57
% 1.90/0.57 % SZS output end IncompleteProof
%------------------------------------------------------------------------------