TSTP Solution File: SWV163+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV163+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 : n006.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:44 EDT 2022
% Result : Theorem 16.46s 2.49s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV163+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.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 18:35:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 16.46/2.49 % SZS status Theorem
% 16.46/2.49 % SZS output begin IncompleteProof
% 16.46/2.49 cnf(c0, axiom,
% 16.46/2.49 leq(sK41,tptp_minus_1)).
% 16.46/2.49 cnf(c1, plain,
% 16.46/2.49 leq(sK41,tptp_minus_1),
% 16.46/2.49 inference(start, [], [c0])).
% 16.46/2.49
% 16.46/2.49 cnf(c2, axiom,
% 16.46/2.49 leq(X0,X1) | ~leq(X2,X1) | ~leq(X0,X2)).
% 16.46/2.49 cnf(a0, assumption,
% 16.46/2.49 sK41 = X2).
% 16.46/2.49 cnf(a1, assumption,
% 16.46/2.49 tptp_minus_1 = X1).
% 16.46/2.49 cnf(c3, plain,
% 16.46/2.49 $false,
% 16.46/2.49 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 16.46/2.49 cnf(c4, plain,
% 16.46/2.49 leq(X0,X1) | ~leq(X0,X2),
% 16.46/2.49 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 16.46/2.49
% 16.46/2.49 cnf(c5, axiom,
% 16.46/2.49 gt(plus(X3,n1),X4) | ~leq(X4,X3)).
% 16.46/2.49 cnf(a2, assumption,
% 16.46/2.49 X0 = X4).
% 16.46/2.49 cnf(a3, assumption,
% 16.46/2.49 X1 = X3).
% 16.46/2.49 cnf(c6, plain,
% 16.46/2.49 ~leq(X0,X2),
% 16.46/2.49 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 16.46/2.49 cnf(c7, plain,
% 16.46/2.49 gt(plus(X3,n1),X4),
% 16.46/2.49 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 16.46/2.49
% 16.46/2.49 cnf(c8, axiom,
% 16.46/2.49 n0 = plus(tptp_minus_1,n1)).
% 16.46/2.49 cnf(a4, assumption,
% 16.46/2.49 plus(X3,n1) = plus(tptp_minus_1,n1)).
% 16.46/2.49 cnf(c9, plain,
% 16.46/2.49 $false,
% 16.46/2.49 inference(strict_function_extension, [assumptions([a4])], [c7, c8])).
% 16.46/2.49 cnf(c10, plain,
% 16.46/2.49 $false,
% 16.46/2.49 inference(strict_function_extension, [assumptions([a4])], [c7, c8])).
% 16.46/2.49 cnf(c11, plain,
% 16.46/2.49 X5 != n0 | gt(X5,X4),
% 16.46/2.49 inference(strict_function_extension, [assumptions([a4])], [c7, c8])).
% 16.46/2.49
% 16.46/2.49 cnf(a5, assumption,
% 16.46/2.49 X5 = n0).
% 16.46/2.49 cnf(c12, plain,
% 16.46/2.49 gt(X5,X4),
% 16.46/2.49 inference(reflexivity, [assumptions([a5])], [c11])).
% 16.46/2.49
% 16.46/2.49 cnf(c13, axiom,
% 16.46/2.49 ~gt(X6,X6)).
% 16.46/2.49 cnf(a6, assumption,
% 16.46/2.49 X5 = X6).
% 16.46/2.49 cnf(a7, assumption,
% 16.46/2.49 X4 = X6).
% 16.46/2.49 cnf(c14, plain,
% 16.46/2.49 $false,
% 16.46/2.49 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])).
% 16.46/2.49 cnf(c15, plain,
% 16.46/2.49 $false,
% 16.46/2.49 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])).
% 16.46/2.49
% 16.46/2.49 cnf(c16, axiom,
% 16.46/2.49 leq(n0,sK41)).
% 16.46/2.49 cnf(a8, assumption,
% 16.46/2.49 X0 = n0).
% 16.46/2.49 cnf(a9, assumption,
% 16.46/2.49 X2 = sK41).
% 16.46/2.49 cnf(c17, plain,
% 16.46/2.49 $false,
% 16.46/2.49 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c16])).
% 16.46/2.49 cnf(c18, plain,
% 16.46/2.49 $false,
% 16.46/2.49 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c16])).
% 16.46/2.49
% 16.46/2.49 cnf(c19, plain,
% 16.46/2.49 $false,
% 16.46/2.49 inference(constraint_solving, [
% 16.46/2.49 bind(X0, n0),
% 16.46/2.49 bind(X1, tptp_minus_1),
% 16.46/2.49 bind(X2, sK41),
% 16.46/2.49 bind(X3, tptp_minus_1),
% 16.46/2.49 bind(X4, n0),
% 16.46/2.49 bind(X5, n0),
% 16.46/2.49 bind(X6, n0)
% 16.46/2.49 ],
% 16.46/2.49 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 16.46/2.49
% 16.46/2.49 % SZS output end IncompleteProof
%------------------------------------------------------------------------------