TSTP Solution File: SYN078+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN078+1 : TPTP v8.1.0. Released v2.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 : n018.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 : Thu Jul 21 08:07:57 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN078+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 12:16:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 % SZS status Theorem
% 0.12/0.37 % SZS output begin IncompleteProof
% 0.12/0.37 cnf(c0, axiom,
% 0.12/0.37 ~big_p(f(sK0)) | ~big_p(sK1)).
% 0.12/0.37 cnf(c1, plain,
% 0.12/0.37 ~big_p(f(sK0)) | ~big_p(sK1),
% 0.12/0.37 inference(start, [], [c0])).
% 0.12/0.37
% 0.12/0.37 cnf(c2, axiom,
% 0.12/0.37 big_p(f(X0)) | ~big_p(X0) | big_p(f(X1)) | ~big_p(X1)).
% 0.12/0.37 cnf(a0, assumption,
% 0.12/0.37 f(sK0) = f(X1)).
% 0.12/0.37 cnf(c3, plain,
% 0.12/0.37 ~big_p(sK1),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.37 cnf(c4, plain,
% 0.12/0.37 big_p(f(X0)) | ~big_p(X0) | ~big_p(X1),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.37
% 0.12/0.37 cnf(c5, plain,
% 0.12/0.37 ~big_p(f(sK0))).
% 0.12/0.37 cnf(a1, assumption,
% 0.12/0.37 f(X0) = f(sK0)).
% 0.12/0.37 cnf(c6, plain,
% 0.12/0.37 ~big_p(X0) | ~big_p(X1),
% 0.12/0.37 inference(predicate_reduction, [assumptions([a1])], [c4, c5])).
% 0.12/0.37
% 0.12/0.37 cnf(c7, axiom,
% 0.12/0.37 big_p(sK0) | sK1 = f(sK2)).
% 0.12/0.37 cnf(a2, assumption,
% 0.12/0.37 X0 = sK0).
% 0.12/0.37 cnf(c8, plain,
% 0.12/0.37 ~big_p(X1),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c6, c7])).
% 0.12/0.37 cnf(c9, plain,
% 0.12/0.37 sK1 = f(sK2),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c6, c7])).
% 0.12/0.37
% 0.12/0.37 cnf(c10, axiom,
% 0.12/0.37 big_p(f(X2)) | ~big_p(X2) | big_p(f(X3)) | ~big_p(X3)).
% 0.12/0.37 cnf(a3, assumption,
% 0.12/0.37 f(X2) = f(sK2)).
% 0.12/0.37 cnf(a4, assumption,
% 0.12/0.37 sK1 = X4).
% 0.12/0.37 cnf(c11, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(strict_subterm_extension, [assumptions([a3, a4])], [c9, c10])).
% 0.12/0.37 cnf(c12, plain,
% 0.12/0.37 ~big_p(X2) | big_p(f(X3)) | ~big_p(X3),
% 0.12/0.37 inference(strict_subterm_extension, [assumptions([a3, a4])], [c9, c10])).
% 0.12/0.37 cnf(c13, plain,
% 0.12/0.37 big_p(X4),
% 0.12/0.37 inference(strict_subterm_extension, [assumptions([a3, a4])], [c9, c10])).
% 0.12/0.37
% 0.12/0.37 cnf(c14, axiom,
% 0.12/0.37 big_p(sK0) | ~big_p(sK1)).
% 0.12/0.37 cnf(a5, assumption,
% 0.12/0.37 X4 = sK1).
% 0.12/0.37 cnf(c15, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.12/0.37 cnf(c16, plain,
% 0.12/0.37 big_p(sK0),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.12/0.37
% 0.12/0.37 cnf(c17, plain,
% 0.12/0.37 ~big_p(X0)).
% 0.12/0.37 cnf(a6, assumption,
% 0.12/0.37 sK0 = X0).
% 0.12/0.37 cnf(c18, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(predicate_reduction, [assumptions([a6])], [c16, c17])).
% 0.12/0.37
% 0.12/0.37 cnf(c19, axiom,
% 0.12/0.37 big_p(sK0) | big_p(sK2)).
% 0.12/0.37 cnf(a7, assumption,
% 0.12/0.37 X2 = sK2).
% 0.12/0.37 cnf(c20, plain,
% 0.12/0.37 big_p(f(X3)) | ~big_p(X3),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a7])], [c12, c19])).
% 0.12/0.37 cnf(c21, plain,
% 0.12/0.37 big_p(sK0),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a7])], [c12, c19])).
% 0.12/0.37
% 0.12/0.37 cnf(c22, plain,
% 0.12/0.37 ~big_p(X0)).
% 0.12/0.37 cnf(a8, assumption,
% 0.12/0.37 sK0 = X0).
% 0.12/0.37 cnf(c23, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(predicate_reduction, [assumptions([a8])], [c21, c22])).
% 0.12/0.37
% 0.12/0.37 cnf(c24, plain,
% 0.12/0.37 ~big_p(f(X2))).
% 0.12/0.37 cnf(a9, assumption,
% 0.12/0.37 f(X3) = f(X2)).
% 0.12/0.37 cnf(c25, plain,
% 0.12/0.37 ~big_p(X3),
% 0.12/0.37 inference(predicate_reduction, [assumptions([a9])], [c20, c24])).
% 0.12/0.37
% 0.12/0.37 cnf(c26, plain,
% 0.12/0.37 big_p(X2)).
% 0.12/0.37 cnf(a10, assumption,
% 0.12/0.37 X3 = X2).
% 0.12/0.37 cnf(c27, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(predicate_reduction, [assumptions([a10])], [c25, c26])).
% 0.12/0.37
% 0.12/0.37 cnf(c28, plain,
% 0.12/0.37 big_p(X0)).
% 0.12/0.37 cnf(a11, assumption,
% 0.12/0.37 X1 = X0).
% 0.12/0.37 cnf(c29, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(predicate_reduction, [assumptions([a11])], [c8, c28])).
% 0.12/0.37
% 0.12/0.37 cnf(c30, axiom,
% 0.12/0.37 big_p(f(X5)) | ~big_p(X5) | big_p(f(X6)) | ~big_p(X6)).
% 0.12/0.37 cnf(a12, assumption,
% 0.12/0.37 X7 = sK1).
% 0.12/0.37 cnf(c31, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(lazy_predicate_extension, [assumptions([a12])], [c3, c30])).
% 0.12/0.37 cnf(c32, plain,
% 0.12/0.37 big_p(f(X5)) | ~big_p(X5) | ~big_p(X6),
% 0.12/0.37 inference(lazy_predicate_extension, [assumptions([a12])], [c3, c30])).
% 0.12/0.37 cnf(c33, plain,
% 0.12/0.37 f(X6) != X7,
% 0.12/0.37 inference(lazy_predicate_extension, [assumptions([a12])], [c3, c30])).
% 0.12/0.37
% 0.12/0.37 cnf(c34, axiom,
% 0.12/0.37 ~big_p(f(sK0)) | sK1 = f(sK2)).
% 0.12/0.37 cnf(a13, assumption,
% 0.12/0.37 f(X6) = f(sK2)).
% 0.12/0.37 cnf(c35, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(strict_function_extension, [assumptions([a13])], [c33, c34])).
% 0.12/0.37 cnf(c36, plain,
% 0.12/0.37 ~big_p(f(sK0)),
% 0.12/0.37 inference(strict_function_extension, [assumptions([a13])], [c33, c34])).
% 0.12/0.37 cnf(c37, plain,
% 0.12/0.37 X8 != sK1 | X8 != X7,
% 0.12/0.37 inference(strict_function_extension, [assumptions([a13])], [c33, c34])).
% 0.12/0.37
% 0.12/0.37 cnf(a14, assumption,
% 0.12/0.37 X8 = sK1).
% 0.12/0.37 cnf(c38, plain,
% 0.12/0.37 X8 != X7,
% 0.12/0.37 inference(reflexivity, [assumptions([a14])], [c37])).
% 0.12/0.37
% 0.12/0.37 cnf(a15, assumption,
% 0.12/0.37 X8 = X7).
% 0.12/0.37 cnf(c39, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(reflexivity, [assumptions([a15])], [c38])).
% 0.12/0.37
% 0.12/0.37 cnf(c40, plain,
% 0.12/0.37 big_p(f(sK0))).
% 0.12/0.37 cnf(a16, assumption,
% 0.12/0.37 f(sK0) = f(sK0)).
% 0.12/0.37 cnf(c41, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(predicate_reduction, [assumptions([a16])], [c36, c40])).
% 0.12/0.37
% 0.12/0.37 cnf(c42, plain,
% 0.12/0.37 ~big_p(f(X6))).
% 0.12/0.37 cnf(a17, assumption,
% 0.12/0.37 f(X5) = f(X6)).
% 0.12/0.37 cnf(c43, plain,
% 0.12/0.37 ~big_p(X5) | ~big_p(X6),
% 0.12/0.37 inference(predicate_reduction, [assumptions([a17])], [c32, c42])).
% 0.12/0.37
% 0.12/0.37 cnf(c44, axiom,
% 0.12/0.37 ~big_p(f(sK0)) | big_p(sK2)).
% 0.12/0.37 cnf(a18, assumption,
% 0.12/0.37 X5 = sK2).
% 0.12/0.37 cnf(c45, plain,
% 0.12/0.37 ~big_p(X6),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a18])], [c43, c44])).
% 0.12/0.37 cnf(c46, plain,
% 0.12/0.37 ~big_p(f(sK0)),
% 0.12/0.37 inference(strict_predicate_extension, [assumptions([a18])], [c43, c44])).
% 0.12/0.37
% 0.12/0.37 cnf(c47, plain,
% 0.12/0.37 big_p(f(sK0))).
% 0.12/0.37 cnf(a19, assumption,
% 0.12/0.37 f(sK0) = f(sK0)).
% 0.12/0.37 cnf(c48, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(predicate_reduction, [assumptions([a19])], [c46, c47])).
% 0.12/0.37
% 0.12/0.37 cnf(c49, plain,
% 0.12/0.37 big_p(X5)).
% 0.12/0.37 cnf(a20, assumption,
% 0.12/0.37 X6 = X5).
% 0.12/0.37 cnf(c50, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(predicate_reduction, [assumptions([a20])], [c45, c49])).
% 0.12/0.37
% 0.12/0.37 cnf(c51, plain,
% 0.12/0.37 $false,
% 0.12/0.37 inference(constraint_solving, [
% 0.12/0.37 bind(X0, sK0),
% 0.12/0.37 bind(X1, sK0),
% 0.12/0.37 bind(X2, sK2),
% 0.12/0.37 bind(X3, sK2),
% 0.12/0.37 bind(X4, sK1),
% 0.12/0.37 bind(X5, sK2),
% 0.12/0.37 bind(X6, sK2),
% 0.12/0.37 bind(X7, sK1),
% 0.12/0.37 bind(X8, sK1)
% 0.12/0.37 ],
% 0.12/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 0.12/0.37
% 0.12/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------