TSTP Solution File: LCL186-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL186-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 : n024.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:27 EDT 2022
% Result : Unsatisfiable 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL186-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.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 13:56:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Unsatisfiable
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 ~theorem(or(not(not(p)),or(not(p),q)))).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 ~theorem(or(not(not(p)),or(not(p),q))),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 ~theorem(or(not(X0),X1)) | ~axiom(or(not(X2),X0)) | theorem(or(not(X2),X1))).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 or(not(not(p)),or(not(p),q)) = or(not(X2),X1)).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 ~theorem(or(not(X0),X1)) | ~axiom(or(not(X2),X0)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 ~axiom(X3) | theorem(X3)).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 or(not(X0),X1) = X3).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 ~axiom(or(not(X2),X0)),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 ~axiom(X3),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 axiom(or(not(or(X4,X5)),or(X5,X4)))).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 X3 = or(not(or(X4,X5)),or(X5,X4))).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 axiom(or(not(X6),or(X7,X6)))).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 or(not(X2),X0) = or(not(X6),or(X7,X6))).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, or(X4,X5)),
% 0.13/0.35 bind(X1, or(not(p),q)),
% 0.13/0.35 bind(X2, not(p)),
% 0.13/0.35 bind(X3, or(not(X0),X1)),
% 0.13/0.35 bind(X4, q),
% 0.13/0.35 bind(X5, not(p)),
% 0.13/0.35 bind(X6, not(p)),
% 0.13/0.35 bind(X7, q)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------