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