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