TSTP Solution File: LCL176-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL176-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 : n010.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:21 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL176-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.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 04:48:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % SZS status Unsatisfiable
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 ~theorem(or(not(p),p))).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 ~theorem(or(not(p),p)),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 or(not(p),p) = X1).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 ~theorem(X0) | ~theorem(or(not(X0),X1)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 ~axiom(X2) | theorem(X2)).
% 0.12/0.35 cnf(a1, assumption,
% 0.12/0.35 X0 = X2).
% 0.12/0.35 cnf(c6, plain,
% 0.12/0.35 ~theorem(or(not(X0),X1)),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.35 cnf(c7, plain,
% 0.12/0.35 ~axiom(X2),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.35
% 0.12/0.35 cnf(c8, axiom,
% 0.12/0.35 axiom(or(not(or(X3,X4)),or(X4,X3)))).
% 0.12/0.35 cnf(a2, assumption,
% 0.12/0.35 X2 = or(not(or(X3,X4)),or(X4,X3))).
% 0.12/0.35 cnf(c9, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.12/0.35 cnf(c10, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.12/0.35
% 0.12/0.35 cnf(c11, axiom,
% 0.12/0.35 ~theorem(X5) | ~theorem(or(not(X5),X6)) | theorem(X6)).
% 0.12/0.35 cnf(a3, assumption,
% 0.12/0.35 or(not(X0),X1) = X6).
% 0.12/0.35 cnf(c12, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 0.12/0.35 cnf(c13, plain,
% 0.12/0.35 ~theorem(X5) | ~theorem(or(not(X5),X6)),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 0.12/0.35
% 0.12/0.35 cnf(c14, axiom,
% 0.12/0.35 ~axiom(X7) | theorem(X7)).
% 0.12/0.35 cnf(a4, assumption,
% 0.12/0.35 X5 = X7).
% 0.12/0.35 cnf(c15, plain,
% 0.12/0.35 ~theorem(or(not(X5),X6)),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.12/0.35 cnf(c16, plain,
% 0.12/0.35 ~axiom(X7),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.12/0.35
% 0.12/0.35 cnf(c17, axiom,
% 0.12/0.35 axiom(or(not(X8),or(X9,X8)))).
% 0.12/0.35 cnf(a5, assumption,
% 0.12/0.35 X7 = or(not(X8),or(X9,X8))).
% 0.12/0.35 cnf(c18, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.12/0.35 cnf(c19, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.12/0.35
% 0.12/0.35 cnf(c20, axiom,
% 0.12/0.35 ~axiom(X10) | theorem(X10)).
% 0.12/0.35 cnf(a6, assumption,
% 0.12/0.35 or(not(X5),X6) = X10).
% 0.12/0.35 cnf(c21, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c15, c20])).
% 0.12/0.35 cnf(c22, plain,
% 0.12/0.35 ~axiom(X10),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c15, c20])).
% 0.12/0.35
% 0.12/0.35 cnf(c23, axiom,
% 0.12/0.35 axiom(or(not(or(X11,or(X12,X13))),or(X12,or(X11,X13))))).
% 0.12/0.35 cnf(a7, assumption,
% 0.12/0.35 X10 = or(not(or(X11,or(X12,X13))),or(X12,or(X11,X13)))).
% 0.12/0.35 cnf(c24, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])).
% 0.12/0.35 cnf(c25, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])).
% 0.12/0.35
% 0.12/0.35 cnf(c26, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(constraint_solving, [
% 0.12/0.35 bind(X0, or(not(or(X3,X4)),or(X4,X3))),
% 0.12/0.35 bind(X1, or(not(p),p)),
% 0.12/0.35 bind(X2, or(not(or(X3,X4)),or(X4,X3))),
% 0.12/0.35 bind(X3, X3),
% 0.12/0.35 bind(X4, X4),
% 0.12/0.35 bind(X5, or(not(X8),or(X9,X8))),
% 0.12/0.35 bind(X6, or(not(X0),X1)),
% 0.12/0.35 bind(X7, or(not(X8),or(X9,X8))),
% 0.12/0.35 bind(X8, p),
% 0.12/0.35 bind(X9, not(X0)),
% 0.12/0.35 bind(X10, or(not(X5),X6)),
% 0.12/0.35 bind(X11, not(X8)),
% 0.12/0.35 bind(X12, not(X0)),
% 0.12/0.35 bind(X13, p)
% 0.12/0.35 ],
% 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.12/0.35
% 0.12/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------