TSTP Solution File: SYN939+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN939+1 : TPTP v8.1.0. Released v3.1.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 : Thu Jul 21 08:14:17 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN939+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 06:00:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 q(f(X0))).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 q(f(X0)),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 ~q(X1) | ~r(sK1) | ~r(sK2) | sP0(X1,X2)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 f(X0) = X1).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 ~r(sK1) | ~r(sK2) | sP0(X1,X2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 ~q(X3) | r(X4) | sP0(X3,X4)).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 sK1 = X4).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 ~r(sK2) | sP0(X1,X2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 ~q(X3) | sP0(X3,X4),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 q(f(X5))).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 X3 = f(X5)).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 sP0(X3,X4),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 ~p(X6) | ~sP0(X6,X7)).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X3 = X6).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 X4 = X7).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c9, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 ~p(X6),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c9, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, axiom,
% 0.13/0.35 p(f(X8)) | ~sP0(X9,X8)).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X6 = f(X8)).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.13/0.35 cnf(c16, plain,
% 0.13/0.35 ~sP0(X9,X8),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c17, plain,
% 0.13/0.35 sP0(X3,X4)).
% 0.13/0.35 cnf(a6, assumption,
% 0.13/0.35 X9 = X3).
% 0.13/0.35 cnf(a7, assumption,
% 0.13/0.35 X8 = X4).
% 0.13/0.35 cnf(c18, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a6, a7])], [c16, c17])).
% 0.13/0.35
% 0.13/0.35 cnf(c19, axiom,
% 0.13/0.35 ~q(X10) | r(X11) | sP0(X10,X11)).
% 0.13/0.35 cnf(a8, assumption,
% 0.13/0.35 sK2 = X11).
% 0.13/0.35 cnf(c20, plain,
% 0.13/0.35 sP0(X1,X2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c6, c19])).
% 0.13/0.35 cnf(c21, plain,
% 0.13/0.35 ~q(X10) | sP0(X10,X11),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c6, c19])).
% 0.13/0.35
% 0.13/0.35 cnf(c22, plain,
% 0.13/0.35 q(f(X0))).
% 0.13/0.35 cnf(a9, assumption,
% 0.13/0.35 X10 = f(X0)).
% 0.13/0.35 cnf(c23, plain,
% 0.13/0.35 sP0(X10,X11),
% 0.13/0.35 inference(predicate_reduction, [assumptions([a9])], [c21, c22])).
% 0.13/0.35
% 0.13/0.35 cnf(c24, axiom,
% 0.13/0.35 ~p(X12) | ~sP0(X12,X13)).
% 0.13/0.35 cnf(a10, assumption,
% 0.13/0.35 X10 = X12).
% 0.13/0.35 cnf(a11, assumption,
% 0.13/0.35 X11 = X13).
% 0.13/0.35 cnf(c25, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c23, c24])).
% 0.13/0.35 cnf(c26, plain,
% 0.13/0.35 ~p(X12),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c23, c24])).
% 0.13/0.35
% 0.13/0.35 cnf(c27, axiom,
% 0.13/0.35 p(f(X14)) | ~sP0(X15,X14)).
% 0.13/0.35 cnf(a12, assumption,
% 0.13/0.35 X12 = f(X14)).
% 0.13/0.35 cnf(c28, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a12])], [c26, c27])).
% 0.13/0.35 cnf(c29, plain,
% 0.13/0.35 ~sP0(X15,X14),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a12])], [c26, c27])).
% 0.13/0.35
% 0.13/0.35 cnf(c30, plain,
% 0.13/0.35 sP0(X10,X11)).
% 0.13/0.35 cnf(a13, assumption,
% 0.13/0.35 X15 = X10).
% 0.13/0.35 cnf(a14, assumption,
% 0.13/0.35 X14 = X11).
% 0.13/0.35 cnf(c31, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a13, a14])], [c29, c30])).
% 0.13/0.35
% 0.13/0.35 cnf(c32, plain,
% 0.13/0.35 ~sP0(X10,X11)).
% 0.13/0.35 cnf(a15, assumption,
% 0.13/0.35 X1 = X10).
% 0.13/0.35 cnf(a16, assumption,
% 0.13/0.35 X2 = X11).
% 0.13/0.35 cnf(c33, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a15, a16])], [c20, c32])).
% 0.13/0.35
% 0.13/0.35 cnf(c34, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, sK2),
% 0.13/0.35 bind(X1, f(X0)),
% 0.13/0.35 bind(X2, sK2),
% 0.13/0.35 bind(X3, f(X5)),
% 0.13/0.35 bind(X4, sK1),
% 0.13/0.35 bind(X5, sK1),
% 0.13/0.35 bind(X6, f(X5)),
% 0.13/0.35 bind(X7, sK1),
% 0.13/0.35 bind(X8, sK1),
% 0.13/0.35 bind(X9, f(X5)),
% 0.13/0.35 bind(X10, f(X0)),
% 0.13/0.35 bind(X11, sK2),
% 0.13/0.35 bind(X12, f(X0)),
% 0.13/0.35 bind(X13, sK2),
% 0.13/0.35 bind(X14, sK2),
% 0.13/0.35 bind(X15, f(X0))
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------