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