TSTP Solution File: SWV381+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV381+1 : TPTP v8.1.0. Released v3.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 : n015.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 : Wed Jul 20 19:46:44 EDT 2022
% Result : Theorem 39.20s 5.43s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV381+1 : TPTP v8.1.0. Released v3.3.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.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 19:04:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 39.20/5.43 % SZS status Theorem
% 39.20/5.43 % SZS output begin IncompleteProof
% 39.20/5.43 cnf(c0, axiom,
% 39.20/5.43 ~issmallestelement_pq(i(triple(sK5,sK6,sK7)),removemin_cpq_res(triple(sK5,sK6,sK7)))).
% 39.20/5.43 cnf(c1, plain,
% 39.20/5.43 ~issmallestelement_pq(i(triple(sK5,sK6,sK7)),removemin_cpq_res(triple(sK5,sK6,sK7))),
% 39.20/5.43 inference(start, [], [c0])).
% 39.20/5.43
% 39.20/5.43 cnf(c2, axiom,
% 39.20/5.43 issmallestelement_pq(X0,X1) | ~less_than(X1,sK1(X0,X1))).
% 39.20/5.43 cnf(a0, assumption,
% 39.20/5.43 i(triple(sK5,sK6,sK7)) = X0).
% 39.20/5.43 cnf(a1, assumption,
% 39.20/5.43 removemin_cpq_res(triple(sK5,sK6,sK7)) = X1).
% 39.20/5.43 cnf(c3, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 39.20/5.43 cnf(c4, plain,
% 39.20/5.43 ~less_than(X1,sK1(X0,X1)),
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 39.20/5.43
% 39.20/5.43 cnf(c5, axiom,
% 39.20/5.43 less_than(X2,X3) | less_than(X3,X2)).
% 39.20/5.43 cnf(a2, assumption,
% 39.20/5.43 X1 = X2).
% 39.20/5.43 cnf(a3, assumption,
% 39.20/5.43 sK1(X0,X1) = X3).
% 39.20/5.43 cnf(c6, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 39.20/5.43 cnf(c7, plain,
% 39.20/5.43 less_than(X3,X2),
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 39.20/5.43
% 39.20/5.43 cnf(c8, axiom,
% 39.20/5.43 strictly_less_than(X4,X5) | less_than(X5,X4) | ~less_than(X4,X5)).
% 39.20/5.43 cnf(a4, assumption,
% 39.20/5.43 X3 = X4).
% 39.20/5.43 cnf(a5, assumption,
% 39.20/5.43 X2 = X5).
% 39.20/5.43 cnf(c9, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 39.20/5.43 cnf(c10, plain,
% 39.20/5.43 strictly_less_than(X4,X5) | less_than(X5,X4),
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 39.20/5.43
% 39.20/5.43 cnf(c11, axiom,
% 39.20/5.43 ~phi(findmin_cpq_eff(triple(X6,X7,X8))) | ~strictly_less_than(X9,removemin_cpq_res(triple(X6,X7,X8))) | ~contains_cpq(triple(X6,X7,X8),X9)).
% 39.20/5.43 cnf(a6, assumption,
% 39.20/5.43 X4 = X9).
% 39.20/5.43 cnf(a7, assumption,
% 39.20/5.43 X5 = removemin_cpq_res(triple(X6,X7,X8))).
% 39.20/5.43 cnf(c12, plain,
% 39.20/5.43 less_than(X5,X4),
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 39.20/5.43 cnf(c13, plain,
% 39.20/5.43 ~phi(findmin_cpq_eff(triple(X6,X7,X8))) | ~contains_cpq(triple(X6,X7,X8),X9),
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 39.20/5.43
% 39.20/5.43 cnf(c14, axiom,
% 39.20/5.43 phi(findmin_cpq_eff(triple(sK5,sK6,sK7)))).
% 39.20/5.43 cnf(a8, assumption,
% 39.20/5.43 findmin_cpq_eff(triple(X6,X7,X8)) = findmin_cpq_eff(triple(sK5,sK6,sK7))).
% 39.20/5.43 cnf(c15, plain,
% 39.20/5.43 ~contains_cpq(triple(X6,X7,X8),X9),
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])).
% 39.20/5.43 cnf(c16, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])).
% 39.20/5.43
% 39.20/5.43 cnf(c17, axiom,
% 39.20/5.43 contains_cpq(triple(X10,X11,X12),X13) | ~contains_pq(i(triple(X10,X11,X12)),X13)).
% 39.20/5.43 cnf(a9, assumption,
% 39.20/5.43 triple(X6,X7,X8) = triple(X10,X11,X12)).
% 39.20/5.43 cnf(a10, assumption,
% 39.20/5.43 X9 = X13).
% 39.20/5.43 cnf(c18, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])).
% 39.20/5.43 cnf(c19, plain,
% 39.20/5.43 ~contains_pq(i(triple(X10,X11,X12)),X13),
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])).
% 39.20/5.43
% 39.20/5.43 cnf(c20, axiom,
% 39.20/5.43 issmallestelement_pq(X14,X15) | contains_pq(X14,sK1(X14,X15))).
% 39.20/5.43 cnf(a11, assumption,
% 39.20/5.43 i(triple(X10,X11,X12)) = X14).
% 39.20/5.43 cnf(a12, assumption,
% 39.20/5.43 X13 = sK1(X14,X15)).
% 39.20/5.43 cnf(c21, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])).
% 39.20/5.43 cnf(c22, plain,
% 39.20/5.43 issmallestelement_pq(X14,X15),
% 39.20/5.43 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])).
% 39.20/5.43
% 39.20/5.43 cnf(c23, plain,
% 39.20/5.43 ~issmallestelement_pq(i(triple(sK5,sK6,sK7)),removemin_cpq_res(triple(sK5,sK6,sK7)))).
% 39.20/5.43 cnf(a13, assumption,
% 39.20/5.43 X14 = i(triple(sK5,sK6,sK7))).
% 39.20/5.43 cnf(a14, assumption,
% 39.20/5.43 X15 = removemin_cpq_res(triple(sK5,sK6,sK7))).
% 39.20/5.43 cnf(c24, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(predicate_reduction, [assumptions([a13, a14])], [c22, c23])).
% 39.20/5.43
% 39.20/5.43 cnf(c25, plain,
% 39.20/5.43 ~less_than(X1,sK1(X0,X1))).
% 39.20/5.43 cnf(a15, assumption,
% 39.20/5.43 X5 = X1).
% 39.20/5.43 cnf(a16, assumption,
% 39.20/5.43 X4 = sK1(X0,X1)).
% 39.20/5.43 cnf(c26, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(predicate_reduction, [assumptions([a15, a16])], [c12, c25])).
% 39.20/5.43
% 39.20/5.43 cnf(c27, plain,
% 39.20/5.43 $false,
% 39.20/5.43 inference(constraint_solving, [
% 39.20/5.43 bind(X0, i(triple(sK5,sK6,sK7))),
% 39.20/5.43 bind(X1, removemin_cpq_res(triple(sK5,sK6,sK7))),
% 39.20/5.43 bind(X2, removemin_cpq_res(triple(sK5,sK6,sK7))),
% 39.20/5.43 bind(X3, sK1(X0,X1)),
% 39.20/5.43 bind(X4, sK1(X0,X1)),
% 39.20/5.43 bind(X5, removemin_cpq_res(triple(sK5,sK6,sK7))),
% 39.20/5.43 bind(X6, sK5),
% 39.20/5.43 bind(X7, sK6),
% 39.20/5.43 bind(X8, sK7),
% 39.20/5.43 bind(X9, sK1(X0,X1)),
% 39.20/5.43 bind(X10, sK5),
% 39.20/5.43 bind(X11, sK6),
% 39.20/5.43 bind(X12, sK7),
% 39.20/5.43 bind(X13, sK1(X0,X1)),
% 39.20/5.43 bind(X14, i(triple(X10,X11,X12))),
% 39.20/5.43 bind(X15, removemin_cpq_res(triple(sK5,sK6,sK7)))
% 39.20/5.43 ],
% 39.20/5.43 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 39.20/5.43
% 39.20/5.43 % SZS output end IncompleteProof
%------------------------------------------------------------------------------