TSTP Solution File: SWV064+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV064+1 : TPTP v8.1.0. Bugfixed 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 : n021.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:45:26 EDT 2022
% Result : Theorem 46.40s 6.45s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV064+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 15 21:27:44 EDT 2022
% 0.14/0.36 % CPUTime :
% 46.40/6.45 % SZS status Theorem
% 46.40/6.45 % SZS output begin IncompleteProof
% 46.40/6.45 cnf(c0, axiom,
% 46.40/6.45 leq(n0,pv10)).
% 46.40/6.45 cnf(c1, plain,
% 46.40/6.45 leq(n0,pv10),
% 46.40/6.45 inference(start, [], [c0])).
% 46.40/6.45
% 46.40/6.45 cnf(c2, axiom,
% 46.40/6.45 ~leq(pv54,minus(n5,n1)) | ~leq(pv53,minus(n5,n1)) | ~leq(pv10,minus(n135300,n1)) | ~leq(n0,pv54) | ~leq(n0,pv53) | ~leq(n0,pv10) | ~leq(n0,n0)).
% 46.40/6.45 cnf(a0, assumption,
% 46.40/6.45 n0 = n0).
% 46.40/6.45 cnf(a1, assumption,
% 46.40/6.45 pv10 = pv10).
% 46.40/6.45 cnf(c3, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 46.40/6.45 cnf(c4, plain,
% 46.40/6.45 ~leq(pv54,minus(n5,n1)) | ~leq(pv53,minus(n5,n1)) | ~leq(pv10,minus(n135300,n1)) | ~leq(n0,pv54) | ~leq(n0,pv53) | ~leq(n0,n0),
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 46.40/6.45
% 46.40/6.45 cnf(c5, axiom,
% 46.40/6.45 leq(pv54,minus(n5,n1))).
% 46.40/6.45 cnf(a2, assumption,
% 46.40/6.45 pv54 = pv54).
% 46.40/6.45 cnf(a3, assumption,
% 46.40/6.45 minus(n5,n1) = minus(n5,n1)).
% 46.40/6.45 cnf(c6, plain,
% 46.40/6.45 ~leq(pv53,minus(n5,n1)) | ~leq(pv10,minus(n135300,n1)) | ~leq(n0,pv54) | ~leq(n0,pv53) | ~leq(n0,n0),
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 46.40/6.45 cnf(c7, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 46.40/6.45
% 46.40/6.45 cnf(c8, axiom,
% 46.40/6.45 leq(pv53,minus(n5,n1))).
% 46.40/6.45 cnf(a4, assumption,
% 46.40/6.45 pv53 = pv53).
% 46.40/6.45 cnf(a5, assumption,
% 46.40/6.45 minus(n5,n1) = minus(n5,n1)).
% 46.40/6.45 cnf(c9, plain,
% 46.40/6.45 ~leq(pv10,minus(n135300,n1)) | ~leq(n0,pv54) | ~leq(n0,pv53) | ~leq(n0,n0),
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 46.40/6.45 cnf(c10, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 46.40/6.45
% 46.40/6.45 cnf(c11, axiom,
% 46.40/6.45 leq(pv10,minus(n135300,n1))).
% 46.40/6.45 cnf(a6, assumption,
% 46.40/6.45 pv10 = pv10).
% 46.40/6.45 cnf(a7, assumption,
% 46.40/6.45 minus(n135300,n1) = minus(n135300,n1)).
% 46.40/6.45 cnf(c12, plain,
% 46.40/6.45 ~leq(n0,pv54) | ~leq(n0,pv53) | ~leq(n0,n0),
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 46.40/6.45 cnf(c13, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 46.40/6.45
% 46.40/6.45 cnf(c14, axiom,
% 46.40/6.45 leq(n0,pv54)).
% 46.40/6.45 cnf(a8, assumption,
% 46.40/6.45 n0 = n0).
% 46.40/6.45 cnf(a9, assumption,
% 46.40/6.45 pv54 = pv54).
% 46.40/6.45 cnf(c15, plain,
% 46.40/6.45 ~leq(n0,pv53) | ~leq(n0,n0),
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 46.40/6.45 cnf(c16, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 46.40/6.45
% 46.40/6.45 cnf(c17, axiom,
% 46.40/6.45 leq(n0,pv53)).
% 46.40/6.45 cnf(a10, assumption,
% 46.40/6.45 n0 = n0).
% 46.40/6.45 cnf(a11, assumption,
% 46.40/6.45 pv53 = pv53).
% 46.40/6.45 cnf(c18, plain,
% 46.40/6.45 ~leq(n0,n0),
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 46.40/6.45 cnf(c19, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 46.40/6.45
% 46.40/6.45 cnf(c20, axiom,
% 46.40/6.45 leq(X0,X0)).
% 46.40/6.45 cnf(a12, assumption,
% 46.40/6.45 n0 = X0).
% 46.40/6.45 cnf(a13, assumption,
% 46.40/6.45 n0 = X0).
% 46.40/6.45 cnf(c21, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c20])).
% 46.40/6.45 cnf(c22, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c20])).
% 46.40/6.45
% 46.40/6.45 cnf(c23, plain,
% 46.40/6.45 $false,
% 46.40/6.45 inference(constraint_solving, [
% 46.40/6.45 bind(X0, n0)
% 46.40/6.45 ],
% 46.40/6.45 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 46.40/6.45
% 46.40/6.45 % SZS output end IncompleteProof
%------------------------------------------------------------------------------