TSTP Solution File: CAT010-4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CAT010-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 : n025.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:27 EDT 2022
% Result : Unsatisfiable 10.73s 1.77s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT010-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun May 29 17:56:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 10.73/1.77 % SZS status Unsatisfiable
% 10.73/1.77 % SZS output begin IncompleteProof
% 10.73/1.77 cnf(c0, axiom,
% 10.73/1.77 codomain(compose(a,b)) != codomain(a)).
% 10.73/1.77 cnf(c1, plain,
% 10.73/1.77 codomain(compose(a,b)) != codomain(a),
% 10.73/1.77 inference(start, [], [c0])).
% 10.73/1.77
% 10.73/1.77 cnf(c2, axiom,
% 10.73/1.77 domain(X0) = codomain(X1) | ~there_exists(compose(X0,X1))).
% 10.73/1.77 cnf(a0, assumption,
% 10.73/1.77 codomain(compose(a,b)) = codomain(X1)).
% 10.73/1.77 cnf(c3, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 10.73/1.77 cnf(c4, plain,
% 10.73/1.77 ~there_exists(compose(X0,X1)),
% 10.73/1.77 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 10.73/1.77 cnf(c5, plain,
% 10.73/1.77 X2 != domain(X0) | X2 != codomain(a),
% 10.73/1.77 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 10.73/1.77
% 10.73/1.77 cnf(c6, axiom,
% 10.73/1.77 domain(X3) = codomain(X4) | ~there_exists(compose(X3,X4))).
% 10.73/1.77 cnf(a1, assumption,
% 10.73/1.77 domain(X0) = domain(X3)).
% 10.73/1.77 cnf(c7, plain,
% 10.73/1.77 X2 != codomain(a),
% 10.73/1.77 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 10.73/1.77 cnf(c8, plain,
% 10.73/1.77 ~there_exists(compose(X3,X4)),
% 10.73/1.77 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 10.73/1.77 cnf(c9, plain,
% 10.73/1.77 X5 != codomain(X4) | X2 != X5,
% 10.73/1.77 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 10.73/1.77
% 10.73/1.77 cnf(a2, assumption,
% 10.73/1.77 X5 = codomain(X4)).
% 10.73/1.77 cnf(c10, plain,
% 10.73/1.77 X2 != X5,
% 10.73/1.77 inference(reflexivity, [assumptions([a2])], [c9])).
% 10.73/1.77
% 10.73/1.77 cnf(a3, assumption,
% 10.73/1.77 X2 = X5).
% 10.73/1.77 cnf(c11, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(reflexivity, [assumptions([a3])], [c10])).
% 10.73/1.77
% 10.73/1.77 cnf(c12, axiom,
% 10.73/1.77 there_exists(X6) | ~there_exists(domain(X6))).
% 10.73/1.77 cnf(a4, assumption,
% 10.73/1.77 compose(X3,X4) = X6).
% 10.73/1.77 cnf(c13, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 10.73/1.77 cnf(c14, plain,
% 10.73/1.77 ~there_exists(domain(X6)),
% 10.73/1.77 inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 10.73/1.77
% 10.73/1.77 cnf(c15, axiom,
% 10.73/1.77 there_exists(domain(X7)) | ~there_exists(compose(X7,X8))).
% 10.73/1.77 cnf(a5, assumption,
% 10.73/1.77 domain(X6) = domain(X7)).
% 10.73/1.77 cnf(c16, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(strict_predicate_extension, [assumptions([a5])], [c14, c15])).
% 10.73/1.77 cnf(c17, plain,
% 10.73/1.77 ~there_exists(compose(X7,X8)),
% 10.73/1.77 inference(strict_predicate_extension, [assumptions([a5])], [c14, c15])).
% 10.73/1.77
% 10.73/1.77 cnf(c18, axiom,
% 10.73/1.77 compose(X9,compose(X10,X11)) = compose(compose(X9,X10),X11)).
% 10.73/1.77 cnf(a6, assumption,
% 10.73/1.77 compose(X7,X8) = compose(compose(X9,X10),X11)).
% 10.73/1.77 cnf(c19, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(strict_function_extension, [assumptions([a6])], [c17, c18])).
% 10.73/1.77 cnf(c20, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(strict_function_extension, [assumptions([a6])], [c17, c18])).
% 10.73/1.77 cnf(c21, plain,
% 10.73/1.77 X12 != compose(X9,compose(X10,X11)) | ~there_exists(X12),
% 10.73/1.77 inference(strict_function_extension, [assumptions([a6])], [c17, c18])).
% 10.73/1.77
% 10.73/1.77 cnf(c22, axiom,
% 10.73/1.77 compose(codomain(X13),X13) = X13).
% 10.73/1.77 cnf(a7, assumption,
% 10.73/1.77 compose(X9,compose(X10,X11)) = compose(codomain(X13),X13)).
% 10.73/1.77 cnf(c23, plain,
% 10.73/1.77 ~there_exists(X12),
% 10.73/1.77 inference(strict_function_extension, [assumptions([a7])], [c21, c22])).
% 10.73/1.77 cnf(c24, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(strict_function_extension, [assumptions([a7])], [c21, c22])).
% 10.73/1.77 cnf(c25, plain,
% 10.73/1.77 X14 != X13 | X12 != X14,
% 10.73/1.77 inference(strict_function_extension, [assumptions([a7])], [c21, c22])).
% 10.73/1.77
% 10.73/1.77 cnf(a8, assumption,
% 10.73/1.77 X14 = X13).
% 10.73/1.77 cnf(c26, plain,
% 10.73/1.77 X12 != X14,
% 10.73/1.77 inference(reflexivity, [assumptions([a8])], [c25])).
% 10.73/1.77
% 10.73/1.77 cnf(a9, assumption,
% 10.73/1.77 X12 = X14).
% 10.73/1.77 cnf(c27, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(reflexivity, [assumptions([a9])], [c26])).
% 10.73/1.77
% 10.73/1.77 cnf(c28, axiom,
% 10.73/1.77 there_exists(compose(a,b))).
% 10.73/1.77 cnf(a10, assumption,
% 10.73/1.77 X12 = compose(a,b)).
% 10.73/1.77 cnf(c29, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(strict_predicate_extension, [assumptions([a10])], [c23, c28])).
% 10.73/1.77 cnf(c30, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(strict_predicate_extension, [assumptions([a10])], [c23, c28])).
% 10.73/1.77
% 10.73/1.77 cnf(a11, assumption,
% 10.73/1.77 X2 = codomain(a)).
% 10.73/1.77 cnf(c31, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(reflexivity, [assumptions([a11])], [c7])).
% 10.73/1.77
% 10.73/1.77 cnf(c32, plain,
% 10.73/1.77 X12 = compose(X9,compose(X10,X11))).
% 10.73/1.77 cnf(a12, assumption,
% 10.73/1.77 compose(X0,X1) = compose(X9,compose(X10,X11))).
% 10.73/1.77 cnf(c33, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(equality_reduction, [assumptions([a12])], [c4, c32])).
% 10.73/1.77 cnf(c34, plain,
% 10.73/1.77 ~there_exists(X12),
% 10.73/1.77 inference(equality_reduction, [assumptions([a12])], [c4, c32])).
% 10.73/1.77
% 10.73/1.77 cnf(c35, plain,
% 10.73/1.77 there_exists(X12)).
% 10.73/1.77 cnf(a13, assumption,
% 10.73/1.77 X12 = X12).
% 10.73/1.77 cnf(c36, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(predicate_reduction, [assumptions([a13])], [c34, c35])).
% 10.73/1.77
% 10.73/1.77 cnf(c37, plain,
% 10.73/1.77 $false,
% 10.73/1.77 inference(constraint_solving, [
% 10.73/1.77 bind(X0, codomain(X13)),
% 10.73/1.77 bind(X1, compose(a,b)),
% 10.73/1.77 bind(X2, codomain(X4)),
% 10.73/1.77 bind(X3, codomain(X13)),
% 10.73/1.77 bind(X4, a),
% 10.73/1.77 bind(X5, codomain(X4)),
% 10.73/1.77 bind(X6, compose(X3,X4)),
% 10.73/1.77 bind(X7, compose(X3,X4)),
% 10.73/1.77 bind(X8, b),
% 10.73/1.77 bind(X9, codomain(X13)),
% 10.73/1.77 bind(X10, a),
% 10.73/1.77 bind(X11, b),
% 10.73/1.77 bind(X12, compose(X10,X11)),
% 10.73/1.77 bind(X13, compose(X10,X11)),
% 10.73/1.77 bind(X14, compose(X10,X11))
% 10.73/1.77 ],
% 10.73/1.77 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 10.73/1.77
% 10.73/1.77 % SZS output end IncompleteProof
%------------------------------------------------------------------------------