TSTP Solution File: SWV181+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV181+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 : n020.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:47 EDT 2022
% Result : Theorem 1.54s 0.54s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV181+1 : TPTP v8.1.0. Bugfixed 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 : n020.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 : Wed Jun 15 08:03:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.54/0.54 % SZS status Theorem
% 1.54/0.54 % SZS output begin IncompleteProof
% 1.54/0.54 cnf(c0, axiom,
% 1.54/0.54 gt(n1,loopcounter)).
% 1.54/0.54 cnf(c1, plain,
% 1.54/0.54 gt(n1,loopcounter),
% 1.54/0.54 inference(start, [], [c0])).
% 1.54/0.54
% 1.54/0.54 cnf(c2, axiom,
% 1.54/0.54 leq(X0,minus(X1,n1)) | ~gt(X1,X0)).
% 1.54/0.54 cnf(a0, assumption,
% 1.54/0.54 n1 = X1).
% 1.54/0.54 cnf(a1, assumption,
% 1.54/0.54 loopcounter = X0).
% 1.54/0.54 cnf(c3, plain,
% 1.54/0.54 $false,
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.54/0.54 cnf(c4, plain,
% 1.54/0.54 leq(X0,minus(X1,n1)),
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.54/0.54
% 1.54/0.54 cnf(c5, axiom,
% 1.54/0.54 leq(X2,X3) | ~leq(X4,X3) | ~leq(X2,X4)).
% 1.54/0.54 cnf(a2, assumption,
% 1.54/0.54 X0 = X4).
% 1.54/0.54 cnf(a3, assumption,
% 1.54/0.54 minus(X1,n1) = X3).
% 1.54/0.54 cnf(c6, plain,
% 1.54/0.54 $false,
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.54/0.54 cnf(c7, plain,
% 1.54/0.54 leq(X2,X3) | ~leq(X2,X4),
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.54/0.54
% 1.54/0.54 cnf(c8, axiom,
% 1.54/0.54 gt(X5,X6) | ~leq(X6,minus(X5,n1))).
% 1.54/0.54 cnf(a4, assumption,
% 1.54/0.54 X2 = X6).
% 1.54/0.54 cnf(a5, assumption,
% 1.54/0.54 X3 = minus(X5,n1)).
% 1.54/0.54 cnf(c9, plain,
% 1.54/0.54 ~leq(X2,X4),
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 1.54/0.54 cnf(c10, plain,
% 1.54/0.54 gt(X5,X6),
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 1.54/0.54
% 1.54/0.54 cnf(c11, axiom,
% 1.54/0.54 ~gt(X7,X7)).
% 1.54/0.54 cnf(a6, assumption,
% 1.54/0.54 X5 = X7).
% 1.54/0.54 cnf(a7, assumption,
% 1.54/0.54 X6 = X7).
% 1.54/0.54 cnf(c12, plain,
% 1.54/0.54 $false,
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 1.54/0.54 cnf(c13, plain,
% 1.54/0.54 $false,
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 1.54/0.54
% 1.54/0.54 cnf(c14, axiom,
% 1.54/0.54 leq(n1,loopcounter)).
% 1.54/0.54 cnf(a8, assumption,
% 1.54/0.54 X2 = n1).
% 1.54/0.54 cnf(a9, assumption,
% 1.54/0.54 X4 = loopcounter).
% 1.54/0.54 cnf(c15, plain,
% 1.54/0.54 $false,
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 1.54/0.54 cnf(c16, plain,
% 1.54/0.54 $false,
% 1.54/0.54 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 1.54/0.54
% 1.54/0.54 cnf(c17, plain,
% 1.54/0.54 $false,
% 1.54/0.54 inference(constraint_solving, [
% 1.54/0.54 bind(X0, loopcounter),
% 1.54/0.54 bind(X1, n1),
% 1.54/0.54 bind(X2, n1),
% 1.54/0.54 bind(X3, minus(X1,n1)),
% 1.54/0.54 bind(X4, loopcounter),
% 1.54/0.54 bind(X5, n1),
% 1.54/0.54 bind(X6, n1),
% 1.54/0.54 bind(X7, n1)
% 1.54/0.54 ],
% 1.54/0.54 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 1.54/0.54
% 1.54/0.54 % SZS output end IncompleteProof
%------------------------------------------------------------------------------