TSTP Solution File: SWV005-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV005-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 : n013.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:14 EDT 2022
% Result : Unsatisfiable 0.15s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 06:09:59 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % SZS status Unsatisfiable
% 0.15/0.37 % SZS output begin IncompleteProof
% 0.15/0.37 cnf(c0, axiom,
% 0.15/0.37 ~less_than(a(X0),a(predecessor(l))) | ~less_than(one,l) | less_than(n,X0) | less_than(X0,l)).
% 0.15/0.37 cnf(c1, plain,
% 0.15/0.37 ~less_than(a(X0),a(predecessor(l))) | ~less_than(one,l) | less_than(n,X0) | less_than(X0,l),
% 0.15/0.37 inference(start, [], [c0])).
% 0.15/0.37
% 0.15/0.37 cnf(c2, axiom,
% 0.15/0.37 less_than(a(k),a(predecessor(l)))).
% 0.15/0.37 cnf(a0, assumption,
% 0.15/0.37 a(X0) = a(k)).
% 0.15/0.37 cnf(a1, assumption,
% 0.15/0.37 a(predecessor(l)) = a(predecessor(l))).
% 0.15/0.37 cnf(c3, plain,
% 0.15/0.37 ~less_than(one,l) | less_than(n,X0) | less_than(X0,l),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.15/0.37 cnf(c4, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.15/0.37
% 0.15/0.37 cnf(c5, axiom,
% 0.15/0.37 less_than(one,l)).
% 0.15/0.37 cnf(a2, assumption,
% 0.15/0.37 one = one).
% 0.15/0.37 cnf(a3, assumption,
% 0.15/0.37 l = l).
% 0.15/0.37 cnf(c6, plain,
% 0.15/0.37 less_than(n,X0) | less_than(X0,l),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.15/0.37 cnf(c7, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.15/0.37
% 0.15/0.37 cnf(c8, axiom,
% 0.15/0.37 ~less_than(n,k)).
% 0.15/0.37 cnf(a4, assumption,
% 0.15/0.37 n = n).
% 0.15/0.37 cnf(a5, assumption,
% 0.15/0.37 X0 = k).
% 0.15/0.37 cnf(c9, plain,
% 0.15/0.37 less_than(X0,l),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.15/0.37 cnf(c10, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.15/0.37
% 0.15/0.37 cnf(c11, axiom,
% 0.15/0.37 ~less_than(k,l)).
% 0.15/0.37 cnf(a6, assumption,
% 0.15/0.37 X0 = k).
% 0.15/0.37 cnf(a7, assumption,
% 0.15/0.37 l = l).
% 0.15/0.37 cnf(c12, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.15/0.37 cnf(c13, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.15/0.37
% 0.15/0.37 cnf(c14, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(constraint_solving, [
% 0.15/0.37 bind(X0, k)
% 0.15/0.37 ],
% 0.15/0.37 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.15/0.37
% 0.15/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------