TSTP Solution File: FLD056-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : FLD056-3 : TPTP v8.1.0. Bugfixed v2.1.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 : Sat Jul 16 02:16:00 EDT 2022
% Result : Unsatisfiable 0.11s 0.31s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : FLD056-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.00/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Mon Jun 6 22:32:05 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.11/0.31 % SZS status Unsatisfiable
% 0.11/0.31 % SZS output begin IncompleteProof
% 0.11/0.31 cnf(c0, axiom,
% 0.11/0.31 ~less_or_equal(a,a)).
% 0.11/0.31 cnf(c1, plain,
% 0.11/0.31 ~less_or_equal(a,a),
% 0.11/0.31 inference(start, [], [c0])).
% 0.11/0.31
% 0.11/0.31 cnf(c2, axiom,
% 0.11/0.31 ~defined(X0) | ~defined(X1) | less_or_equal(X0,X1) | less_or_equal(X1,X0)).
% 0.11/0.31 cnf(a0, assumption,
% 0.11/0.31 a = X0).
% 0.11/0.31 cnf(a1, assumption,
% 0.11/0.31 a = X1).
% 0.11/0.31 cnf(c3, plain,
% 0.11/0.31 $false,
% 0.11/0.31 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.31 cnf(c4, plain,
% 0.11/0.31 ~defined(X0) | ~defined(X1) | less_or_equal(X1,X0),
% 0.11/0.31 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.31
% 0.11/0.31 cnf(c5, axiom,
% 0.11/0.31 defined(a)).
% 0.11/0.31 cnf(a2, assumption,
% 0.11/0.31 X0 = a).
% 0.11/0.31 cnf(c6, plain,
% 0.11/0.31 ~defined(X1) | less_or_equal(X1,X0),
% 0.11/0.31 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.11/0.31 cnf(c7, plain,
% 0.11/0.31 $false,
% 0.11/0.31 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.11/0.31
% 0.11/0.31 cnf(c8, plain,
% 0.11/0.31 defined(X0)).
% 0.11/0.31 cnf(a3, assumption,
% 0.11/0.31 X1 = X0).
% 0.11/0.31 cnf(c9, plain,
% 0.11/0.31 less_or_equal(X1,X0),
% 0.11/0.31 inference(predicate_reduction, [assumptions([a3])], [c6, c8])).
% 0.11/0.31
% 0.11/0.31 cnf(c10, plain,
% 0.11/0.31 ~less_or_equal(a,a)).
% 0.11/0.31 cnf(a4, assumption,
% 0.11/0.31 X1 = a).
% 0.11/0.31 cnf(a5, assumption,
% 0.11/0.31 X0 = a).
% 0.11/0.31 cnf(c11, plain,
% 0.11/0.31 $false,
% 0.11/0.31 inference(predicate_reduction, [assumptions([a4, a5])], [c9, c10])).
% 0.11/0.31
% 0.11/0.31 cnf(c12, plain,
% 0.11/0.31 $false,
% 0.11/0.31 inference(constraint_solving, [
% 0.11/0.31 bind(X0, a),
% 0.11/0.31 bind(X1, a)
% 0.11/0.31 ],
% 0.11/0.31 [a0, a1, a2, a3, a4, a5])).
% 0.11/0.31
% 0.11/0.31 % SZS output end IncompleteProof
%------------------------------------------------------------------------------