TSTP Solution File: COM012+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : COM012+3 : 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 : 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 : Fri Jul 15 01:27:01 EDT 2022
% Result : Theorem 0.20s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : COM012+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n018.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 : Thu Jun 16 19:41:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.40 % SZS status Theorem
% 0.20/0.40 % SZS output begin IncompleteProof
% 0.20/0.40 cnf(c0, axiom,
% 0.20/0.40 sdtmndtplgtdt0(xx,xR,xy) | xx = xy).
% 0.20/0.40 cnf(c1, plain,
% 0.20/0.40 sdtmndtplgtdt0(xx,xR,xy) | xx = xy,
% 0.20/0.40 inference(start, [], [c0])).
% 0.20/0.40
% 0.20/0.40 cnf(c2, axiom,
% 0.20/0.40 sdtmndtplgtdt0(X0,X1,X2) | ~sdtmndtplgtdt0(X3,X1,X2) | ~sdtmndtplgtdt0(X0,X1,X3) | ~aElement0(X2) | ~aElement0(X3) | ~aRewritingSystem0(X1) | ~aElement0(X0)).
% 0.20/0.40 cnf(a0, assumption,
% 0.20/0.40 xx = X0).
% 0.20/0.40 cnf(a1, assumption,
% 0.20/0.40 xR = X1).
% 0.20/0.40 cnf(a2, assumption,
% 0.20/0.40 xy = X3).
% 0.20/0.40 cnf(c3, plain,
% 0.20/0.40 xx = xy,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.40 cnf(c4, plain,
% 0.20/0.40 sdtmndtplgtdt0(X0,X1,X2) | ~sdtmndtplgtdt0(X3,X1,X2) | ~aElement0(X2) | ~aElement0(X3) | ~aRewritingSystem0(X1) | ~aElement0(X0),
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.40
% 0.20/0.40 cnf(c5, axiom,
% 0.20/0.40 ~sdtmndtplgtdt0(xx,xR,xz)).
% 0.20/0.40 cnf(a3, assumption,
% 0.20/0.40 X0 = xx).
% 0.20/0.40 cnf(a4, assumption,
% 0.20/0.40 X1 = xR).
% 0.20/0.40 cnf(a5, assumption,
% 0.20/0.40 X2 = xz).
% 0.20/0.40 cnf(c6, plain,
% 0.20/0.40 ~sdtmndtplgtdt0(X3,X1,X2) | ~aElement0(X2) | ~aElement0(X3) | ~aRewritingSystem0(X1) | ~aElement0(X0),
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.20/0.40 cnf(c7, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.20/0.40
% 0.20/0.40 cnf(c8, axiom,
% 0.20/0.40 sdtmndtplgtdt0(xy,xR,xz) | xy = xz).
% 0.20/0.40 cnf(a6, assumption,
% 0.20/0.40 X3 = xy).
% 0.20/0.40 cnf(a7, assumption,
% 0.20/0.40 X1 = xR).
% 0.20/0.40 cnf(a8, assumption,
% 0.20/0.40 X2 = xz).
% 0.20/0.40 cnf(c9, plain,
% 0.20/0.40 ~aElement0(X2) | ~aElement0(X3) | ~aRewritingSystem0(X1) | ~aElement0(X0),
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 0.20/0.40 cnf(c10, plain,
% 0.20/0.40 xy = xz,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 0.20/0.40
% 0.20/0.40 cnf(c11, axiom,
% 0.20/0.40 sdtmndtasgtdt0(xx,xR,xy)).
% 0.20/0.40 cnf(a9, assumption,
% 0.20/0.40 xy = xy).
% 0.20/0.40 cnf(a10, assumption,
% 0.20/0.40 xz = X4).
% 0.20/0.40 cnf(c12, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_subterm_extension, [assumptions([a9, a10])], [c10, c11])).
% 0.20/0.40 cnf(c13, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_subterm_extension, [assumptions([a9, a10])], [c10, c11])).
% 0.20/0.40 cnf(c14, plain,
% 0.20/0.40 sdtmndtasgtdt0(xx,xR,X4),
% 0.20/0.40 inference(strict_subterm_extension, [assumptions([a9, a10])], [c10, c11])).
% 0.20/0.40
% 0.20/0.40 cnf(c15, axiom,
% 0.20/0.40 ~sdtmndtasgtdt0(xx,xR,xz)).
% 0.20/0.40 cnf(a11, assumption,
% 0.20/0.40 xx = xx).
% 0.20/0.40 cnf(a12, assumption,
% 0.20/0.40 xR = xR).
% 0.20/0.40 cnf(a13, assumption,
% 0.20/0.40 X4 = xz).
% 0.20/0.40 cnf(c16, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c14, c15])).
% 0.20/0.40 cnf(c17, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c14, c15])).
% 0.20/0.40
% 0.20/0.40 cnf(c18, axiom,
% 0.20/0.40 aElement0(xz)).
% 0.20/0.40 cnf(a14, assumption,
% 0.20/0.40 X2 = xz).
% 0.20/0.40 cnf(c19, plain,
% 0.20/0.40 ~aElement0(X3) | ~aRewritingSystem0(X1) | ~aElement0(X0),
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a14])], [c9, c18])).
% 0.20/0.40 cnf(c20, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a14])], [c9, c18])).
% 0.20/0.40
% 0.20/0.40 cnf(c21, axiom,
% 0.20/0.40 aElement0(xy)).
% 0.20/0.40 cnf(a15, assumption,
% 0.20/0.40 X3 = xy).
% 0.20/0.40 cnf(c22, plain,
% 0.20/0.40 ~aRewritingSystem0(X1) | ~aElement0(X0),
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a15])], [c19, c21])).
% 0.20/0.40 cnf(c23, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a15])], [c19, c21])).
% 0.20/0.40
% 0.20/0.40 cnf(c24, axiom,
% 0.20/0.40 aRewritingSystem0(xR)).
% 0.20/0.40 cnf(a16, assumption,
% 0.20/0.40 X1 = xR).
% 0.20/0.40 cnf(c25, plain,
% 0.20/0.40 ~aElement0(X0),
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a16])], [c22, c24])).
% 0.20/0.40 cnf(c26, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a16])], [c22, c24])).
% 0.20/0.40
% 0.20/0.40 cnf(c27, axiom,
% 0.20/0.40 aElement0(xx)).
% 0.20/0.40 cnf(a17, assumption,
% 0.20/0.40 X0 = xx).
% 0.20/0.40 cnf(c28, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a17])], [c25, c27])).
% 0.20/0.40 cnf(c29, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a17])], [c25, c27])).
% 0.20/0.40
% 0.20/0.40 cnf(c30, plain,
% 0.20/0.40 ~sdtmndtasgtdt0(xx,xR,X4)).
% 0.20/0.40 cnf(a18, assumption,
% 0.20/0.40 xx = xx).
% 0.20/0.40 cnf(a19, assumption,
% 0.20/0.40 xy = X5).
% 0.20/0.40 cnf(c31, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(subterm_reduction, [assumptions([a18, a19])], [c3, c30])).
% 0.20/0.40 cnf(c32, plain,
% 0.20/0.40 ~sdtmndtasgtdt0(X5,xR,X4),
% 0.20/0.40 inference(subterm_reduction, [assumptions([a18, a19])], [c3, c30])).
% 0.20/0.40
% 0.20/0.40 cnf(c33, axiom,
% 0.20/0.40 sdtmndtasgtdt0(xy,xR,xz)).
% 0.20/0.40 cnf(a20, assumption,
% 0.20/0.40 X5 = xy).
% 0.20/0.40 cnf(a21, assumption,
% 0.20/0.40 xR = xR).
% 0.20/0.40 cnf(a22, assumption,
% 0.20/0.40 X4 = xz).
% 0.20/0.40 cnf(c34, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a20, a21, a22])], [c32, c33])).
% 0.20/0.40 cnf(c35, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(strict_predicate_extension, [assumptions([a20, a21, a22])], [c32, c33])).
% 0.20/0.40
% 0.20/0.40 cnf(c36, plain,
% 0.20/0.40 $false,
% 0.20/0.40 inference(constraint_solving, [
% 0.20/0.40 bind(X0, xx),
% 0.20/0.40 bind(X1, xR),
% 0.20/0.40 bind(X2, xz),
% 0.20/0.40 bind(X3, xy),
% 0.20/0.40 bind(X4, xz),
% 0.20/0.40 bind(X5, xy)
% 0.20/0.40 ],
% 0.20/0.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22])).
% 0.20/0.40
% 0.20/0.40 % SZS output end IncompleteProof
%------------------------------------------------------------------------------