TSTP Solution File: SWV371+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV371+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 : n025.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:42 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV371+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.34 % Computer : n025.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 : Tue Jun 14 15:44:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 % SZS status Theorem
% 0.13/0.37 % SZS output begin IncompleteProof
% 0.13/0.37 cnf(c0, axiom,
% 0.13/0.37 phi(findmin_cpq_eff(triple(sK5,sK6,sK7)))).
% 0.13/0.37 cnf(c1, plain,
% 0.13/0.37 phi(findmin_cpq_eff(triple(sK5,sK6,sK7))),
% 0.13/0.37 inference(start, [], [c0])).
% 0.13/0.37
% 0.13/0.37 cnf(c2, axiom,
% 0.13/0.37 issmallestelement_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))) | ~phi(findmin_cpq_eff(triple(X0,X1,X2)))).
% 0.13/0.37 cnf(a0, assumption,
% 0.13/0.37 findmin_cpq_eff(triple(sK5,sK6,sK7)) = findmin_cpq_eff(triple(X0,X1,X2))).
% 0.13/0.37 cnf(c3, plain,
% 0.13/0.37 $false,
% 0.13/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.37 cnf(c4, plain,
% 0.13/0.37 issmallestelement_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))),
% 0.13/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.37
% 0.13/0.37 cnf(c5, axiom,
% 0.13/0.37 pi_sharp_find_min(X3,X4) | ~issmallestelement_pq(X3,X4) | ~contains_pq(X3,X4)).
% 0.13/0.37 cnf(a1, assumption,
% 0.13/0.37 i(triple(X0,X1,X2)) = X3).
% 0.13/0.37 cnf(a2, assumption,
% 0.13/0.37 removemin_cpq_res(triple(X0,X1,X2)) = X4).
% 0.13/0.37 cnf(c6, plain,
% 0.13/0.37 $false,
% 0.13/0.37 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.37 cnf(c7, plain,
% 0.13/0.37 pi_sharp_find_min(X3,X4) | ~contains_pq(X3,X4),
% 0.13/0.37 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.37
% 0.13/0.37 cnf(c8, axiom,
% 0.13/0.37 ~pi_sharp_find_min(i(triple(sK5,sK6,sK7)),removemin_cpq_res(triple(sK5,sK6,sK7)))).
% 0.13/0.37 cnf(a3, assumption,
% 0.13/0.37 X3 = i(triple(sK5,sK6,sK7))).
% 0.13/0.37 cnf(a4, assumption,
% 0.13/0.37 X4 = removemin_cpq_res(triple(sK5,sK6,sK7))).
% 0.13/0.37 cnf(c9, plain,
% 0.13/0.37 ~contains_pq(X3,X4),
% 0.13/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 0.13/0.37 cnf(c10, plain,
% 0.13/0.37 $false,
% 0.13/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 0.13/0.37
% 0.13/0.37 cnf(c11, axiom,
% 0.13/0.37 contains_pq(i(triple(X5,X6,X7)),removemin_cpq_res(triple(X5,X6,X7))) | ~phi(findmin_cpq_eff(triple(X5,X6,X7)))).
% 0.13/0.37 cnf(a5, assumption,
% 0.13/0.37 X3 = i(triple(X5,X6,X7))).
% 0.13/0.37 cnf(a6, assumption,
% 0.13/0.37 X4 = removemin_cpq_res(triple(X5,X6,X7))).
% 0.13/0.37 cnf(c12, plain,
% 0.13/0.37 $false,
% 0.13/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])).
% 0.13/0.37 cnf(c13, plain,
% 0.13/0.37 ~phi(findmin_cpq_eff(triple(X5,X6,X7))),
% 0.13/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])).
% 0.13/0.37
% 0.13/0.37 cnf(c14, plain,
% 0.13/0.37 phi(findmin_cpq_eff(triple(sK5,sK6,sK7)))).
% 0.13/0.37 cnf(a7, assumption,
% 0.13/0.37 findmin_cpq_eff(triple(X5,X6,X7)) = findmin_cpq_eff(triple(sK5,sK6,sK7))).
% 0.13/0.37 cnf(c15, plain,
% 0.13/0.37 $false,
% 0.13/0.37 inference(predicate_reduction, [assumptions([a7])], [c13, c14])).
% 0.13/0.37
% 0.13/0.37 cnf(c16, plain,
% 0.13/0.37 $false,
% 0.13/0.37 inference(constraint_solving, [
% 0.13/0.37 bind(X0, sK5),
% 0.13/0.37 bind(X1, sK6),
% 0.13/0.37 bind(X2, sK7),
% 0.13/0.37 bind(X3, i(triple(X0,X1,X2))),
% 0.13/0.37 bind(X4, removemin_cpq_res(triple(X0,X1,X2))),
% 0.13/0.37 bind(X5, sK5),
% 0.13/0.37 bind(X6, sK6),
% 0.13/0.37 bind(X7, sK7)
% 0.13/0.37 ],
% 0.13/0.37 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.13/0.37
% 0.13/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------