TSTP Solution File: CSR115+79 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR115+79 : 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 : 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 20:37:44 EDT 2022
% Result : Theorem 7.61s 1.47s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR115+79 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 15:18:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 7.61/1.47 % SZS status Theorem
% 7.61/1.47 % SZS output begin IncompleteProof
% 7.61/1.47 cnf(c0, axiom,
% 7.61/1.47 ~val(X0,bmw_0) | ~val(X1,bmw_0) | ~sub(X0,name_1_1) | ~sub(X2,firma_1_1) | ~sub(X1,name_1_1) | ~obj(X3,X2) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X2,X1)).
% 7.61/1.47 cnf(c1, plain,
% 7.61/1.47 ~val(X0,bmw_0) | ~val(X1,bmw_0) | ~sub(X0,name_1_1) | ~sub(X2,firma_1_1) | ~sub(X1,name_1_1) | ~obj(X3,X2) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X2,X1),
% 7.61/1.47 inference(start, [], [c0])).
% 7.61/1.47
% 7.61/1.47 cnf(c2, axiom,
% 7.61/1.47 val(c130,bmw_0)).
% 7.61/1.47 cnf(a0, assumption,
% 7.61/1.47 X0 = c130).
% 7.61/1.47 cnf(a1, assumption,
% 7.61/1.47 bmw_0 = bmw_0).
% 7.61/1.47 cnf(c3, plain,
% 7.61/1.47 ~val(X1,bmw_0) | ~sub(X0,name_1_1) | ~sub(X2,firma_1_1) | ~sub(X1,name_1_1) | ~obj(X3,X2) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X2,X1),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 7.61/1.47 cnf(c4, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 7.61/1.47
% 7.61/1.47 cnf(c5, plain,
% 7.61/1.47 val(X0,bmw_0)).
% 7.61/1.47 cnf(a2, assumption,
% 7.61/1.47 X1 = X0).
% 7.61/1.47 cnf(a3, assumption,
% 7.61/1.47 bmw_0 = bmw_0).
% 7.61/1.47 cnf(c6, plain,
% 7.61/1.47 ~sub(X0,name_1_1) | ~sub(X2,firma_1_1) | ~sub(X1,name_1_1) | ~obj(X3,X2) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X2,X1),
% 7.61/1.47 inference(predicate_reduction, [assumptions([a2, a3])], [c3, c5])).
% 7.61/1.47
% 7.61/1.47 cnf(c7, axiom,
% 7.61/1.47 sub(c130,name_1_1)).
% 7.61/1.47 cnf(a4, assumption,
% 7.61/1.47 X0 = c130).
% 7.61/1.47 cnf(a5, assumption,
% 7.61/1.47 name_1_1 = name_1_1).
% 7.61/1.47 cnf(c8, plain,
% 7.61/1.47 ~sub(X2,firma_1_1) | ~sub(X1,name_1_1) | ~obj(X3,X2) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X2,X1),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])).
% 7.61/1.47 cnf(c9, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])).
% 7.61/1.47
% 7.61/1.47 cnf(c10, axiom,
% 7.61/1.47 sub(c129,firma_1_1)).
% 7.61/1.47 cnf(a6, assumption,
% 7.61/1.47 X2 = c129).
% 7.61/1.47 cnf(a7, assumption,
% 7.61/1.47 firma_1_1 = firma_1_1).
% 7.61/1.47 cnf(c11, plain,
% 7.61/1.47 ~sub(X1,name_1_1) | ~obj(X3,X2) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X2,X1),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a6, a7])], [c8, c10])).
% 7.61/1.47 cnf(c12, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a6, a7])], [c8, c10])).
% 7.61/1.47
% 7.61/1.47 cnf(c13, plain,
% 7.61/1.47 sub(X0,name_1_1)).
% 7.61/1.47 cnf(a8, assumption,
% 7.61/1.47 X1 = X0).
% 7.61/1.47 cnf(a9, assumption,
% 7.61/1.47 name_1_1 = name_1_1).
% 7.61/1.47 cnf(c14, plain,
% 7.61/1.47 ~obj(X3,X2) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X2,X1),
% 7.61/1.47 inference(predicate_reduction, [assumptions([a8, a9])], [c11, c13])).
% 7.61/1.47
% 7.61/1.47 cnf(c15, axiom,
% 7.61/1.47 obj(sK100(X7),X7) | ~sP36(X7)).
% 7.61/1.47 cnf(a10, assumption,
% 7.61/1.47 X3 = sK100(X7)).
% 7.61/1.47 cnf(a11, assumption,
% 7.61/1.47 X2 = X7).
% 7.61/1.47 cnf(c16, plain,
% 7.61/1.47 ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X2,X1),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c15])).
% 7.61/1.47 cnf(c17, plain,
% 7.61/1.47 ~sP36(X7),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c15])).
% 7.61/1.47
% 7.61/1.47 cnf(c18, axiom,
% 7.61/1.47 sP36(X8) | ~sub(X9,X10) | ~member(X10,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X8,X9)).
% 7.61/1.47 cnf(a12, assumption,
% 7.61/1.47 X7 = X8).
% 7.61/1.47 cnf(c19, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a12])], [c17, c18])).
% 7.61/1.47 cnf(c20, plain,
% 7.61/1.47 ~sub(X9,X10) | ~member(X10,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X8,X9),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a12])], [c17, c18])).
% 7.61/1.47
% 7.61/1.47 cnf(c21, plain,
% 7.61/1.47 sub(X0,name_1_1)).
% 7.61/1.47 cnf(a13, assumption,
% 7.61/1.47 X9 = X0).
% 7.61/1.47 cnf(a14, assumption,
% 7.61/1.47 X10 = name_1_1).
% 7.61/1.47 cnf(c22, plain,
% 7.61/1.47 ~member(X10,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X8,X9),
% 7.61/1.47 inference(predicate_reduction, [assumptions([a13, a14])], [c20, c21])).
% 7.61/1.47
% 7.61/1.47 cnf(c23, axiom,
% 7.61/1.47 member(X11,cons(X12,X13)) | ~member(X11,X13)).
% 7.61/1.47 cnf(a15, assumption,
% 7.61/1.47 X10 = X11).
% 7.61/1.47 cnf(a16, assumption,
% 7.61/1.47 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X12,X13)).
% 7.61/1.47 cnf(c24, plain,
% 7.61/1.47 ~attr(X8,X9),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a15, a16])], [c22, c23])).
% 7.61/1.47 cnf(c25, plain,
% 7.61/1.47 ~member(X11,X13),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a15, a16])], [c22, c23])).
% 7.61/1.47
% 7.61/1.47 cnf(c26, axiom,
% 7.61/1.47 member(X14,cons(X15,X16)) | ~member(X14,X16)).
% 7.61/1.47 cnf(a17, assumption,
% 7.61/1.47 X11 = X14).
% 7.61/1.47 cnf(a18, assumption,
% 7.61/1.47 X13 = cons(X15,X16)).
% 7.61/1.47 cnf(c27, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a17, a18])], [c25, c26])).
% 7.61/1.47 cnf(c28, plain,
% 7.61/1.47 ~member(X14,X16),
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a17, a18])], [c25, c26])).
% 7.61/1.47
% 7.61/1.47 cnf(c29, axiom,
% 7.61/1.47 member(X17,cons(X17,X18))).
% 7.61/1.47 cnf(a19, assumption,
% 7.61/1.47 X14 = X17).
% 7.61/1.47 cnf(a20, assumption,
% 7.61/1.47 X16 = cons(X17,X18)).
% 7.61/1.47 cnf(c30, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a19, a20])], [c28, c29])).
% 7.61/1.47 cnf(c31, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a19, a20])], [c28, c29])).
% 7.61/1.47
% 7.61/1.47 cnf(c32, axiom,
% 7.61/1.47 attr(c129,c130)).
% 7.61/1.47 cnf(a21, assumption,
% 7.61/1.47 X8 = c129).
% 7.61/1.47 cnf(a22, assumption,
% 7.61/1.47 X9 = c130).
% 7.61/1.47 cnf(c33, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a21, a22])], [c24, c32])).
% 7.61/1.47 cnf(c34, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(strict_predicate_extension, [assumptions([a21, a22])], [c24, c32])).
% 7.61/1.47
% 7.61/1.47 cnf(c35, plain,
% 7.61/1.47 attr(X8,X9)).
% 7.61/1.47 cnf(a23, assumption,
% 7.61/1.47 X4 = X8).
% 7.61/1.47 cnf(a24, assumption,
% 7.61/1.47 X5 = X9).
% 7.61/1.47 cnf(c36, plain,
% 7.61/1.47 ~attr(X6,X0) | ~attr(X2,X1),
% 7.61/1.47 inference(predicate_reduction, [assumptions([a23, a24])], [c16, c35])).
% 7.61/1.47
% 7.61/1.47 cnf(c37, plain,
% 7.61/1.47 attr(X8,X9)).
% 7.61/1.47 cnf(a25, assumption,
% 7.61/1.47 X6 = X8).
% 7.61/1.47 cnf(a26, assumption,
% 7.61/1.47 X0 = X9).
% 7.61/1.47 cnf(c38, plain,
% 7.61/1.47 ~attr(X2,X1),
% 7.61/1.47 inference(predicate_reduction, [assumptions([a25, a26])], [c36, c37])).
% 7.61/1.47
% 7.61/1.47 cnf(c39, plain,
% 7.61/1.47 attr(X8,X9)).
% 7.61/1.47 cnf(a27, assumption,
% 7.61/1.47 X2 = X8).
% 7.61/1.47 cnf(a28, assumption,
% 7.61/1.47 X1 = X9).
% 7.61/1.47 cnf(c40, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(predicate_reduction, [assumptions([a27, a28])], [c38, c39])).
% 7.61/1.47
% 7.61/1.47 cnf(c41, plain,
% 7.61/1.47 $false,
% 7.61/1.47 inference(constraint_solving, [
% 7.61/1.47 bind(X0, c130),
% 7.61/1.47 bind(X1, c130),
% 7.61/1.47 bind(X2, c129),
% 7.61/1.47 bind(X3, sK100(X7)),
% 7.61/1.47 bind(X4, c129),
% 7.61/1.47 bind(X5, c130),
% 7.61/1.47 bind(X6, c129),
% 7.61/1.47 bind(X7, c129),
% 7.61/1.47 bind(X8, c129),
% 7.61/1.47 bind(X9, c130),
% 7.61/1.47 bind(X10, name_1_1),
% 7.61/1.47 bind(X11, name_1_1),
% 7.61/1.47 bind(X12, eigenname_1_1),
% 7.61/1.47 bind(X13, cons(familiename_1_1,cons(name_1_1,nil))),
% 7.61/1.47 bind(X14, name_1_1),
% 7.61/1.47 bind(X15, familiename_1_1),
% 7.61/1.47 bind(X16, cons(name_1_1,nil)),
% 7.61/1.47 bind(X17, name_1_1),
% 7.61/1.47 bind(X18, nil)
% 7.61/1.47 ],
% 7.61/1.47 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28])).
% 7.61/1.47
% 7.61/1.47 % SZS output end IncompleteProof
%------------------------------------------------------------------------------