TSTP Solution File: CAT005-4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CAT005-4 : 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 : n023.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 : Fri Jul 15 00:03:26 EDT 2022
% Result : Unsatisfiable 4.66s 0.98s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT005-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n023.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 : Sun May 29 18:14:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.66/0.98 % SZS status Unsatisfiable
% 4.66/0.98 % SZS output begin IncompleteProof
% 4.66/0.98 cnf(c0, axiom,
% 4.66/0.98 d != domain(a)).
% 4.66/0.98 cnf(c1, plain,
% 4.66/0.98 d != domain(a),
% 4.66/0.98 inference(start, [], [c0])).
% 4.66/0.98
% 4.66/0.98 cnf(c2, axiom,
% 4.66/0.98 domain(X0) = codomain(X1) | ~there_exists(compose(X0,X1))).
% 4.66/0.98 cnf(a0, assumption,
% 4.66/0.98 domain(a) = domain(X0)).
% 4.66/0.98 cnf(c3, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 4.66/0.98 cnf(c4, plain,
% 4.66/0.98 ~there_exists(compose(X0,X1)),
% 4.66/0.98 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 4.66/0.98 cnf(c5, plain,
% 4.66/0.98 X2 != codomain(X1) | d != X2,
% 4.66/0.98 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 4.66/0.98
% 4.66/0.98 cnf(c6, axiom,
% 4.66/0.98 compose(X3,d) = X3 | ~there_exists(compose(X3,d))).
% 4.66/0.98 cnf(a1, assumption,
% 4.66/0.98 codomain(X1) = X3).
% 4.66/0.98 cnf(c7, plain,
% 4.66/0.98 d != X2,
% 4.66/0.98 inference(variable_extension, [assumptions([a1])], [c5, c6])).
% 4.66/0.98 cnf(c8, plain,
% 4.66/0.98 ~there_exists(compose(X3,d)),
% 4.66/0.98 inference(variable_extension, [assumptions([a1])], [c5, c6])).
% 4.66/0.98 cnf(c9, plain,
% 4.66/0.98 compose(X3,d) != X4 | X2 != X4,
% 4.66/0.98 inference(variable_extension, [assumptions([a1])], [c5, c6])).
% 4.66/0.98
% 4.66/0.98 cnf(c10, axiom,
% 4.66/0.98 compose(codomain(X5),X5) = X5).
% 4.66/0.98 cnf(a2, assumption,
% 4.66/0.98 compose(X3,d) = compose(codomain(X5),X5)).
% 4.66/0.98 cnf(c11, plain,
% 4.66/0.98 X2 != X4,
% 4.66/0.98 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 4.66/0.98 cnf(c12, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 4.66/0.98 cnf(c13, plain,
% 4.66/0.98 X6 != X5 | X6 != X4,
% 4.66/0.98 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 4.66/0.98
% 4.66/0.98 cnf(a3, assumption,
% 4.66/0.98 X6 = X5).
% 4.66/0.98 cnf(c14, plain,
% 4.66/0.98 X6 != X4,
% 4.66/0.98 inference(reflexivity, [assumptions([a3])], [c13])).
% 4.66/0.98
% 4.66/0.98 cnf(a4, assumption,
% 4.66/0.98 X6 = X4).
% 4.66/0.98 cnf(c15, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(reflexivity, [assumptions([a4])], [c14])).
% 4.66/0.98
% 4.66/0.98 cnf(a5, assumption,
% 4.66/0.98 X2 = X4).
% 4.66/0.98 cnf(c16, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(reflexivity, [assumptions([a5])], [c11])).
% 4.66/0.98
% 4.66/0.98 cnf(c17, plain,
% 4.66/0.98 compose(X3,d) = X4).
% 4.66/0.98 cnf(a6, assumption,
% 4.66/0.98 compose(X3,d) = compose(X3,d)).
% 4.66/0.98 cnf(c18, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(equality_reduction, [assumptions([a6])], [c8, c17])).
% 4.66/0.98 cnf(c19, plain,
% 4.66/0.98 ~there_exists(X4),
% 4.66/0.98 inference(equality_reduction, [assumptions([a6])], [c8, c17])).
% 4.66/0.98
% 4.66/0.98 cnf(c20, axiom,
% 4.66/0.98 there_exists(X7) | ~there_exists(codomain(X7))).
% 4.66/0.98 cnf(a7, assumption,
% 4.66/0.98 X4 = X7).
% 4.66/0.98 cnf(c21, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(strict_predicate_extension, [assumptions([a7])], [c19, c20])).
% 4.66/0.98 cnf(c22, plain,
% 4.66/0.98 ~there_exists(codomain(X7)),
% 4.66/0.98 inference(strict_predicate_extension, [assumptions([a7])], [c19, c20])).
% 4.66/0.98
% 4.66/0.98 cnf(c23, plain,
% 4.66/0.98 domain(X0) = codomain(X1)).
% 4.66/0.98 cnf(a8, assumption,
% 4.66/0.98 codomain(X7) = codomain(X1)).
% 4.66/0.98 cnf(a9, assumption,
% 4.66/0.98 domain(X0) = X8).
% 4.66/0.98 cnf(c24, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(equality_reduction, [assumptions([a8, a9])], [c22, c23])).
% 4.66/0.98 cnf(c25, plain,
% 4.66/0.98 ~there_exists(X8),
% 4.66/0.98 inference(equality_reduction, [assumptions([a8, a9])], [c22, c23])).
% 4.66/0.98
% 4.66/0.98 cnf(c26, axiom,
% 4.66/0.98 there_exists(domain(X9)) | ~there_exists(compose(X9,X10))).
% 4.66/0.98 cnf(a10, assumption,
% 4.66/0.98 X8 = domain(X9)).
% 4.66/0.98 cnf(c27, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(strict_predicate_extension, [assumptions([a10])], [c25, c26])).
% 4.66/0.98 cnf(c28, plain,
% 4.66/0.98 ~there_exists(compose(X9,X10)),
% 4.66/0.98 inference(strict_predicate_extension, [assumptions([a10])], [c25, c26])).
% 4.66/0.98
% 4.66/0.98 cnf(c29, axiom,
% 4.66/0.98 there_exists(compose(a,d))).
% 4.66/0.98 cnf(a11, assumption,
% 4.66/0.98 compose(X9,X10) = compose(a,d)).
% 4.66/0.98 cnf(c30, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(strict_predicate_extension, [assumptions([a11])], [c28, c29])).
% 4.66/0.98 cnf(c31, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(strict_predicate_extension, [assumptions([a11])], [c28, c29])).
% 4.66/0.98
% 4.66/0.98 cnf(a12, assumption,
% 4.66/0.98 d = X2).
% 4.66/0.98 cnf(c32, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(reflexivity, [assumptions([a12])], [c7])).
% 4.66/0.98
% 4.66/0.98 cnf(c33, plain,
% 4.66/0.98 there_exists(compose(X9,X10))).
% 4.66/0.98 cnf(a13, assumption,
% 4.66/0.98 compose(X0,X1) = compose(X9,X10)).
% 4.66/0.98 cnf(c34, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(predicate_reduction, [assumptions([a13])], [c4, c33])).
% 4.66/0.98
% 4.66/0.98 cnf(c35, plain,
% 4.66/0.98 $false,
% 4.66/0.98 inference(constraint_solving, [
% 4.66/0.98 bind(X0, a),
% 4.66/0.98 bind(X1, d),
% 4.66/0.98 bind(X2, d),
% 4.66/0.98 bind(X3, codomain(X1)),
% 4.66/0.98 bind(X4, d),
% 4.66/0.98 bind(X5, d),
% 4.66/0.98 bind(X6, d),
% 4.66/0.98 bind(X7, d),
% 4.66/0.98 bind(X8, domain(X0)),
% 4.66/0.98 bind(X9, a),
% 4.66/0.98 bind(X10, d)
% 4.66/0.98 ],
% 4.66/0.98 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 4.66/0.98
% 4.66/0.98 % SZS output end IncompleteProof
%------------------------------------------------------------------------------