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