TSTP Solution File: SYN386+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN386+1 : TPTP v8.1.0. Released v2.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 : n016.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 : Thu Jul 21 08:10:17 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN386+1 : TPTP v8.1.0. Released v2.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 : n016.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 : Mon Jul 11 13:36:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % SZS output begin IncompleteProof
% 0.12/0.35 cnf(c0, axiom,
% 0.12/0.35 ~big_d(sK2(X0,X1),X0,sK0(X0))).
% 0.12/0.35 cnf(c1, plain,
% 0.12/0.35 ~big_d(sK2(X0,X1),X0,sK0(X0)),
% 0.12/0.35 inference(start, [], [c0])).
% 0.12/0.35
% 0.12/0.35 cnf(c2, axiom,
% 0.12/0.35 big_d(X2,X3,X4) | ~big_f(X5,X3) | ~big_f(X6,X2) | ~big_d(X6,X5,sK3(X4))).
% 0.12/0.35 cnf(a0, assumption,
% 0.12/0.35 sK2(X0,X1) = X2).
% 0.12/0.35 cnf(a1, assumption,
% 0.12/0.35 X0 = X3).
% 0.12/0.35 cnf(a2, assumption,
% 0.12/0.35 sK0(X0) = X4).
% 0.12/0.35 cnf(c3, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.35 cnf(c4, plain,
% 0.12/0.35 ~big_f(X5,X3) | ~big_f(X6,X2) | ~big_d(X6,X5,sK3(X4)),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.35
% 0.12/0.35 cnf(c5, axiom,
% 0.12/0.35 big_f(X7,sK6(X7))).
% 0.12/0.35 cnf(a3, assumption,
% 0.12/0.35 X5 = X7).
% 0.12/0.35 cnf(a4, assumption,
% 0.12/0.35 X3 = sK6(X7)).
% 0.12/0.35 cnf(c6, plain,
% 0.12/0.35 ~big_f(X6,X2) | ~big_d(X6,X5,sK3(X4)),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 0.12/0.35 cnf(c7, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 0.12/0.35
% 0.12/0.35 cnf(c8, axiom,
% 0.12/0.35 big_f(sK1(X8,X9),sK2(X8,X9))).
% 0.12/0.35 cnf(a5, assumption,
% 0.12/0.35 X6 = sK1(X8,X9)).
% 0.12/0.35 cnf(a6, assumption,
% 0.12/0.35 X2 = sK2(X8,X9)).
% 0.12/0.35 cnf(c9, plain,
% 0.12/0.35 ~big_d(X6,X5,sK3(X4)),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c8])).
% 0.12/0.35 cnf(c10, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c8])).
% 0.12/0.35
% 0.12/0.35 cnf(c11, axiom,
% 0.12/0.35 big_d(X10,sK4,X11) | ~big_s(sK5(X11),X10)).
% 0.12/0.35 cnf(a7, assumption,
% 0.12/0.35 X6 = X10).
% 0.12/0.35 cnf(a8, assumption,
% 0.12/0.35 X5 = sK4).
% 0.12/0.35 cnf(a9, assumption,
% 0.12/0.35 sK3(X4) = X11).
% 0.12/0.35 cnf(c12, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c9, c11])).
% 0.12/0.35 cnf(c13, plain,
% 0.12/0.35 ~big_s(sK5(X11),X10),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c9, c11])).
% 0.12/0.35
% 0.12/0.35 cnf(c14, axiom,
% 0.12/0.35 big_s(X12,sK1(X13,X12))).
% 0.12/0.35 cnf(a10, assumption,
% 0.12/0.35 sK5(X11) = X12).
% 0.12/0.35 cnf(a11, assumption,
% 0.12/0.35 X10 = sK1(X13,X12)).
% 0.12/0.35 cnf(c15, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c14])).
% 0.12/0.35 cnf(c16, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c14])).
% 0.12/0.35
% 0.12/0.35 cnf(c17, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(constraint_solving, [
% 0.12/0.35 bind(X0, sK6(X7)),
% 0.12/0.35 bind(X1, sK5(X11)),
% 0.12/0.35 bind(X2, sK2(X0,X1)),
% 0.12/0.35 bind(X3, sK6(X7)),
% 0.12/0.35 bind(X4, sK0(X0)),
% 0.12/0.35 bind(X5, sK4),
% 0.12/0.35 bind(X6, sK1(X8,X9)),
% 0.12/0.35 bind(X7, sK4),
% 0.12/0.35 bind(X8, sK6(X7)),
% 0.12/0.35 bind(X9, sK5(X11)),
% 0.12/0.35 bind(X10, sK1(X8,X9)),
% 0.12/0.35 bind(X11, sK3(X4)),
% 0.12/0.35 bind(X12, sK5(X11)),
% 0.12/0.35 bind(X13, sK6(X7))
% 0.12/0.35 ],
% 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.12/0.35
% 0.12/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------