TSTP Solution File: CSR115+49 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR115+49 : 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:39 EDT 2022
% Result : Theorem 0.40s 0.56s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR115+49 : 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 09:32:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/0.56 % SZS status Theorem
% 0.40/0.56 % SZS output begin IncompleteProof
% 0.40/0.56 cnf(c0, axiom,
% 0.40/0.56 ~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)).
% 0.40/0.56 cnf(c1, plain,
% 0.40/0.56 ~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),
% 0.40/0.56 inference(start, [], [c0])).
% 0.40/0.56
% 0.40/0.56 cnf(c2, axiom,
% 0.40/0.56 val(c74,bmw_0)).
% 0.40/0.56 cnf(a0, assumption,
% 0.40/0.56 X0 = c74).
% 0.40/0.56 cnf(a1, assumption,
% 0.40/0.56 bmw_0 = bmw_0).
% 0.40/0.56 cnf(c3, plain,
% 0.40/0.56 ~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),
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.40/0.56 cnf(c4, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.40/0.56
% 0.40/0.56 cnf(c5, plain,
% 0.40/0.56 val(X0,bmw_0)).
% 0.40/0.56 cnf(a2, assumption,
% 0.40/0.56 X1 = X0).
% 0.40/0.56 cnf(a3, assumption,
% 0.40/0.56 bmw_0 = bmw_0).
% 0.40/0.56 cnf(c6, plain,
% 0.40/0.56 ~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),
% 0.40/0.56 inference(predicate_reduction, [assumptions([a2, a3])], [c3, c5])).
% 0.40/0.56
% 0.40/0.56 cnf(c7, axiom,
% 0.40/0.56 subs(sK53(X7,X8),X8) | ~subs(X7,X9) | ~chea(X8,X9)).
% 0.40/0.56 cnf(a4, assumption,
% 0.40/0.56 X2 = sK53(X7,X8)).
% 0.40/0.56 cnf(a5, assumption,
% 0.40/0.56 n374bernehmen_1_1 = X8).
% 0.40/0.56 cnf(c8, plain,
% 0.40/0.56 ~sub(X0,name_1_1) | ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1),
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])).
% 0.40/0.56 cnf(c9, plain,
% 0.40/0.56 ~subs(X7,X9) | ~chea(X8,X9),
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])).
% 0.40/0.56
% 0.40/0.56 cnf(c10, axiom,
% 0.40/0.56 subs(c25,annahme_1_1)).
% 0.40/0.56 cnf(a6, assumption,
% 0.40/0.56 X7 = c25).
% 0.40/0.56 cnf(a7, assumption,
% 0.40/0.56 X9 = annahme_1_1).
% 0.40/0.56 cnf(c11, plain,
% 0.40/0.56 ~chea(X8,X9),
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])).
% 0.40/0.56 cnf(c12, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])).
% 0.40/0.56
% 0.40/0.56 cnf(c13, axiom,
% 0.40/0.56 chea(n374bernehmen_1_1,annahme_1_1)).
% 0.40/0.56 cnf(a8, assumption,
% 0.40/0.56 X8 = n374bernehmen_1_1).
% 0.40/0.56 cnf(a9, assumption,
% 0.40/0.56 X9 = annahme_1_1).
% 0.40/0.56 cnf(c14, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])).
% 0.40/0.56 cnf(c15, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])).
% 0.40/0.56
% 0.40/0.56 cnf(c16, axiom,
% 0.40/0.56 sub(c74,name_1_1)).
% 0.40/0.56 cnf(a10, assumption,
% 0.40/0.56 X0 = c74).
% 0.40/0.56 cnf(a11, assumption,
% 0.40/0.56 name_1_1 = name_1_1).
% 0.40/0.56 cnf(c17, plain,
% 0.40/0.56 ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1),
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a10, a11])], [c8, c16])).
% 0.40/0.56 cnf(c18, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a10, a11])], [c8, c16])).
% 0.40/0.56
% 0.40/0.56 cnf(c19, axiom,
% 0.40/0.56 sub(c73,firma_1_1)).
% 0.40/0.56 cnf(a12, assumption,
% 0.40/0.56 X3 = c73).
% 0.40/0.56 cnf(a13, assumption,
% 0.40/0.56 firma_1_1 = firma_1_1).
% 0.40/0.56 cnf(c20, plain,
% 0.40/0.56 ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1),
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 0.40/0.56 cnf(c21, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 0.40/0.56
% 0.40/0.56 cnf(c22, plain,
% 0.40/0.56 sub(X0,name_1_1)).
% 0.40/0.56 cnf(a14, assumption,
% 0.40/0.56 X1 = X0).
% 0.40/0.56 cnf(a15, assumption,
% 0.40/0.56 name_1_1 = name_1_1).
% 0.40/0.56 cnf(c23, plain,
% 0.40/0.56 ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1),
% 0.40/0.56 inference(predicate_reduction, [assumptions([a14, a15])], [c20, c22])).
% 0.40/0.56
% 0.40/0.56 cnf(c24, axiom,
% 0.40/0.56 attr(c73,c74)).
% 0.40/0.56 cnf(a16, assumption,
% 0.40/0.56 X4 = c73).
% 0.40/0.56 cnf(a17, assumption,
% 0.40/0.56 X5 = c74).
% 0.40/0.56 cnf(c25, plain,
% 0.40/0.56 ~attr(X6,X0) | ~attr(X3,X1),
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 0.40/0.56 cnf(c26, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 0.40/0.56
% 0.40/0.56 cnf(c27, plain,
% 0.40/0.56 attr(X4,X5)).
% 0.40/0.56 cnf(a18, assumption,
% 0.40/0.56 X6 = X4).
% 0.40/0.56 cnf(a19, assumption,
% 0.40/0.56 X0 = X5).
% 0.40/0.56 cnf(c28, plain,
% 0.40/0.56 ~attr(X3,X1),
% 0.40/0.56 inference(predicate_reduction, [assumptions([a18, a19])], [c25, c27])).
% 0.40/0.56
% 0.40/0.56 cnf(c29, plain,
% 0.40/0.56 attr(X4,X5)).
% 0.40/0.56 cnf(a20, assumption,
% 0.40/0.56 X3 = X4).
% 0.40/0.56 cnf(a21, assumption,
% 0.40/0.56 X1 = X5).
% 0.40/0.56 cnf(c30, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(predicate_reduction, [assumptions([a20, a21])], [c28, c29])).
% 0.40/0.56
% 0.40/0.56 cnf(c31, plain,
% 0.40/0.56 $false,
% 0.40/0.56 inference(constraint_solving, [
% 0.40/0.56 bind(X0, c74),
% 0.40/0.56 bind(X1, c74),
% 0.40/0.56 bind(X2, sK53(X7,X8)),
% 0.40/0.56 bind(X3, c73),
% 0.40/0.56 bind(X4, c73),
% 0.40/0.56 bind(X5, c74),
% 0.40/0.56 bind(X6, c73),
% 0.40/0.56 bind(X7, c25),
% 0.40/0.56 bind(X8, n374bernehmen_1_1),
% 0.40/0.56 bind(X9, annahme_1_1)
% 0.40/0.56 ],
% 0.40/0.56 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 0.40/0.56
% 0.40/0.56 % SZS output end IncompleteProof
%------------------------------------------------------------------------------