TSTP Solution File: SWV197+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV197+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 : n023.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:50 EDT 2022
% Result : Theorem 33.14s 4.69s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV197+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n023.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 : Thu Jun 16 01:57:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 33.14/4.69 % SZS status Theorem
% 33.14/4.69 % SZS output begin IncompleteProof
% 33.14/4.69 cnf(c0, axiom,
% 33.14/4.69 leq(n0,sK42)).
% 33.14/4.69 cnf(c1, plain,
% 33.14/4.69 leq(n0,sK42),
% 33.14/4.69 inference(start, [], [c0])).
% 33.14/4.69
% 33.14/4.69 cnf(c2, axiom,
% 33.14/4.69 leq(X0,X1) | ~leq(X2,X1) | ~leq(X0,X2)).
% 33.14/4.69 cnf(a0, assumption,
% 33.14/4.69 n0 = X0).
% 33.14/4.69 cnf(a1, assumption,
% 33.14/4.69 sK42 = X2).
% 33.14/4.69 cnf(c3, plain,
% 33.14/4.69 $false,
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 33.14/4.69 cnf(c4, plain,
% 33.14/4.69 leq(X0,X1) | ~leq(X2,X1),
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 33.14/4.69
% 33.14/4.69 cnf(c5, axiom,
% 33.14/4.69 leq(X3,X4) | ~leq(X5,X4) | ~leq(X3,X5)).
% 33.14/4.69 cnf(a2, assumption,
% 33.14/4.69 X0 = X5).
% 33.14/4.69 cnf(a3, assumption,
% 33.14/4.69 X1 = X4).
% 33.14/4.69 cnf(c6, plain,
% 33.14/4.69 ~leq(X2,X1),
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 33.14/4.69 cnf(c7, plain,
% 33.14/4.69 leq(X3,X4) | ~leq(X3,X5),
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 33.14/4.69
% 33.14/4.69 cnf(c8, axiom,
% 33.14/4.69 gt(X6,X7) | ~leq(X7,minus(X6,n1))).
% 33.14/4.69 cnf(a4, assumption,
% 33.14/4.69 X3 = X7).
% 33.14/4.69 cnf(a5, assumption,
% 33.14/4.69 X4 = minus(X6,n1)).
% 33.14/4.69 cnf(c9, plain,
% 33.14/4.69 ~leq(X3,X5),
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 33.14/4.69 cnf(c10, plain,
% 33.14/4.69 gt(X6,X7),
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 33.14/4.69
% 33.14/4.69 cnf(c11, axiom,
% 33.14/4.69 ~gt(X8,X8)).
% 33.14/4.69 cnf(a6, assumption,
% 33.14/4.69 X6 = X8).
% 33.14/4.69 cnf(a7, assumption,
% 33.14/4.69 X7 = X8).
% 33.14/4.69 cnf(c12, plain,
% 33.14/4.69 $false,
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 33.14/4.69 cnf(c13, plain,
% 33.14/4.69 $false,
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 33.14/4.69
% 33.14/4.69 cnf(c14, axiom,
% 33.14/4.69 leq(pv5,n0)).
% 33.14/4.69 cnf(a8, assumption,
% 33.14/4.69 X3 = pv5).
% 33.14/4.69 cnf(a9, assumption,
% 33.14/4.69 X5 = n0).
% 33.14/4.69 cnf(c15, plain,
% 33.14/4.69 $false,
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 33.14/4.69 cnf(c16, plain,
% 33.14/4.69 $false,
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 33.14/4.69
% 33.14/4.69 cnf(c17, axiom,
% 33.14/4.69 leq(sK42,minus(pv5,n1))).
% 33.14/4.69 cnf(a10, assumption,
% 33.14/4.69 X2 = sK42).
% 33.14/4.69 cnf(a11, assumption,
% 33.14/4.69 X1 = minus(pv5,n1)).
% 33.14/4.69 cnf(c18, plain,
% 33.14/4.69 $false,
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])).
% 33.14/4.69 cnf(c19, plain,
% 33.14/4.69 $false,
% 33.14/4.69 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])).
% 33.14/4.69
% 33.14/4.69 cnf(c20, plain,
% 33.14/4.69 $false,
% 33.14/4.69 inference(constraint_solving, [
% 33.14/4.69 bind(X0, n0),
% 33.14/4.69 bind(X1, minus(X6,n1)),
% 33.14/4.69 bind(X2, sK42),
% 33.14/4.69 bind(X3, pv5),
% 33.14/4.69 bind(X4, minus(X6,n1)),
% 33.14/4.69 bind(X5, n0),
% 33.14/4.69 bind(X6, pv5),
% 33.14/4.69 bind(X7, pv5),
% 33.14/4.69 bind(X8, pv5)
% 33.14/4.69 ],
% 33.14/4.69 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 33.14/4.69
% 33.14/4.69 % SZS output end IncompleteProof
%------------------------------------------------------------------------------