TSTP Solution File: CSR115+81 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR115+81 : 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 : n005.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:45 EDT 2022
% Result : Theorem 0.41s 0.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR115+81 : 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.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 01:56:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.41/0.57 % SZS status Theorem
% 0.41/0.57 % SZS output begin IncompleteProof
% 0.41/0.57 cnf(c0, axiom,
% 0.41/0.57 ~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)).
% 0.41/0.57 cnf(c1, plain,
% 0.41/0.57 ~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),
% 0.41/0.57 inference(start, [], [c0])).
% 0.41/0.57
% 0.41/0.57 cnf(c2, axiom,
% 0.41/0.57 val(c58,bmw_0)).
% 0.41/0.57 cnf(a0, assumption,
% 0.41/0.57 X0 = c58).
% 0.41/0.57 cnf(a1, assumption,
% 0.41/0.57 bmw_0 = bmw_0).
% 0.41/0.57 cnf(c3, plain,
% 0.41/0.57 ~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),
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.41/0.57 cnf(c4, plain,
% 0.41/0.57 $false,
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.41/0.57
% 0.41/0.57 cnf(c5, plain,
% 0.41/0.57 val(X0,bmw_0)).
% 0.41/0.57 cnf(a2, assumption,
% 0.41/0.57 X1 = X0).
% 0.41/0.57 cnf(a3, assumption,
% 0.41/0.57 bmw_0 = bmw_0).
% 0.41/0.57 cnf(c6, plain,
% 0.41/0.57 ~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),
% 0.41/0.57 inference(predicate_reduction, [assumptions([a2, a3])], [c3, c5])).
% 0.41/0.57
% 0.41/0.57 cnf(c7, axiom,
% 0.41/0.57 subs(c45,n374bernehmen_1_1)).
% 0.41/0.57 cnf(a4, assumption,
% 0.41/0.57 X2 = c45).
% 0.41/0.57 cnf(a5, assumption,
% 0.41/0.57 n374bernehmen_1_1 = n374bernehmen_1_1).
% 0.41/0.57 cnf(c8, plain,
% 0.41/0.57 ~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),
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])).
% 0.41/0.57 cnf(c9, plain,
% 0.41/0.57 $false,
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])).
% 0.41/0.57
% 0.41/0.57 cnf(c10, axiom,
% 0.41/0.57 sub(c58,name_1_1)).
% 0.41/0.57 cnf(a6, assumption,
% 0.41/0.57 X0 = c58).
% 0.41/0.57 cnf(a7, assumption,
% 0.41/0.57 name_1_1 = name_1_1).
% 0.41/0.57 cnf(c11, plain,
% 0.41/0.57 ~sub(X3,firma_1_1) | ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a6, a7])], [c8, c10])).
% 0.41/0.57 cnf(c12, plain,
% 0.41/0.57 $false,
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a6, a7])], [c8, c10])).
% 0.41/0.57
% 0.41/0.57 cnf(c13, axiom,
% 0.41/0.57 sub(c57,firma_1_1)).
% 0.41/0.57 cnf(a8, assumption,
% 0.41/0.57 X3 = c57).
% 0.41/0.57 cnf(a9, assumption,
% 0.41/0.57 firma_1_1 = firma_1_1).
% 0.41/0.57 cnf(c14, plain,
% 0.41/0.57 ~sub(X1,name_1_1) | ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])).
% 0.41/0.57 cnf(c15, plain,
% 0.41/0.57 $false,
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])).
% 0.41/0.57
% 0.41/0.57 cnf(c16, plain,
% 0.41/0.57 sub(X0,name_1_1)).
% 0.41/0.57 cnf(a10, assumption,
% 0.41/0.57 X1 = X0).
% 0.41/0.57 cnf(a11, assumption,
% 0.41/0.57 name_1_1 = name_1_1).
% 0.41/0.57 cnf(c17, plain,
% 0.41/0.57 ~attr(X4,X5) | ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 0.41/0.57 inference(predicate_reduction, [assumptions([a10, a11])], [c14, c16])).
% 0.41/0.57
% 0.41/0.57 cnf(c18, axiom,
% 0.41/0.57 attr(c57,c58)).
% 0.41/0.57 cnf(a12, assumption,
% 0.41/0.57 X4 = c57).
% 0.41/0.57 cnf(a13, assumption,
% 0.41/0.57 X5 = c58).
% 0.41/0.57 cnf(c19, plain,
% 0.41/0.57 ~attr(X6,X0) | ~attr(X3,X1) | ~agt(X2,X6),
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c18])).
% 0.41/0.57 cnf(c20, plain,
% 0.41/0.57 $false,
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c18])).
% 0.41/0.57
% 0.41/0.57 cnf(c21, plain,
% 0.41/0.57 attr(X4,X5)).
% 0.41/0.57 cnf(a14, assumption,
% 0.41/0.57 X6 = X4).
% 0.41/0.57 cnf(a15, assumption,
% 0.41/0.57 X0 = X5).
% 0.41/0.57 cnf(c22, plain,
% 0.41/0.57 ~attr(X3,X1) | ~agt(X2,X6),
% 0.41/0.57 inference(predicate_reduction, [assumptions([a14, a15])], [c19, c21])).
% 0.41/0.57
% 0.41/0.57 cnf(c23, plain,
% 0.41/0.57 attr(X4,X5)).
% 0.41/0.57 cnf(a16, assumption,
% 0.41/0.57 X3 = X4).
% 0.41/0.57 cnf(a17, assumption,
% 0.41/0.57 X1 = X5).
% 0.41/0.57 cnf(c24, plain,
% 0.41/0.57 ~agt(X2,X6),
% 0.41/0.57 inference(predicate_reduction, [assumptions([a16, a17])], [c22, c23])).
% 0.41/0.57
% 0.41/0.57 cnf(c25, axiom,
% 0.41/0.57 agt(c45,c57)).
% 0.41/0.57 cnf(a18, assumption,
% 0.41/0.57 X2 = c45).
% 0.41/0.57 cnf(a19, assumption,
% 0.41/0.57 X6 = c57).
% 0.41/0.57 cnf(c26, plain,
% 0.41/0.57 $false,
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a18, a19])], [c24, c25])).
% 0.41/0.57 cnf(c27, plain,
% 0.41/0.57 $false,
% 0.41/0.57 inference(strict_predicate_extension, [assumptions([a18, a19])], [c24, c25])).
% 0.41/0.57
% 0.41/0.57 cnf(c28, plain,
% 0.41/0.57 $false,
% 0.41/0.57 inference(constraint_solving, [
% 0.41/0.57 bind(X0, c58),
% 0.41/0.57 bind(X1, c58),
% 0.41/0.57 bind(X2, c45),
% 0.41/0.57 bind(X3, c57),
% 0.41/0.57 bind(X4, c57),
% 0.41/0.57 bind(X5, c58),
% 0.41/0.57 bind(X6, c57)
% 0.41/0.57 ],
% 0.41/0.57 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 0.41/0.57
% 0.41/0.57 % SZS output end IncompleteProof
%------------------------------------------------------------------------------