TSTP Solution File: SWV007-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n032.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:15 EDT 2022
% Result : Unsatisfiable 5.87s 1.08s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Wed Jun 15 09:54:13 EDT 2022
% 0.12/0.31 % CPUTime :
% 5.87/1.08 % SZS status Unsatisfiable
% 5.87/1.08 % SZS output begin IncompleteProof
% 5.87/1.08 cnf(c0, axiom,
% 5.87/1.08 ~less_than(a(X0),a(k)) | ~less_than(X0,successor(n)) | less_than(X0,i)).
% 5.87/1.08 cnf(c1, plain,
% 5.87/1.08 ~less_than(a(X0),a(k)) | ~less_than(X0,successor(n)) | less_than(X0,i),
% 5.87/1.08 inference(start, [], [c0])).
% 5.87/1.08
% 5.87/1.08 cnf(c2, axiom,
% 5.87/1.08 less_than(a(m),a(k))).
% 5.87/1.08 cnf(a0, assumption,
% 5.87/1.08 a(X0) = a(m)).
% 5.87/1.08 cnf(a1, assumption,
% 5.87/1.08 a(k) = a(k)).
% 5.87/1.08 cnf(c3, plain,
% 5.87/1.08 ~less_than(X0,successor(n)) | less_than(X0,i),
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.87/1.08 cnf(c4, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.87/1.08
% 5.87/1.08 cnf(c5, axiom,
% 5.87/1.08 X1 = X2 | less_than(X2,X1) | less_than(X1,X2)).
% 5.87/1.08 cnf(a2, assumption,
% 5.87/1.08 X0 = X2).
% 5.87/1.08 cnf(a3, assumption,
% 5.87/1.08 successor(n) = X1).
% 5.87/1.08 cnf(c6, plain,
% 5.87/1.08 less_than(X0,i),
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 5.87/1.08 cnf(c7, plain,
% 5.87/1.08 X1 = X2 | less_than(X1,X2),
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 5.87/1.08
% 5.87/1.08 cnf(c8, axiom,
% 5.87/1.08 less_than(X3,successor(X3))).
% 5.87/1.08 cnf(a4, assumption,
% 5.87/1.08 successor(X3) = X1).
% 5.87/1.08 cnf(c9, plain,
% 5.87/1.08 less_than(X1,X2),
% 5.87/1.08 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])).
% 5.87/1.08 cnf(c10, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])).
% 5.87/1.08 cnf(c11, plain,
% 5.87/1.08 less_than(X3,X2),
% 5.87/1.08 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])).
% 5.87/1.08
% 5.87/1.08 cnf(c12, axiom,
% 5.87/1.08 ~less_than(n,m)).
% 5.87/1.08 cnf(a5, assumption,
% 5.87/1.08 X3 = n).
% 5.87/1.08 cnf(a6, assumption,
% 5.87/1.08 X2 = m).
% 5.87/1.08 cnf(c13, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a5, a6])], [c11, c12])).
% 5.87/1.08 cnf(c14, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a5, a6])], [c11, c12])).
% 5.87/1.08
% 5.87/1.08 cnf(c15, axiom,
% 5.87/1.08 ~less_than(X4,X5) | ~less_than(X6,X4) | less_than(X6,X5)).
% 5.87/1.08 cnf(a7, assumption,
% 5.87/1.08 X1 = X4).
% 5.87/1.08 cnf(a8, assumption,
% 5.87/1.08 X2 = X5).
% 5.87/1.08 cnf(c16, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c15])).
% 5.87/1.08 cnf(c17, plain,
% 5.87/1.08 ~less_than(X6,X4) | less_than(X6,X5),
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c15])).
% 5.87/1.08
% 5.87/1.08 cnf(c18, axiom,
% 5.87/1.08 less_than(X7,successor(X7))).
% 5.87/1.08 cnf(a9, assumption,
% 5.87/1.08 X6 = X7).
% 5.87/1.08 cnf(a10, assumption,
% 5.87/1.08 X4 = successor(X7)).
% 5.87/1.08 cnf(c19, plain,
% 5.87/1.08 less_than(X6,X5),
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])).
% 5.87/1.08 cnf(c20, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])).
% 5.87/1.08
% 5.87/1.08 cnf(c21, plain,
% 5.87/1.08 ~less_than(X3,X2)).
% 5.87/1.08 cnf(a11, assumption,
% 5.87/1.08 X6 = X3).
% 5.87/1.08 cnf(a12, assumption,
% 5.87/1.08 X5 = X2).
% 5.87/1.08 cnf(c22, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(predicate_reduction, [assumptions([a11, a12])], [c19, c21])).
% 5.87/1.08
% 5.87/1.08 cnf(c23, axiom,
% 5.87/1.08 ~less_than(X8,X9) | ~less_than(X9,X8)).
% 5.87/1.08 cnf(a13, assumption,
% 5.87/1.08 X0 = X8).
% 5.87/1.08 cnf(a14, assumption,
% 5.87/1.08 i = X9).
% 5.87/1.08 cnf(c24, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a13, a14])], [c6, c23])).
% 5.87/1.08 cnf(c25, plain,
% 5.87/1.08 ~less_than(X9,X8),
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a13, a14])], [c6, c23])).
% 5.87/1.08
% 5.87/1.08 cnf(c26, axiom,
% 5.87/1.08 less_than(i,m)).
% 5.87/1.08 cnf(a15, assumption,
% 5.87/1.08 X9 = i).
% 5.87/1.08 cnf(a16, assumption,
% 5.87/1.08 X8 = m).
% 5.87/1.08 cnf(c27, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a15, a16])], [c25, c26])).
% 5.87/1.08 cnf(c28, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(strict_predicate_extension, [assumptions([a15, a16])], [c25, c26])).
% 5.87/1.08
% 5.87/1.08 cnf(c29, plain,
% 5.87/1.08 $false,
% 5.87/1.08 inference(constraint_solving, [
% 5.87/1.08 bind(X0, m),
% 5.87/1.08 bind(X1, successor(n)),
% 5.87/1.08 bind(X2, m),
% 5.87/1.08 bind(X3, n),
% 5.87/1.08 bind(X4, successor(n)),
% 5.87/1.08 bind(X5, m),
% 5.87/1.08 bind(X6, n),
% 5.87/1.08 bind(X7, n),
% 5.87/1.08 bind(X8, m),
% 5.87/1.08 bind(X9, i)
% 5.87/1.08 ],
% 5.87/1.08 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 5.87/1.08
% 5.87/1.08 % SZS output end IncompleteProof
%------------------------------------------------------------------------------