TSTP Solution File: NUM009-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM009-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n021.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 : Mon Jul 18 11:30:25 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM009-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n021.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 Jul 7 12:02:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output begin IncompleteProof
% 0.20/0.39 cnf(c0, axiom,
% 0.20/0.39 ~member(empty_set,natural_numbers)).
% 0.20/0.39 cnf(c1, plain,
% 0.20/0.39 ~member(empty_set,natural_numbers),
% 0.20/0.39 inference(start, [], [c0])).
% 0.20/0.39
% 0.20/0.39 cnf(c2, axiom,
% 0.20/0.39 member(empty_set,f44(X0)) | ~little_set(X0) | member(X0,natural_numbers)).
% 0.20/0.39 cnf(a0, assumption,
% 0.20/0.39 empty_set = X0).
% 0.20/0.39 cnf(a1, assumption,
% 0.20/0.39 natural_numbers = natural_numbers).
% 0.20/0.39 cnf(c3, plain,
% 0.20/0.39 $false,
% 0.20/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.39 cnf(c4, plain,
% 0.20/0.39 member(empty_set,f44(X0)) | ~little_set(X0),
% 0.20/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.39
% 0.20/0.39 cnf(c5, axiom,
% 0.20/0.39 ~member(X1,f44(X1)) | member(X1,natural_numbers)).
% 0.20/0.39 cnf(a2, assumption,
% 0.20/0.39 empty_set = X1).
% 0.20/0.39 cnf(a3, assumption,
% 0.20/0.39 f44(X0) = f44(X1)).
% 0.20/0.39 cnf(c6, plain,
% 0.20/0.39 ~little_set(X0),
% 0.20/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.39 cnf(c7, plain,
% 0.20/0.39 member(X1,natural_numbers),
% 0.20/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.39
% 0.20/0.39 cnf(c8, plain,
% 0.20/0.39 ~member(empty_set,natural_numbers)).
% 0.20/0.39 cnf(a4, assumption,
% 0.20/0.39 X1 = empty_set).
% 0.20/0.39 cnf(a5, assumption,
% 0.20/0.39 natural_numbers = natural_numbers).
% 0.20/0.39 cnf(c9, plain,
% 0.20/0.39 $false,
% 0.20/0.39 inference(predicate_reduction, [assumptions([a4, a5])], [c7, c8])).
% 0.20/0.39
% 0.20/0.39 cnf(c10, axiom,
% 0.20/0.39 little_set(X2) | ~member(X2,X3)).
% 0.20/0.39 cnf(a6, assumption,
% 0.20/0.39 X0 = X2).
% 0.20/0.39 cnf(c11, plain,
% 0.20/0.39 $false,
% 0.20/0.39 inference(strict_predicate_extension, [assumptions([a6])], [c6, c10])).
% 0.20/0.39 cnf(c12, plain,
% 0.20/0.39 ~member(X2,X3),
% 0.20/0.39 inference(strict_predicate_extension, [assumptions([a6])], [c6, c10])).
% 0.20/0.39
% 0.20/0.39 cnf(c13, axiom,
% 0.20/0.39 member(empty_set,infinity)).
% 0.20/0.39 cnf(a7, assumption,
% 0.20/0.39 X2 = empty_set).
% 0.20/0.39 cnf(a8, assumption,
% 0.20/0.39 X3 = infinity).
% 0.20/0.39 cnf(c14, plain,
% 0.20/0.39 $false,
% 0.20/0.39 inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c13])).
% 0.20/0.39 cnf(c15, plain,
% 0.20/0.39 $false,
% 0.20/0.39 inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c13])).
% 0.20/0.39
% 0.20/0.39 cnf(c16, plain,
% 0.20/0.39 $false,
% 0.20/0.39 inference(constraint_solving, [
% 0.20/0.39 bind(X0, empty_set),
% 0.20/0.39 bind(X1, empty_set),
% 0.20/0.39 bind(X2, empty_set),
% 0.20/0.39 bind(X3, infinity)
% 0.20/0.39 ],
% 0.20/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.20/0.39
% 0.20/0.39 % SZS output end IncompleteProof
%------------------------------------------------------------------------------