TSTP Solution File: LCL234-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL234-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 : n023.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:58 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL234-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.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 21:35:28 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.19/0.48 % SZS status Unsatisfiable
% 0.19/0.48 % SZS output begin IncompleteProof
% 0.19/0.48 cnf(c0, axiom,
% 0.19/0.48 ~theorem(or(not(p),or(not(q),not(or(not(p),not(q))))))).
% 0.19/0.48 cnf(c1, plain,
% 0.19/0.48 ~theorem(or(not(p),or(not(q),not(or(not(p),not(q)))))),
% 0.19/0.48 inference(start, [], [c0])).
% 0.19/0.48
% 0.19/0.48 cnf(c2, axiom,
% 0.19/0.48 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)).
% 0.19/0.48 cnf(a0, assumption,
% 0.19/0.48 or(not(p),or(not(q),not(or(not(p),not(q))))) = X1).
% 0.19/0.48 cnf(c3, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.48 cnf(c4, plain,
% 0.19/0.48 ~theorem(X0) | ~theorem(or(not(X0),X1)),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.48
% 0.19/0.48 cnf(c5, axiom,
% 0.19/0.48 ~theorem(X2) | ~theorem(or(not(X2),X3)) | theorem(X3)).
% 0.19/0.48 cnf(a1, assumption,
% 0.19/0.48 X0 = X3).
% 0.19/0.48 cnf(c6, plain,
% 0.19/0.48 ~theorem(or(not(X0),X1)),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.19/0.48 cnf(c7, plain,
% 0.19/0.48 ~theorem(X2) | ~theorem(or(not(X2),X3)),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.19/0.48
% 0.19/0.48 cnf(c8, axiom,
% 0.19/0.48 ~theorem(X4) | ~theorem(or(not(X4),X5)) | theorem(X5)).
% 0.19/0.48 cnf(a2, assumption,
% 0.19/0.48 X2 = X5).
% 0.19/0.48 cnf(c9, plain,
% 0.19/0.48 ~theorem(or(not(X2),X3)),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.19/0.48 cnf(c10, plain,
% 0.19/0.48 ~theorem(X4) | ~theorem(or(not(X4),X5)),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.19/0.48
% 0.19/0.48 cnf(c11, axiom,
% 0.19/0.48 ~axiom(X6) | theorem(X6)).
% 0.19/0.48 cnf(a3, assumption,
% 0.19/0.48 X4 = X6).
% 0.19/0.48 cnf(c12, plain,
% 0.19/0.48 ~theorem(or(not(X4),X5)),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.19/0.48 cnf(c13, plain,
% 0.19/0.48 ~axiom(X6),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.19/0.48
% 0.19/0.48 cnf(c14, axiom,
% 0.19/0.48 axiom(or(not(or(X7,X8)),or(X8,X7)))).
% 0.19/0.48 cnf(a4, assumption,
% 0.19/0.48 X6 = or(not(or(X7,X8)),or(X8,X7))).
% 0.19/0.48 cnf(c15, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.19/0.48 cnf(c16, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.19/0.48
% 0.19/0.48 cnf(c17, axiom,
% 0.19/0.48 ~axiom(X9) | theorem(X9)).
% 0.19/0.48 cnf(a5, assumption,
% 0.19/0.48 or(not(X4),X5) = X9).
% 0.19/0.48 cnf(c18, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a5])], [c12, c17])).
% 0.19/0.48 cnf(c19, plain,
% 0.19/0.48 ~axiom(X9),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a5])], [c12, c17])).
% 0.19/0.48
% 0.19/0.48 cnf(c20, axiom,
% 0.19/0.48 axiom(or(not(or(X10,or(X11,X12))),or(X11,or(X10,X12))))).
% 0.19/0.48 cnf(a6, assumption,
% 0.19/0.48 X9 = or(not(or(X10,or(X11,X12))),or(X11,or(X10,X12)))).
% 0.19/0.48 cnf(c21, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.19/0.48 cnf(c22, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.19/0.48
% 0.19/0.48 cnf(c23, axiom,
% 0.19/0.48 ~theorem(X13) | ~theorem(or(not(X13),X14)) | theorem(X14)).
% 0.19/0.48 cnf(a7, assumption,
% 0.19/0.48 or(not(X2),X3) = X14).
% 0.19/0.48 cnf(c24, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a7])], [c9, c23])).
% 0.19/0.48 cnf(c25, plain,
% 0.19/0.48 ~theorem(X13) | ~theorem(or(not(X13),X14)),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a7])], [c9, c23])).
% 0.19/0.48
% 0.19/0.48 cnf(c26, axiom,
% 0.19/0.48 ~axiom(X15) | theorem(X15)).
% 0.19/0.48 cnf(a8, assumption,
% 0.19/0.48 X13 = X15).
% 0.19/0.48 cnf(c27, plain,
% 0.19/0.48 ~theorem(or(not(X13),X14)),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 0.19/0.48 cnf(c28, plain,
% 0.19/0.48 ~axiom(X15),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 0.19/0.48
% 0.19/0.48 cnf(c29, axiom,
% 0.19/0.48 axiom(or(not(or(X16,X17)),or(X17,X16)))).
% 0.19/0.48 cnf(a9, assumption,
% 0.19/0.48 X15 = or(not(or(X16,X17)),or(X17,X16))).
% 0.19/0.48 cnf(c30, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])).
% 0.19/0.48 cnf(c31, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])).
% 0.19/0.48
% 0.19/0.48 cnf(c32, axiom,
% 0.19/0.48 ~axiom(X18) | theorem(X18)).
% 0.19/0.48 cnf(a10, assumption,
% 0.19/0.48 or(not(X13),X14) = X18).
% 0.19/0.48 cnf(c33, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a10])], [c27, c32])).
% 0.19/0.48 cnf(c34, plain,
% 0.19/0.48 ~axiom(X18),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a10])], [c27, c32])).
% 0.19/0.48
% 0.19/0.48 cnf(c35, axiom,
% 0.19/0.48 axiom(or(not(or(not(X19),X20)),or(not(or(X21,X19)),or(X21,X20))))).
% 0.19/0.48 cnf(a11, assumption,
% 0.19/0.48 X18 = or(not(or(not(X19),X20)),or(not(or(X21,X19)),or(X21,X20)))).
% 0.19/0.48 cnf(c36, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 0.19/0.48 cnf(c37, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 0.19/0.48
% 0.19/0.48 cnf(c38, axiom,
% 0.19/0.48 ~axiom(X22) | theorem(X22)).
% 0.19/0.48 cnf(a12, assumption,
% 0.19/0.48 or(not(X0),X1) = X22).
% 0.19/0.48 cnf(c39, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a12])], [c6, c38])).
% 0.19/0.48 cnf(c40, plain,
% 0.19/0.48 ~axiom(X22),
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a12])], [c6, c38])).
% 0.19/0.48
% 0.19/0.48 cnf(c41, axiom,
% 0.19/0.48 axiom(or(not(or(X23,or(X24,X25))),or(X24,or(X23,X25))))).
% 0.19/0.48 cnf(a13, assumption,
% 0.19/0.48 X22 = or(not(or(X23,or(X24,X25))),or(X24,or(X23,X25)))).
% 0.19/0.48 cnf(c42, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 0.19/0.48 cnf(c43, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 0.19/0.48
% 0.19/0.48 cnf(c44, plain,
% 0.19/0.48 $false,
% 0.19/0.48 inference(constraint_solving, [
% 0.19/0.48 bind(X0, or(X21,X20)),
% 0.19/0.48 bind(X1, or(not(p),or(not(q),not(or(not(p),not(q)))))),
% 0.19/0.48 bind(X2, or(X11,or(X10,X12))),
% 0.19/0.48 bind(X3, or(X21,X20)),
% 0.19/0.48 bind(X4, or(not(or(X7,X8)),or(X8,X7))),
% 0.19/0.48 bind(X5, or(X11,or(X10,X12))),
% 0.19/0.48 bind(X6, or(not(or(X7,X8)),or(X8,X7))),
% 0.19/0.48 bind(X7, not(p)),
% 0.19/0.48 bind(X8, not(q)),
% 0.19/0.48 bind(X9, or(not(X4),X5)),
% 0.19/0.48 bind(X10, not(or(X7,X8))),
% 0.19/0.48 bind(X11, not(q)),
% 0.19/0.48 bind(X12, not(p)),
% 0.19/0.48 bind(X13, or(not(or(X16,X17)),or(X17,X16))),
% 0.19/0.48 bind(X14, or(not(X2),X3)),
% 0.19/0.48 bind(X15, or(not(or(X16,X17)),or(X17,X16))),
% 0.19/0.48 bind(X16, not(or(X7,X8))),
% 0.19/0.48 bind(X17, not(p)),
% 0.19/0.48 bind(X18, or(not(X13),X14)),
% 0.19/0.48 bind(X19, or(X16,X17)),
% 0.19/0.48 bind(X20, or(X17,X16)),
% 0.19/0.48 bind(X21, not(q)),
% 0.19/0.48 bind(X22, or(not(X0),X1)),
% 0.19/0.48 bind(X23, not(q)),
% 0.19/0.48 bind(X24, not(p)),
% 0.19/0.48 bind(X25, not(or(X7,X8)))
% 0.19/0.48 ],
% 0.19/0.48 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.19/0.48
% 0.19/0.48 % SZS output end IncompleteProof
%------------------------------------------------------------------------------