TSTP Solution File: CSR103+7 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR103+7 : TPTP v8.1.0. Bugfixed v7.3.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 : Fri Jul 15 20:37:13 EDT 2022
% Result : Theorem 2.65s 2.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR103+7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n019.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 : Sat Jun 11 08:29:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.65/2.39 % SZS status Theorem
% 2.65/2.39 % SZS output begin IncompleteProof
% 2.65/2.39 cnf(c0, axiom,
% 2.65/2.39 ~s__instance(sK15495(X0),X0)).
% 2.65/2.39 cnf(c1, plain,
% 2.65/2.39 ~s__instance(sK15495(X0),X0),
% 2.65/2.39 inference(start, [], [c0])).
% 2.65/2.39
% 2.65/2.39 cnf(c2, axiom,
% 2.65/2.39 s__instance(X1,s__UnitOfMeasure)).
% 2.65/2.39 cnf(a0, assumption,
% 2.65/2.39 sK15495(X0) = X1).
% 2.65/2.39 cnf(a1, assumption,
% 2.65/2.39 X0 = s__UnitOfMeasure).
% 2.65/2.39 cnf(c3, plain,
% 2.65/2.39 $false,
% 2.65/2.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.65/2.39 cnf(c4, plain,
% 2.65/2.39 $false,
% 2.65/2.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.65/2.39
% 2.65/2.39 cnf(c5, plain,
% 2.65/2.39 $false,
% 2.65/2.39 inference(constraint_solving, [
% 2.65/2.39 bind(X0, s__UnitOfMeasure),
% 2.65/2.39 bind(X1, sK15495(X0))
% 2.65/2.39 ],
% 2.65/2.39 [a0, a1])).
% 2.65/2.39
% 2.65/2.39 % SZS output end IncompleteProof
%------------------------------------------------------------------------------