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