TSTP Solution File: LCL197-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL197-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 : n012.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:35 EDT 2022
% Result : Unsatisfiable 0.20s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL197-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n012.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 22:04:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.36 % SZS status Unsatisfiable
% 0.20/0.36 % SZS output begin IncompleteProof
% 0.20/0.36 cnf(c0, axiom,
% 0.20/0.36 ~theorem(or(not(or(q,or(p,q))),or(p,q)))).
% 0.20/0.36 cnf(c1, plain,
% 0.20/0.36 ~theorem(or(not(or(q,or(p,q))),or(p,q))),
% 0.20/0.36 inference(start, [], [c0])).
% 0.20/0.36
% 0.20/0.36 cnf(c2, axiom,
% 0.20/0.36 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)).
% 0.20/0.36 cnf(a0, assumption,
% 0.20/0.36 or(not(or(q,or(p,q))),or(p,q)) = X1).
% 0.20/0.36 cnf(c3, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.36 cnf(c4, plain,
% 0.20/0.36 ~theorem(X0) | ~theorem(or(not(X0),X1)),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.36
% 0.20/0.36 cnf(c5, axiom,
% 0.20/0.36 ~axiom(X2) | theorem(X2)).
% 0.20/0.36 cnf(a1, assumption,
% 0.20/0.36 X0 = X2).
% 0.20/0.36 cnf(c6, plain,
% 0.20/0.36 ~theorem(or(not(X0),X1)),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.36 cnf(c7, plain,
% 0.20/0.36 ~axiom(X2),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.36
% 0.20/0.36 cnf(c8, axiom,
% 0.20/0.36 axiom(or(not(or(X3,or(X4,X5))),or(X4,or(X3,X5))))).
% 0.20/0.36 cnf(a2, assumption,
% 0.20/0.36 X2 = or(not(or(X3,or(X4,X5))),or(X4,or(X3,X5)))).
% 0.20/0.36 cnf(c9, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.20/0.36 cnf(c10, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.20/0.36
% 0.20/0.36 cnf(c11, axiom,
% 0.20/0.36 ~theorem(X6) | ~theorem(or(not(X6),X7)) | theorem(X7)).
% 0.20/0.36 cnf(a3, assumption,
% 0.20/0.36 or(not(X0),X1) = X7).
% 0.20/0.36 cnf(c12, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 0.20/0.36 cnf(c13, plain,
% 0.20/0.36 ~theorem(X6) | ~theorem(or(not(X6),X7)),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 0.20/0.36
% 0.20/0.36 cnf(c14, axiom,
% 0.20/0.36 ~theorem(X8) | ~theorem(or(not(X8),X9)) | theorem(X9)).
% 0.20/0.36 cnf(a4, assumption,
% 0.20/0.36 X6 = X9).
% 0.20/0.36 cnf(c15, plain,
% 0.20/0.36 ~theorem(or(not(X6),X7)),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.20/0.36 cnf(c16, plain,
% 0.20/0.36 ~theorem(X8) | ~theorem(or(not(X8),X9)),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.20/0.36
% 0.20/0.36 cnf(c17, axiom,
% 0.20/0.36 ~axiom(X10) | theorem(X10)).
% 0.20/0.36 cnf(a5, assumption,
% 0.20/0.36 X8 = X10).
% 0.20/0.36 cnf(c18, plain,
% 0.20/0.36 ~theorem(or(not(X8),X9)),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.20/0.36 cnf(c19, plain,
% 0.20/0.36 ~axiom(X10),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.20/0.36
% 0.20/0.36 cnf(c20, axiom,
% 0.20/0.36 axiom(or(not(or(X11,X11)),X11))).
% 0.20/0.36 cnf(a6, assumption,
% 0.20/0.36 X10 = or(not(or(X11,X11)),X11)).
% 0.20/0.36 cnf(c21, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.20/0.36 cnf(c22, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.20/0.36
% 0.20/0.36 cnf(c23, axiom,
% 0.20/0.36 ~axiom(X12) | theorem(X12)).
% 0.20/0.36 cnf(a7, assumption,
% 0.20/0.36 or(not(X8),X9) = X12).
% 0.20/0.36 cnf(c24, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 0.20/0.36 cnf(c25, plain,
% 0.20/0.36 ~axiom(X12),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 0.20/0.36
% 0.20/0.36 cnf(c26, axiom,
% 0.20/0.36 axiom(or(not(or(not(X13),X14)),or(not(or(X15,X13)),or(X15,X14))))).
% 0.20/0.36 cnf(a8, assumption,
% 0.20/0.36 X12 = or(not(or(not(X13),X14)),or(not(or(X15,X13)),or(X15,X14)))).
% 0.20/0.36 cnf(c27, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 0.20/0.36 cnf(c28, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 0.20/0.36
% 0.20/0.36 cnf(c29, axiom,
% 0.20/0.36 ~axiom(X16) | theorem(X16)).
% 0.20/0.36 cnf(a9, assumption,
% 0.20/0.36 or(not(X6),X7) = X16).
% 0.20/0.36 cnf(c30, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a9])], [c15, c29])).
% 0.20/0.36 cnf(c31, plain,
% 0.20/0.36 ~axiom(X16),
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a9])], [c15, c29])).
% 0.20/0.36
% 0.20/0.36 cnf(c32, axiom,
% 0.20/0.36 axiom(or(not(or(not(X17),X18)),or(not(or(X19,X17)),or(X19,X18))))).
% 0.20/0.36 cnf(a10, assumption,
% 0.20/0.36 X16 = or(not(or(not(X17),X18)),or(not(or(X19,X17)),or(X19,X18)))).
% 0.20/0.36 cnf(c33, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a10])], [c31, c32])).
% 0.20/0.36 cnf(c34, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(strict_predicate_extension, [assumptions([a10])], [c31, c32])).
% 0.20/0.36
% 0.20/0.36 cnf(c35, plain,
% 0.20/0.36 $false,
% 0.20/0.36 inference(constraint_solving, [
% 0.20/0.36 bind(X0, or(not(or(X3,or(X4,X5))),or(X4,or(X3,X5)))),
% 0.20/0.36 bind(X1, or(not(or(q,or(p,q))),or(p,q))),
% 0.20/0.36 bind(X2, or(not(or(X3,or(X4,X5))),or(X4,or(X3,X5)))),
% 0.20/0.36 bind(X3, q),
% 0.20/0.36 bind(X4, p),
% 0.20/0.36 bind(X5, q),
% 0.20/0.36 bind(X6, or(not(or(X15,X13)),or(X15,X14))),
% 0.20/0.36 bind(X7, or(not(X0),X1)),
% 0.20/0.36 bind(X8, or(not(or(X11,X11)),X11)),
% 0.20/0.36 bind(X9, or(not(or(X15,X13)),or(X15,X14))),
% 0.20/0.36 bind(X10, or(not(or(X11,X11)),X11)),
% 0.20/0.36 bind(X11, q),
% 0.20/0.36 bind(X12, or(not(X8),X9)),
% 0.20/0.36 bind(X13, or(X11,X11)),
% 0.20/0.36 bind(X14, q),
% 0.20/0.36 bind(X15, p),
% 0.20/0.36 bind(X16, or(not(X6),X7)),
% 0.20/0.36 bind(X17, or(X15,X13)),
% 0.20/0.36 bind(X18, or(X15,X14)),
% 0.20/0.36 bind(X19, not(or(X3,or(X4,X5))))
% 0.20/0.36 ],
% 0.20/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.20/0.36
% 0.20/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------