TSTP Solution File: MGT048+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : MGT048+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n019.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 : Sun Jul 17 22:16:38 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT048+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 08:52:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.50 % SZS status Theorem
% 0.20/0.50 % SZS output begin IncompleteProof
% 0.20/0.50 cnf(c0, axiom,
% 0.20/0.50 organization(sK1)).
% 0.20/0.50 cnf(c1, plain,
% 0.20/0.50 organization(sK1),
% 0.20/0.50 inference(start, [], [c0])).
% 0.20/0.50
% 0.20/0.50 cnf(c2, axiom,
% 0.20/0.50 stock_of_knowledge(X0,X1) = stock_of_knowledge(X0,X2) | ~organization(X0)).
% 0.20/0.50 cnf(a0, assumption,
% 0.20/0.50 sK1 = X0).
% 0.20/0.50 cnf(c3, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.50 cnf(c4, plain,
% 0.20/0.50 stock_of_knowledge(X0,X1) = stock_of_knowledge(X0,X2),
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.50
% 0.20/0.50 cnf(c5, axiom,
% 0.20/0.50 smaller(capability(X3,X4),capability(X3,X5)) | ~greater(internal_friction(X3,X4),internal_friction(X3,X5)) | ~smaller_or_equal(stock_of_knowledge(X3,X4),stock_of_knowledge(X3,X5)) | ~sP0(X5,X3,X4)).
% 0.20/0.50 cnf(a1, assumption,
% 0.20/0.50 stock_of_knowledge(X3,X5) = stock_of_knowledge(X0,X1)).
% 0.20/0.50 cnf(a2, assumption,
% 0.20/0.50 stock_of_knowledge(X0,X2) = X6).
% 0.20/0.50 cnf(c6, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.20/0.50 cnf(c7, plain,
% 0.20/0.50 smaller(capability(X3,X4),capability(X3,X5)) | ~greater(internal_friction(X3,X4),internal_friction(X3,X5)) | ~sP0(X5,X3,X4),
% 0.20/0.50 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.20/0.50 cnf(c8, plain,
% 0.20/0.50 ~smaller_or_equal(stock_of_knowledge(X3,X4),X6),
% 0.20/0.50 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.20/0.50
% 0.20/0.50 cnf(c9, axiom,
% 0.20/0.50 smaller_or_equal(X7,X7)).
% 0.20/0.50 cnf(a3, assumption,
% 0.20/0.50 stock_of_knowledge(X3,X4) = X7).
% 0.20/0.50 cnf(a4, assumption,
% 0.20/0.50 X6 = X7).
% 0.20/0.50 cnf(c10, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])).
% 0.20/0.50 cnf(c11, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])).
% 0.20/0.50
% 0.20/0.50 cnf(c12, axiom,
% 0.20/0.50 ~smaller(capability(sK1,sK3),capability(sK1,sK2))).
% 0.20/0.50 cnf(a5, assumption,
% 0.20/0.50 capability(X3,X4) = capability(sK1,sK3)).
% 0.20/0.50 cnf(a6, assumption,
% 0.20/0.50 capability(X3,X5) = capability(sK1,sK2)).
% 0.20/0.50 cnf(c13, plain,
% 0.20/0.50 ~greater(internal_friction(X3,X4),internal_friction(X3,X5)) | ~sP0(X5,X3,X4),
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c12])).
% 0.20/0.50 cnf(c14, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c12])).
% 0.20/0.50
% 0.20/0.50 cnf(c15, axiom,
% 0.20/0.50 greater(internal_friction(X8,X9),internal_friction(X8,X10)) | ~greater(age(X8,X9),age(X8,X10)) | ~organization(X8)).
% 0.20/0.50 cnf(a7, assumption,
% 0.20/0.50 internal_friction(X3,X4) = internal_friction(X8,X9)).
% 0.20/0.50 cnf(a8, assumption,
% 0.20/0.50 internal_friction(X3,X5) = internal_friction(X8,X10)).
% 0.20/0.50 cnf(c16, plain,
% 0.20/0.50 ~sP0(X5,X3,X4),
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c15])).
% 0.20/0.50 cnf(c17, plain,
% 0.20/0.50 ~greater(age(X8,X9),age(X8,X10)) | ~organization(X8),
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c15])).
% 0.20/0.50
% 0.20/0.50 cnf(c18, axiom,
% 0.20/0.50 greater(age(sK1,sK3),age(sK1,sK2))).
% 0.20/0.50 cnf(a9, assumption,
% 0.20/0.50 age(X8,X9) = age(sK1,sK3)).
% 0.20/0.50 cnf(a10, assumption,
% 0.20/0.50 age(X8,X10) = age(sK1,sK2)).
% 0.20/0.50 cnf(c19, plain,
% 0.20/0.50 ~organization(X8),
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])).
% 0.20/0.50 cnf(c20, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])).
% 0.20/0.50
% 0.20/0.50 cnf(c21, plain,
% 0.20/0.50 organization(sK1)).
% 0.20/0.50 cnf(a11, assumption,
% 0.20/0.50 X8 = sK1).
% 0.20/0.50 cnf(c22, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(predicate_reduction, [assumptions([a11])], [c19, c21])).
% 0.20/0.50
% 0.20/0.50 cnf(c23, axiom,
% 0.20/0.50 sP0(X11,X12,X13) | ~organization(X12)).
% 0.20/0.50 cnf(a12, assumption,
% 0.20/0.50 X5 = X11).
% 0.20/0.50 cnf(a13, assumption,
% 0.20/0.50 X3 = X12).
% 0.20/0.50 cnf(a14, assumption,
% 0.20/0.50 X4 = X13).
% 0.20/0.50 cnf(c24, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c16, c23])).
% 0.20/0.50 cnf(c25, plain,
% 0.20/0.50 ~organization(X12),
% 0.20/0.50 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c16, c23])).
% 0.20/0.50
% 0.20/0.50 cnf(c26, plain,
% 0.20/0.50 organization(sK1)).
% 0.20/0.50 cnf(a15, assumption,
% 0.20/0.50 X12 = sK1).
% 0.20/0.50 cnf(c27, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(predicate_reduction, [assumptions([a15])], [c25, c26])).
% 0.20/0.50
% 0.20/0.50 cnf(c28, plain,
% 0.20/0.50 $false,
% 0.20/0.50 inference(constraint_solving, [
% 0.20/0.50 bind(X0, sK1),
% 0.20/0.50 bind(X1, sK2),
% 0.20/0.50 bind(X2, sK3),
% 0.20/0.50 bind(X3, sK1),
% 0.20/0.50 bind(X4, sK3),
% 0.20/0.50 bind(X5, sK2),
% 0.20/0.50 bind(X6, stock_of_knowledge(X0,X2)),
% 0.20/0.50 bind(X7, stock_of_knowledge(X3,X4)),
% 0.20/0.50 bind(X8, sK1),
% 0.20/0.50 bind(X9, sK3),
% 0.20/0.50 bind(X10, sK2),
% 0.20/0.50 bind(X11, sK2),
% 0.20/0.50 bind(X12, sK1),
% 0.20/0.50 bind(X13, sK3)
% 0.20/0.50 ],
% 0.20/0.50 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 0.20/0.50
% 0.20/0.50 % SZS output end IncompleteProof
%------------------------------------------------------------------------------