TSTP Solution File: CSR115+95 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR115+95 : 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 : n029.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:48 EDT 2022
% Result : Theorem 9.91s 1.74s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR115+95 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n029.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 : Fri Jun 10 12:33:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 9.91/1.74 % SZS status Theorem
% 9.91/1.74 % SZS output begin IncompleteProof
% 9.91/1.74 cnf(c0, axiom,
% 9.91/1.74 ~val(X0,bmw_0) | ~val(X1,bmw_0) | ~subs(X2,n374bernehmen_1_1) | ~sub(X0,name_1_1) | ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6)).
% 9.91/1.74 cnf(c1, plain,
% 9.91/1.74 ~val(X0,bmw_0) | ~val(X1,bmw_0) | ~subs(X2,n374bernehmen_1_1) | ~sub(X0,name_1_1) | ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(start, [], [c0])).
% 9.91/1.74
% 9.91/1.74 cnf(c2, axiom,
% 9.91/1.74 val(c1948,bmw_0)).
% 9.91/1.74 cnf(a0, assumption,
% 9.91/1.74 X0 = c1948).
% 9.91/1.74 cnf(a1, assumption,
% 9.91/1.74 bmw_0 = bmw_0).
% 9.91/1.74 cnf(c3, plain,
% 9.91/1.74 ~val(X1,bmw_0) | ~subs(X2,n374bernehmen_1_1) | ~sub(X0,name_1_1) | ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.91/1.74 cnf(c4, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.91/1.74
% 9.91/1.74 cnf(c5, plain,
% 9.91/1.74 val(X0,bmw_0)).
% 9.91/1.74 cnf(a2, assumption,
% 9.91/1.74 X1 = X0).
% 9.91/1.74 cnf(a3, assumption,
% 9.91/1.74 bmw_0 = bmw_0).
% 9.91/1.74 cnf(c6, plain,
% 9.91/1.74 ~subs(X2,n374bernehmen_1_1) | ~sub(X0,name_1_1) | ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(predicate_reduction, [assumptions([a2, a3])], [c3, c5])).
% 9.91/1.74
% 9.91/1.74 cnf(c7, axiom,
% 9.91/1.74 subs(sK53(X7,X8),X8) | ~subs(X7,X9) | ~chea(X8,X9)).
% 9.91/1.74 cnf(a4, assumption,
% 9.91/1.74 X2 = sK53(X7,X8)).
% 9.91/1.74 cnf(a5, assumption,
% 9.91/1.74 n374bernehmen_1_1 = X8).
% 9.91/1.74 cnf(c8, plain,
% 9.91/1.74 ~sub(X0,name_1_1) | ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])).
% 9.91/1.74 cnf(c9, plain,
% 9.91/1.74 ~subs(X7,X9) | ~chea(X8,X9),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])).
% 9.91/1.74
% 9.91/1.74 cnf(c10, axiom,
% 9.91/1.74 subs(c1671,annahme_1_1)).
% 9.91/1.74 cnf(a6, assumption,
% 9.91/1.74 X7 = c1671).
% 9.91/1.74 cnf(a7, assumption,
% 9.91/1.74 X9 = annahme_1_1).
% 9.91/1.74 cnf(c11, plain,
% 9.91/1.74 ~chea(X8,X9),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])).
% 9.91/1.74 cnf(c12, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])).
% 9.91/1.74
% 9.91/1.74 cnf(c13, axiom,
% 9.91/1.74 chea(n374bernehmen_1_1,annahme_1_1)).
% 9.91/1.74 cnf(a8, assumption,
% 9.91/1.74 X8 = n374bernehmen_1_1).
% 9.91/1.74 cnf(a9, assumption,
% 9.91/1.74 X9 = annahme_1_1).
% 9.91/1.74 cnf(c14, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])).
% 9.91/1.74 cnf(c15, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])).
% 9.91/1.74
% 9.91/1.74 cnf(c16, axiom,
% 9.91/1.74 sub(c1948,name_1_1)).
% 9.91/1.74 cnf(a10, assumption,
% 9.91/1.74 X0 = c1948).
% 9.91/1.74 cnf(a11, assumption,
% 9.91/1.74 name_1_1 = name_1_1).
% 9.91/1.74 cnf(c17, plain,
% 9.91/1.74 ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a10, a11])], [c8, c16])).
% 9.91/1.74 cnf(c18, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a10, a11])], [c8, c16])).
% 9.91/1.74
% 9.91/1.74 cnf(c19, axiom,
% 9.91/1.74 sub(X10,X11) | ~sub(X12,X11) | ~sub(X10,X12)).
% 9.91/1.74 cnf(a12, assumption,
% 9.91/1.74 X3 = X10).
% 9.91/1.74 cnf(a13, assumption,
% 9.91/1.74 firma_1_1 = X11).
% 9.91/1.74 cnf(c20, plain,
% 9.91/1.74 ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 9.91/1.74 cnf(c21, plain,
% 9.91/1.74 ~sub(X12,X11) | ~sub(X10,X12),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 9.91/1.74
% 9.91/1.74 cnf(c22, axiom,
% 9.91/1.74 sub(autobauer_1_1,firma_1_1)).
% 9.91/1.74 cnf(a14, assumption,
% 9.91/1.74 X12 = autobauer_1_1).
% 9.91/1.74 cnf(a15, assumption,
% 9.91/1.74 X11 = firma_1_1).
% 9.91/1.74 cnf(c23, plain,
% 9.91/1.74 ~sub(X10,X12),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])).
% 9.91/1.74 cnf(c24, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])).
% 9.91/1.74
% 9.91/1.74 cnf(c25, axiom,
% 9.91/1.74 sub(c1947,autobauer_1_1)).
% 9.91/1.74 cnf(a16, assumption,
% 9.91/1.74 X10 = c1947).
% 9.91/1.74 cnf(a17, assumption,
% 9.91/1.74 X12 = autobauer_1_1).
% 9.91/1.74 cnf(c26, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c25])).
% 9.91/1.74 cnf(c27, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c25])).
% 9.91/1.74
% 9.91/1.74 cnf(c28, plain,
% 9.91/1.74 sub(X0,name_1_1)).
% 9.91/1.74 cnf(a18, assumption,
% 9.91/1.74 X1 = X0).
% 9.91/1.74 cnf(a19, assumption,
% 9.91/1.74 name_1_1 = name_1_1).
% 9.91/1.74 cnf(c29, plain,
% 9.91/1.74 ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(predicate_reduction, [assumptions([a18, a19])], [c20, c28])).
% 9.91/1.74
% 9.91/1.74 cnf(c30, axiom,
% 9.91/1.74 attr(c1853,c1854)).
% 9.91/1.74 cnf(a20, assumption,
% 9.91/1.74 X4 = c1853).
% 9.91/1.74 cnf(a21, assumption,
% 9.91/1.74 X5 = c1854).
% 9.91/1.74 cnf(c31, plain,
% 9.91/1.74 ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])).
% 9.91/1.74 cnf(c32, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])).
% 9.91/1.74
% 9.91/1.74 cnf(c33, axiom,
% 9.91/1.74 attr(c1947,c1948)).
% 9.91/1.74 cnf(a22, assumption,
% 9.91/1.74 X6 = c1947).
% 9.91/1.74 cnf(a23, assumption,
% 9.91/1.74 X0 = c1948).
% 9.91/1.74 cnf(c34, plain,
% 9.91/1.74 ~attr(X3,X1) | ~agt(X2,X6),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c33])).
% 9.91/1.74 cnf(c35, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c33])).
% 9.91/1.74
% 9.91/1.74 cnf(c36, plain,
% 9.91/1.74 attr(X6,X0)).
% 9.91/1.74 cnf(a24, assumption,
% 9.91/1.74 X3 = X6).
% 9.91/1.74 cnf(a25, assumption,
% 9.91/1.74 X1 = X0).
% 9.91/1.74 cnf(c37, plain,
% 9.91/1.74 ~agt(X2,X6),
% 9.91/1.74 inference(predicate_reduction, [assumptions([a24, a25])], [c34, c36])).
% 9.91/1.74
% 9.91/1.74 cnf(c38, axiom,
% 9.91/1.74 agt(X13,X14) | ~chea(X13,X15) | ~agt(X15,X14)).
% 9.91/1.74 cnf(a26, assumption,
% 9.91/1.74 X2 = X13).
% 9.91/1.74 cnf(a27, assumption,
% 9.91/1.74 X6 = X14).
% 9.91/1.74 cnf(c39, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a26, a27])], [c37, c38])).
% 9.91/1.74 cnf(c40, plain,
% 9.91/1.74 ~chea(X13,X15) | ~agt(X15,X14),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a26, a27])], [c37, c38])).
% 9.91/1.74
% 9.91/1.74 cnf(c41, axiom,
% 9.91/1.74 chea(sK53(X16,X17),X16) | ~subs(X16,X18) | ~chea(X17,X18)).
% 9.91/1.74 cnf(a28, assumption,
% 9.91/1.74 X13 = sK53(X16,X17)).
% 9.91/1.74 cnf(a29, assumption,
% 9.91/1.74 X15 = X16).
% 9.91/1.74 cnf(c42, plain,
% 9.91/1.74 ~agt(X15,X14),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a28, a29])], [c40, c41])).
% 9.91/1.74 cnf(c43, plain,
% 9.91/1.74 ~subs(X16,X18) | ~chea(X17,X18),
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a28, a29])], [c40, c41])).
% 9.91/1.74
% 9.91/1.74 cnf(c44, plain,
% 9.91/1.74 subs(X7,X9)).
% 9.91/1.74 cnf(a30, assumption,
% 9.91/1.74 X16 = X7).
% 9.91/1.74 cnf(a31, assumption,
% 9.91/1.74 X18 = X9).
% 9.91/1.74 cnf(c45, plain,
% 9.91/1.74 ~chea(X17,X18),
% 9.91/1.74 inference(predicate_reduction, [assumptions([a30, a31])], [c43, c44])).
% 9.91/1.74
% 9.91/1.74 cnf(c46, plain,
% 9.91/1.74 chea(X8,X9)).
% 9.91/1.74 cnf(a32, assumption,
% 9.91/1.74 X17 = X8).
% 9.91/1.74 cnf(a33, assumption,
% 9.91/1.74 X18 = X9).
% 9.91/1.74 cnf(c47, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(predicate_reduction, [assumptions([a32, a33])], [c45, c46])).
% 9.91/1.74
% 9.91/1.74 cnf(c48, axiom,
% 9.91/1.74 agt(c1671,c1947)).
% 9.91/1.74 cnf(a34, assumption,
% 9.91/1.74 X15 = c1671).
% 9.91/1.74 cnf(a35, assumption,
% 9.91/1.74 X14 = c1947).
% 9.91/1.74 cnf(c49, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a34, a35])], [c42, c48])).
% 9.91/1.74 cnf(c50, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(strict_predicate_extension, [assumptions([a34, a35])], [c42, c48])).
% 9.91/1.74
% 9.91/1.74 cnf(c51, plain,
% 9.91/1.74 $false,
% 9.91/1.74 inference(constraint_solving, [
% 9.91/1.74 bind(X0, c1948),
% 9.91/1.74 bind(X1, c1948),
% 9.91/1.74 bind(X2, sK53(X7,X8)),
% 9.91/1.74 bind(X3, c1947),
% 9.91/1.74 bind(X4, c1853),
% 9.91/1.74 bind(X5, c1854),
% 9.91/1.74 bind(X6, c1947),
% 9.91/1.74 bind(X7, c1671),
% 9.91/1.74 bind(X8, n374bernehmen_1_1),
% 9.91/1.74 bind(X9, annahme_1_1),
% 9.91/1.74 bind(X10, c1947),
% 9.91/1.74 bind(X11, firma_1_1),
% 9.91/1.74 bind(X12, autobauer_1_1),
% 9.91/1.74 bind(X13, sK53(X7,X8)),
% 9.91/1.74 bind(X14, c1947),
% 9.91/1.74 bind(X15, c1671),
% 9.91/1.74 bind(X16, c1671),
% 9.91/1.74 bind(X17, n374bernehmen_1_1),
% 9.91/1.74 bind(X18, annahme_1_1)
% 9.91/1.74 ],
% 9.91/1.74 [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, a29, a30, a31, a32, a33, a34, a35])).
% 9.91/1.74
% 9.91/1.74 % SZS output end IncompleteProof
%------------------------------------------------------------------------------