TSTP Solution File: SWV071+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV071+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 : n007.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:27 EDT 2022
% Result : Theorem 0.19s 0.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV071+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 19:18:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.38 % SZS status Theorem
% 0.19/0.38 % SZS output begin IncompleteProof
% 0.19/0.38 cnf(c0, axiom,
% 0.19/0.38 leq(pv21,minus(n5,n1))).
% 0.19/0.38 cnf(c1, plain,
% 0.19/0.38 leq(pv21,minus(n5,n1)),
% 0.19/0.38 inference(start, [], [c0])).
% 0.19/0.38
% 0.19/0.38 cnf(c2, axiom,
% 0.19/0.38 ~leq(pv23,minus(n135300,n1)) | ~leq(pv21,minus(n5,n1)) | ~leq(n0,pv23) | ~leq(n0,pv21)).
% 0.19/0.38 cnf(a0, assumption,
% 0.19/0.38 pv21 = pv21).
% 0.19/0.38 cnf(a1, assumption,
% 0.19/0.38 minus(n5,n1) = minus(n5,n1)).
% 0.19/0.38 cnf(c3, plain,
% 0.19/0.38 $false,
% 0.19/0.38 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.38 cnf(c4, plain,
% 0.19/0.38 ~leq(pv23,minus(n135300,n1)) | ~leq(n0,pv23) | ~leq(n0,pv21),
% 0.19/0.38 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.38
% 0.19/0.38 cnf(c5, axiom,
% 0.19/0.38 leq(pv23,minus(n135300,n1))).
% 0.19/0.38 cnf(a2, assumption,
% 0.19/0.38 pv23 = pv23).
% 0.19/0.38 cnf(a3, assumption,
% 0.19/0.38 minus(n135300,n1) = minus(n135300,n1)).
% 0.19/0.38 cnf(c6, plain,
% 0.19/0.38 ~leq(n0,pv23) | ~leq(n0,pv21),
% 0.19/0.38 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.38 cnf(c7, plain,
% 0.19/0.38 $false,
% 0.19/0.38 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.38
% 0.19/0.38 cnf(c8, axiom,
% 0.19/0.38 leq(n0,pv23)).
% 0.19/0.38 cnf(a4, assumption,
% 0.19/0.38 n0 = n0).
% 0.19/0.38 cnf(a5, assumption,
% 0.19/0.38 pv23 = pv23).
% 0.19/0.38 cnf(c9, plain,
% 0.19/0.38 ~leq(n0,pv21),
% 0.19/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.19/0.38 cnf(c10, plain,
% 0.19/0.38 $false,
% 0.19/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.19/0.38
% 0.19/0.38 cnf(c11, axiom,
% 0.19/0.38 leq(n0,pv21)).
% 0.19/0.38 cnf(a6, assumption,
% 0.19/0.38 n0 = n0).
% 0.19/0.38 cnf(a7, assumption,
% 0.19/0.38 pv21 = pv21).
% 0.19/0.38 cnf(c12, plain,
% 0.19/0.38 $false,
% 0.19/0.38 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.19/0.38 cnf(c13, plain,
% 0.19/0.38 $false,
% 0.19/0.38 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.19/0.38
% 0.19/0.38 cnf(c14, plain,
% 0.19/0.38 $false,
% 0.19/0.38 inference(constraint_solving, [
% 0.19/0.38
% 0.19/0.38 ],
% 0.19/0.38 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.19/0.38
% 0.19/0.38 % SZS output end IncompleteProof
%------------------------------------------------------------------------------