TSTP Solution File: SYN121-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN121-1 : TPTP v8.1.0. Released v1.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 : 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:08:21 EDT 2022
% Result : Unsatisfiable 0.14s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SYN121-1 : TPTP v8.1.0. Released v1.1.0.
% 0.14/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.37 % Computer : n016.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Tue Jul 12 06:19:29 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.14/0.39 % SZS status Unsatisfiable
% 0.14/0.39 % SZS output begin IncompleteProof
% 0.14/0.39 cnf(c0, axiom,
% 0.14/0.39 ~l2(a,b)).
% 0.14/0.39 cnf(c1, plain,
% 0.14/0.39 ~l2(a,b),
% 0.14/0.39 inference(start, [], [c0])).
% 0.14/0.39
% 0.14/0.39 cnf(c2, axiom,
% 0.14/0.39 ~l2(X0,X0) | ~n0(e,X0) | ~s1(X1) | l2(X1,X0)).
% 0.14/0.39 cnf(a0, assumption,
% 0.14/0.39 a = X1).
% 0.14/0.39 cnf(a1, assumption,
% 0.14/0.39 b = X0).
% 0.14/0.39 cnf(c3, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.39 cnf(c4, plain,
% 0.14/0.39 ~l2(X0,X0) | ~n0(e,X0) | ~s1(X1),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.39
% 0.14/0.39 cnf(c5, axiom,
% 0.14/0.39 ~m0(X2,X3,X4) | ~s1(X3) | ~p0(X5,X5) | l2(X4,X4)).
% 0.14/0.39 cnf(a2, assumption,
% 0.14/0.39 X0 = X4).
% 0.14/0.39 cnf(a3, assumption,
% 0.14/0.39 X0 = X4).
% 0.14/0.39 cnf(c6, plain,
% 0.14/0.39 ~n0(e,X0) | ~s1(X1),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.39 cnf(c7, plain,
% 0.14/0.39 ~m0(X2,X3,X4) | ~s1(X3) | ~p0(X5,X5),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.39
% 0.14/0.39 cnf(c8, axiom,
% 0.14/0.39 m0(X6,d,X7)).
% 0.14/0.39 cnf(a4, assumption,
% 0.14/0.39 X2 = X6).
% 0.14/0.39 cnf(a5, assumption,
% 0.14/0.39 X3 = d).
% 0.14/0.39 cnf(a6, assumption,
% 0.14/0.39 X4 = X7).
% 0.14/0.39 cnf(c9, plain,
% 0.14/0.39 ~s1(X3) | ~p0(X5,X5),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 0.14/0.39 cnf(c10, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 0.14/0.39
% 0.14/0.39 cnf(c11, axiom,
% 0.14/0.39 ~s1(X8) | ~q0(X9,X10) | s1(X9)).
% 0.14/0.39 cnf(a7, assumption,
% 0.14/0.39 X3 = X9).
% 0.14/0.39 cnf(c12, plain,
% 0.14/0.39 ~p0(X5,X5),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a7])], [c9, c11])).
% 0.14/0.39 cnf(c13, plain,
% 0.14/0.39 ~s1(X8) | ~q0(X9,X10),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a7])], [c9, c11])).
% 0.14/0.39
% 0.14/0.39 cnf(c14, axiom,
% 0.14/0.39 ~p0(X11,X11) | s1(X11)).
% 0.14/0.39 cnf(a8, assumption,
% 0.14/0.39 X8 = X11).
% 0.14/0.39 cnf(c15, plain,
% 0.14/0.39 ~q0(X9,X10),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])).
% 0.14/0.39 cnf(c16, plain,
% 0.14/0.39 ~p0(X11,X11),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])).
% 0.14/0.39
% 0.14/0.39 cnf(c17, axiom,
% 0.14/0.39 p0(b,X12)).
% 0.14/0.39 cnf(a9, assumption,
% 0.14/0.39 X11 = b).
% 0.14/0.39 cnf(a10, assumption,
% 0.14/0.39 X11 = X12).
% 0.14/0.39 cnf(c18, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])).
% 0.14/0.39 cnf(c19, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])).
% 0.14/0.39
% 0.14/0.39 cnf(c20, axiom,
% 0.14/0.39 q0(X13,d)).
% 0.14/0.39 cnf(a11, assumption,
% 0.14/0.39 X9 = X13).
% 0.14/0.39 cnf(a12, assumption,
% 0.14/0.39 X10 = d).
% 0.14/0.39 cnf(c21, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a11, a12])], [c15, c20])).
% 0.14/0.39 cnf(c22, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a11, a12])], [c15, c20])).
% 0.14/0.39
% 0.14/0.39 cnf(c23, plain,
% 0.14/0.39 p0(X11,X11)).
% 0.14/0.39 cnf(a13, assumption,
% 0.14/0.39 X5 = X11).
% 0.14/0.39 cnf(a14, assumption,
% 0.14/0.39 X5 = X11).
% 0.14/0.39 cnf(c24, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(predicate_reduction, [assumptions([a13, a14])], [c12, c23])).
% 0.14/0.39
% 0.14/0.39 cnf(c25, axiom,
% 0.14/0.39 n0(e,b)).
% 0.14/0.39 cnf(a15, assumption,
% 0.14/0.39 e = e).
% 0.14/0.39 cnf(a16, assumption,
% 0.14/0.39 X0 = b).
% 0.14/0.39 cnf(c26, plain,
% 0.14/0.39 ~s1(X1),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a15, a16])], [c6, c25])).
% 0.14/0.39 cnf(c27, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a15, a16])], [c6, c25])).
% 0.14/0.39
% 0.14/0.39 cnf(c28, axiom,
% 0.14/0.39 ~s1(X14) | ~q0(X15,X16) | s1(X15)).
% 0.14/0.39 cnf(a17, assumption,
% 0.14/0.39 X1 = X15).
% 0.14/0.39 cnf(c29, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a17])], [c26, c28])).
% 0.14/0.39 cnf(c30, plain,
% 0.14/0.39 ~s1(X14) | ~q0(X15,X16),
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a17])], [c26, c28])).
% 0.14/0.39
% 0.14/0.39 cnf(c31, plain,
% 0.14/0.39 s1(X8)).
% 0.14/0.39 cnf(a18, assumption,
% 0.14/0.39 X14 = X8).
% 0.14/0.39 cnf(c32, plain,
% 0.14/0.39 ~q0(X15,X16),
% 0.14/0.39 inference(predicate_reduction, [assumptions([a18])], [c30, c31])).
% 0.14/0.39
% 0.14/0.39 cnf(c33, axiom,
% 0.14/0.39 q0(X17,d)).
% 0.14/0.39 cnf(a19, assumption,
% 0.14/0.39 X15 = X17).
% 0.14/0.39 cnf(a20, assumption,
% 0.14/0.39 X16 = d).
% 0.14/0.39 cnf(c34, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a19, a20])], [c32, c33])).
% 0.14/0.39 cnf(c35, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(strict_predicate_extension, [assumptions([a19, a20])], [c32, c33])).
% 0.14/0.39
% 0.14/0.39 cnf(c36, plain,
% 0.14/0.39 $false,
% 0.14/0.39 inference(constraint_solving, [
% 0.14/0.39 bind(X0, b),
% 0.14/0.39 bind(X1, a),
% 0.14/0.39 bind(X2, X6),
% 0.14/0.39 bind(X3, d),
% 0.14/0.39 bind(X4, b),
% 0.14/0.39 bind(X5, b),
% 0.14/0.39 bind(X6, X6),
% 0.14/0.39 bind(X7, b),
% 0.14/0.39 bind(X8, b),
% 0.14/0.39 bind(X9, d),
% 0.14/0.39 bind(X10, d),
% 0.14/0.39 bind(X11, b),
% 0.14/0.39 bind(X12, b),
% 0.14/0.39 bind(X13, d),
% 0.14/0.39 bind(X14, b),
% 0.14/0.39 bind(X15, a),
% 0.14/0.39 bind(X16, d),
% 0.14/0.39 bind(X17, a)
% 0.14/0.39 ],
% 0.14/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 0.14/0.39
% 0.14/0.39 % SZS output end IncompleteProof
%------------------------------------------------------------------------------