TSTP Solution File: CSR115+28 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR115+28 : 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 : n028.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 20:37:34 EDT 2022
% Result : Theorem 6.77s 1.46s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR115+28 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 11 00:42:49 EDT 2022
% 0.14/0.35 % CPUTime :
% 6.77/1.46 % SZS status Theorem
% 6.77/1.46 % SZS output begin IncompleteProof
% 6.77/1.46 cnf(c0, axiom,
% 6.77/1.46 ~sub(X0,name_1_1) | ~obj(X1,X2) | ~attr(X3,X4) | ~attr(X5,X0)).
% 6.77/1.46 cnf(c1, plain,
% 6.77/1.46 ~sub(X0,name_1_1) | ~obj(X1,X2) | ~attr(X3,X4) | ~attr(X5,X0),
% 6.77/1.46 inference(start, [], [c0])).
% 6.77/1.46
% 6.77/1.46 cnf(c2, axiom,
% 6.77/1.46 sub(c16,name_1_1)).
% 6.77/1.46 cnf(a0, assumption,
% 6.77/1.46 X0 = c16).
% 6.77/1.46 cnf(a1, assumption,
% 6.77/1.46 name_1_1 = name_1_1).
% 6.77/1.46 cnf(c3, plain,
% 6.77/1.46 ~obj(X1,X2) | ~attr(X3,X4) | ~attr(X5,X0),
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 6.77/1.46 cnf(c4, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 6.77/1.46
% 6.77/1.46 cnf(c5, axiom,
% 6.77/1.46 obj(sK100(X6),X6) | ~sP36(X6)).
% 6.77/1.46 cnf(a2, assumption,
% 6.77/1.46 X1 = sK100(X6)).
% 6.77/1.46 cnf(a3, assumption,
% 6.77/1.46 X2 = X6).
% 6.77/1.46 cnf(c6, plain,
% 6.77/1.46 ~attr(X3,X4) | ~attr(X5,X0),
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 6.77/1.46 cnf(c7, plain,
% 6.77/1.46 ~sP36(X6),
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 6.77/1.46
% 6.77/1.46 cnf(c8, axiom,
% 6.77/1.46 sP36(X7) | ~sub(X8,X9) | ~member(X9,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X7,X8)).
% 6.77/1.46 cnf(a4, assumption,
% 6.77/1.46 X6 = X7).
% 6.77/1.46 cnf(c9, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])).
% 6.77/1.46 cnf(c10, plain,
% 6.77/1.46 ~sub(X8,X9) | ~member(X9,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X7,X8),
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])).
% 6.77/1.46
% 6.77/1.46 cnf(c11, plain,
% 6.77/1.46 sub(X0,name_1_1)).
% 6.77/1.46 cnf(a5, assumption,
% 6.77/1.46 X8 = X0).
% 6.77/1.46 cnf(a6, assumption,
% 6.77/1.46 X9 = name_1_1).
% 6.77/1.46 cnf(c12, plain,
% 6.77/1.46 ~member(X9,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X7,X8),
% 6.77/1.46 inference(predicate_reduction, [assumptions([a5, a6])], [c10, c11])).
% 6.77/1.46
% 6.77/1.46 cnf(c13, axiom,
% 6.77/1.46 member(X10,cons(X11,X12)) | ~member(X10,X12)).
% 6.77/1.46 cnf(a7, assumption,
% 6.77/1.46 X9 = X10).
% 6.77/1.46 cnf(a8, assumption,
% 6.77/1.46 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X11,X12)).
% 6.77/1.46 cnf(c14, plain,
% 6.77/1.46 ~attr(X7,X8),
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c13])).
% 6.77/1.46 cnf(c15, plain,
% 6.77/1.46 ~member(X10,X12),
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c13])).
% 6.77/1.46
% 6.77/1.46 cnf(c16, axiom,
% 6.77/1.46 member(X13,cons(X14,X15)) | ~member(X13,X15)).
% 6.77/1.46 cnf(a9, assumption,
% 6.77/1.46 X10 = X13).
% 6.77/1.46 cnf(a10, assumption,
% 6.77/1.46 X12 = cons(X14,X15)).
% 6.77/1.46 cnf(c17, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])).
% 6.77/1.46 cnf(c18, plain,
% 6.77/1.46 ~member(X13,X15),
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])).
% 6.77/1.46
% 6.77/1.46 cnf(c19, axiom,
% 6.77/1.46 member(X16,cons(X16,X17))).
% 6.77/1.46 cnf(a11, assumption,
% 6.77/1.46 X13 = X16).
% 6.77/1.46 cnf(a12, assumption,
% 6.77/1.46 X15 = cons(X16,X17)).
% 6.77/1.46 cnf(c20, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])).
% 6.77/1.46 cnf(c21, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])).
% 6.77/1.46
% 6.77/1.46 cnf(c22, axiom,
% 6.77/1.46 attr(c15,c16)).
% 6.77/1.46 cnf(a13, assumption,
% 6.77/1.46 X7 = c15).
% 6.77/1.46 cnf(a14, assumption,
% 6.77/1.46 X8 = c16).
% 6.77/1.46 cnf(c23, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a13, a14])], [c14, c22])).
% 6.77/1.46 cnf(c24, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(strict_predicate_extension, [assumptions([a13, a14])], [c14, c22])).
% 6.77/1.46
% 6.77/1.46 cnf(c25, plain,
% 6.77/1.46 attr(X7,X8)).
% 6.77/1.46 cnf(a15, assumption,
% 6.77/1.46 X3 = X7).
% 6.77/1.46 cnf(a16, assumption,
% 6.77/1.46 X4 = X8).
% 6.77/1.46 cnf(c26, plain,
% 6.77/1.46 ~attr(X5,X0),
% 6.77/1.46 inference(predicate_reduction, [assumptions([a15, a16])], [c6, c25])).
% 6.77/1.46
% 6.77/1.46 cnf(c27, plain,
% 6.77/1.46 attr(X7,X8)).
% 6.77/1.46 cnf(a17, assumption,
% 6.77/1.46 X5 = X7).
% 6.77/1.46 cnf(a18, assumption,
% 6.77/1.46 X0 = X8).
% 6.77/1.46 cnf(c28, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(predicate_reduction, [assumptions([a17, a18])], [c26, c27])).
% 6.77/1.46
% 6.77/1.46 cnf(c29, plain,
% 6.77/1.46 $false,
% 6.77/1.46 inference(constraint_solving, [
% 6.77/1.46 bind(X0, c16),
% 6.77/1.46 bind(X1, sK100(X6)),
% 6.77/1.46 bind(X2, c15),
% 6.77/1.46 bind(X3, c15),
% 6.77/1.46 bind(X4, c16),
% 6.77/1.46 bind(X5, c15),
% 6.77/1.46 bind(X6, c15),
% 6.77/1.46 bind(X7, c15),
% 6.77/1.46 bind(X8, c16),
% 6.77/1.46 bind(X9, name_1_1),
% 6.77/1.46 bind(X10, name_1_1),
% 6.77/1.46 bind(X11, eigenname_1_1),
% 6.77/1.46 bind(X12, cons(familiename_1_1,cons(name_1_1,nil))),
% 6.77/1.46 bind(X13, name_1_1),
% 6.77/1.46 bind(X14, familiename_1_1),
% 6.77/1.46 bind(X15, cons(name_1_1,nil)),
% 6.77/1.46 bind(X16, name_1_1),
% 6.77/1.46 bind(X17, nil)
% 6.77/1.46 ],
% 6.77/1.46 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 6.77/1.46
% 6.77/1.46 % SZS output end IncompleteProof
%------------------------------------------------------------------------------