TSTP Solution File: CSR115+58 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR115+58 : 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 : n020.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:40 EDT 2022
% Result : Theorem 0.19s 0.56s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CSR115+58 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n020.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 19:45:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.56 % SZS status Theorem
% 0.19/0.56 % SZS output begin IncompleteProof
% 0.19/0.56 cnf(c0, axiom,
% 0.19/0.56 ~subs(X0,n374bernehmen_1_1) | ~sub(X1,name_1_1) | ~sub(X2,name_1_1) | ~attr(X3,X4) | ~attr(X5,X1) | ~attr(X6,X2)).
% 0.19/0.56 cnf(c1, plain,
% 0.19/0.56 ~subs(X0,n374bernehmen_1_1) | ~sub(X1,name_1_1) | ~sub(X2,name_1_1) | ~attr(X3,X4) | ~attr(X5,X1) | ~attr(X6,X2),
% 0.19/0.56 inference(start, [], [c0])).
% 0.19/0.56
% 0.19/0.56 cnf(c2, axiom,
% 0.19/0.56 subs(sK53(X7,X8),X8) | ~subs(X7,X9) | ~chea(X8,X9)).
% 0.19/0.56 cnf(a0, assumption,
% 0.19/0.56 X0 = sK53(X7,X8)).
% 0.19/0.56 cnf(a1, assumption,
% 0.19/0.56 n374bernehmen_1_1 = X8).
% 0.19/0.56 cnf(c3, plain,
% 0.19/0.56 ~sub(X1,name_1_1) | ~sub(X2,name_1_1) | ~attr(X3,X4) | ~attr(X5,X1) | ~attr(X6,X2),
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.56 cnf(c4, plain,
% 0.19/0.56 ~subs(X7,X9) | ~chea(X8,X9),
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.56
% 0.19/0.56 cnf(c5, axiom,
% 0.19/0.56 subs(c113,annahme_1_1)).
% 0.19/0.56 cnf(a2, assumption,
% 0.19/0.56 X7 = c113).
% 0.19/0.56 cnf(a3, assumption,
% 0.19/0.56 X9 = annahme_1_1).
% 0.19/0.56 cnf(c6, plain,
% 0.19/0.56 ~chea(X8,X9),
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.56 cnf(c7, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.56
% 0.19/0.56 cnf(c8, axiom,
% 0.19/0.56 chea(n374bernehmen_1_1,annahme_1_1)).
% 0.19/0.56 cnf(a4, assumption,
% 0.19/0.56 X8 = n374bernehmen_1_1).
% 0.19/0.56 cnf(a5, assumption,
% 0.19/0.56 X9 = annahme_1_1).
% 0.19/0.56 cnf(c9, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.19/0.56 cnf(c10, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.19/0.56
% 0.19/0.56 cnf(c11, axiom,
% 0.19/0.56 sub(c104,name_1_1)).
% 0.19/0.56 cnf(a6, assumption,
% 0.19/0.56 X1 = c104).
% 0.19/0.56 cnf(a7, assumption,
% 0.19/0.56 name_1_1 = name_1_1).
% 0.19/0.56 cnf(c12, plain,
% 0.19/0.56 ~sub(X2,name_1_1) | ~attr(X3,X4) | ~attr(X5,X1) | ~attr(X6,X2),
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c11])).
% 0.19/0.56 cnf(c13, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c11])).
% 0.19/0.56
% 0.19/0.56 cnf(c14, plain,
% 0.19/0.56 sub(X1,name_1_1)).
% 0.19/0.56 cnf(a8, assumption,
% 0.19/0.56 X2 = X1).
% 0.19/0.56 cnf(a9, assumption,
% 0.19/0.56 name_1_1 = name_1_1).
% 0.19/0.56 cnf(c15, plain,
% 0.19/0.56 ~attr(X3,X4) | ~attr(X5,X1) | ~attr(X6,X2),
% 0.19/0.56 inference(predicate_reduction, [assumptions([a8, a9])], [c12, c14])).
% 0.19/0.56
% 0.19/0.56 cnf(c16, axiom,
% 0.19/0.56 attr(c103,c104)).
% 0.19/0.56 cnf(a10, assumption,
% 0.19/0.56 X3 = c103).
% 0.19/0.56 cnf(a11, assumption,
% 0.19/0.56 X4 = c104).
% 0.19/0.56 cnf(c17, plain,
% 0.19/0.56 ~attr(X5,X1) | ~attr(X6,X2),
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])).
% 0.19/0.56 cnf(c18, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])).
% 0.19/0.56
% 0.19/0.56 cnf(c19, plain,
% 0.19/0.56 attr(X3,X4)).
% 0.19/0.56 cnf(a12, assumption,
% 0.19/0.56 X5 = X3).
% 0.19/0.56 cnf(a13, assumption,
% 0.19/0.56 X1 = X4).
% 0.19/0.56 cnf(c20, plain,
% 0.19/0.56 ~attr(X6,X2),
% 0.19/0.56 inference(predicate_reduction, [assumptions([a12, a13])], [c17, c19])).
% 0.19/0.56
% 0.19/0.56 cnf(c21, plain,
% 0.19/0.56 attr(X3,X4)).
% 0.19/0.56 cnf(a14, assumption,
% 0.19/0.56 X6 = X3).
% 0.19/0.56 cnf(a15, assumption,
% 0.19/0.56 X2 = X4).
% 0.19/0.56 cnf(c22, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(predicate_reduction, [assumptions([a14, a15])], [c20, c21])).
% 0.19/0.56
% 0.19/0.56 cnf(c23, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(constraint_solving, [
% 0.19/0.56 bind(X0, sK53(X7,X8)),
% 0.19/0.56 bind(X1, c104),
% 0.19/0.56 bind(X2, c104),
% 0.19/0.56 bind(X3, c103),
% 0.19/0.56 bind(X4, c104),
% 0.19/0.56 bind(X5, c103),
% 0.19/0.56 bind(X6, c103),
% 0.19/0.56 bind(X7, c113),
% 0.19/0.56 bind(X8, n374bernehmen_1_1),
% 0.19/0.56 bind(X9, annahme_1_1)
% 0.19/0.56 ],
% 0.19/0.56 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 0.19/0.56
% 0.19/0.56 % SZS output end IncompleteProof
%------------------------------------------------------------------------------