TSTP Solution File: COM021+4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : COM021+4 : TPTP v8.1.0. Released v4.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 01:27:06 EDT 2022
% Result : Theorem 2.61s 0.77s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM021+4 : TPTP v8.1.0. Released v4.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.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 17:17:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.61/0.77 % SZS status Theorem
% 2.61/0.77 % SZS output begin IncompleteProof
% 2.61/0.77 cnf(c0, axiom,
% 2.61/0.77 ~sdtmndtasgtdt0(xb,xR,xd)).
% 2.61/0.77 cnf(c1, plain,
% 2.61/0.77 ~sdtmndtasgtdt0(xb,xR,xd),
% 2.61/0.77 inference(start, [], [c0])).
% 2.61/0.77
% 2.61/0.77 cnf(c2, axiom,
% 2.61/0.77 sdtmndtasgtdt0(xb,xR,xx)).
% 2.61/0.77 cnf(a0, assumption,
% 2.61/0.77 X0 = xb).
% 2.61/0.77 cnf(a1, assumption,
% 2.61/0.77 X1 = xR).
% 2.61/0.77 cnf(a2, assumption,
% 2.61/0.77 X2 = xd).
% 2.61/0.77 cnf(c3, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(lazy_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 2.61/0.77 cnf(c4, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(lazy_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 2.61/0.77 cnf(c5, plain,
% 2.61/0.77 xb != X0 | xR != X1 | xx != X2,
% 2.61/0.77 inference(lazy_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 2.61/0.77
% 2.61/0.77 cnf(a3, assumption,
% 2.61/0.77 xb = X0).
% 2.61/0.77 cnf(c6, plain,
% 2.61/0.77 xR != X1 | xx != X2,
% 2.61/0.77 inference(reflexivity, [assumptions([a3])], [c5])).
% 2.61/0.77
% 2.61/0.77 cnf(a4, assumption,
% 2.61/0.77 xR = X1).
% 2.61/0.77 cnf(c7, plain,
% 2.61/0.77 xx != X2,
% 2.61/0.77 inference(reflexivity, [assumptions([a4])], [c6])).
% 2.61/0.77
% 2.61/0.77 cnf(c8, axiom,
% 2.61/0.77 sP36 | aReductOfIn0(xx,xd,xR) | xd = xx).
% 2.61/0.77 cnf(a5, assumption,
% 2.61/0.77 xx = xx).
% 2.61/0.77 cnf(c9, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(strict_function_extension, [assumptions([a5])], [c7, c8])).
% 2.61/0.77 cnf(c10, plain,
% 2.61/0.77 sP36 | aReductOfIn0(xx,xd,xR),
% 2.61/0.77 inference(strict_function_extension, [assumptions([a5])], [c7, c8])).
% 2.61/0.77 cnf(c11, plain,
% 2.61/0.77 X3 != xd | X3 != X2,
% 2.61/0.77 inference(strict_function_extension, [assumptions([a5])], [c7, c8])).
% 2.61/0.77
% 2.61/0.77 cnf(a6, assumption,
% 2.61/0.77 X3 = xd).
% 2.61/0.77 cnf(c12, plain,
% 2.61/0.77 X3 != X2,
% 2.61/0.77 inference(reflexivity, [assumptions([a6])], [c11])).
% 2.61/0.77
% 2.61/0.77 cnf(a7, assumption,
% 2.61/0.77 X3 = X2).
% 2.61/0.77 cnf(c13, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(reflexivity, [assumptions([a7])], [c12])).
% 2.61/0.77
% 2.61/0.77 cnf(c14, axiom,
% 2.61/0.77 aReductOfIn0(sK63,xd,xR) | ~sP36).
% 2.61/0.77 cnf(c15, plain,
% 2.61/0.77 aReductOfIn0(xx,xd,xR),
% 2.61/0.77 inference(strict_predicate_extension, [], [c10, c14])).
% 2.61/0.77 cnf(c16, plain,
% 2.61/0.77 aReductOfIn0(sK63,xd,xR),
% 2.61/0.77 inference(strict_predicate_extension, [], [c10, c14])).
% 2.61/0.77
% 2.61/0.77 cnf(c17, axiom,
% 2.61/0.77 ~aReductOfIn0(X4,xd,xR)).
% 2.61/0.77 cnf(a8, assumption,
% 2.61/0.77 sK63 = X4).
% 2.61/0.77 cnf(a9, assumption,
% 2.61/0.77 xd = xd).
% 2.61/0.77 cnf(a10, assumption,
% 2.61/0.77 xR = xR).
% 2.61/0.77 cnf(c18, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c16, c17])).
% 2.61/0.77 cnf(c19, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c16, c17])).
% 2.61/0.77
% 2.61/0.77 cnf(c20, axiom,
% 2.61/0.77 ~aReductOfIn0(X5,xd,xR)).
% 2.61/0.77 cnf(a11, assumption,
% 2.61/0.77 xx = X5).
% 2.61/0.77 cnf(a12, assumption,
% 2.61/0.77 xd = xd).
% 2.61/0.77 cnf(a13, assumption,
% 2.61/0.77 xR = xR).
% 2.61/0.77 cnf(c21, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c15, c20])).
% 2.61/0.77 cnf(c22, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c15, c20])).
% 2.61/0.77
% 2.61/0.77 cnf(c23, plain,
% 2.61/0.77 $false,
% 2.61/0.77 inference(constraint_solving, [
% 2.61/0.77 bind(X0, xb),
% 2.61/0.77 bind(X1, xR),
% 2.61/0.77 bind(X2, xd),
% 2.61/0.77 bind(X3, xd),
% 2.61/0.77 bind(X4, sK63),
% 2.61/0.77 bind(X5, xx)
% 2.61/0.77 ],
% 2.61/0.77 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 2.61/0.77
% 2.61/0.77 % SZS output end IncompleteProof
%------------------------------------------------------------------------------