TSTP Solution File: SYN122-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN122-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 : n015.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.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN122-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 18:19:54 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 % SZS status Unsatisfiable
% 0.14/0.36 % SZS output begin IncompleteProof
% 0.14/0.36 cnf(c0, axiom,
% 0.14/0.36 ~l2(b,e)).
% 0.14/0.36 cnf(c1, plain,
% 0.14/0.36 ~l2(b,e),
% 0.14/0.36 inference(start, [], [c0])).
% 0.14/0.36
% 0.14/0.36 cnf(c2, axiom,
% 0.14/0.36 ~l2(X0,X0) | ~n0(e,X0) | ~s1(X1) | l2(X1,X0)).
% 0.14/0.36 cnf(a0, assumption,
% 0.14/0.36 b = X1).
% 0.14/0.36 cnf(a1, assumption,
% 0.14/0.36 e = X0).
% 0.14/0.36 cnf(c3, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.36 cnf(c4, plain,
% 0.14/0.36 ~l2(X0,X0) | ~n0(e,X0) | ~s1(X1),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.36
% 0.14/0.36 cnf(c5, axiom,
% 0.14/0.36 ~m0(X2,X3,X4) | ~s1(X3) | ~p0(X5,X5) | l2(X4,X4)).
% 0.14/0.36 cnf(a2, assumption,
% 0.14/0.36 X0 = X4).
% 0.14/0.36 cnf(a3, assumption,
% 0.14/0.36 X0 = X4).
% 0.14/0.36 cnf(c6, plain,
% 0.14/0.36 ~n0(e,X0) | ~s1(X1),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.36 cnf(c7, plain,
% 0.14/0.36 ~m0(X2,X3,X4) | ~s1(X3) | ~p0(X5,X5),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.36
% 0.14/0.36 cnf(c8, axiom,
% 0.14/0.36 m0(b,b,e)).
% 0.14/0.36 cnf(a4, assumption,
% 0.14/0.36 X2 = b).
% 0.14/0.36 cnf(a5, assumption,
% 0.14/0.36 X3 = b).
% 0.14/0.36 cnf(a6, assumption,
% 0.14/0.36 X4 = e).
% 0.14/0.36 cnf(c9, plain,
% 0.14/0.36 ~s1(X3) | ~p0(X5,X5),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 0.14/0.36 cnf(c10, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 0.14/0.36
% 0.14/0.36 cnf(c11, axiom,
% 0.14/0.36 ~p0(X6,X6) | s1(X6)).
% 0.14/0.36 cnf(a7, assumption,
% 0.14/0.36 X3 = X6).
% 0.14/0.36 cnf(c12, plain,
% 0.14/0.36 ~p0(X5,X5),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c9, c11])).
% 0.14/0.36 cnf(c13, plain,
% 0.14/0.36 ~p0(X6,X6),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c9, c11])).
% 0.14/0.36
% 0.14/0.36 cnf(c14, axiom,
% 0.14/0.36 p0(b,X7)).
% 0.14/0.36 cnf(a8, assumption,
% 0.14/0.36 X6 = b).
% 0.14/0.36 cnf(a9, assumption,
% 0.14/0.36 X6 = X7).
% 0.14/0.36 cnf(c15, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.14/0.36 cnf(c16, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.14/0.36
% 0.14/0.36 cnf(c17, plain,
% 0.14/0.36 p0(X6,X6)).
% 0.14/0.36 cnf(a10, assumption,
% 0.14/0.36 X5 = X6).
% 0.14/0.36 cnf(a11, assumption,
% 0.14/0.36 X5 = X6).
% 0.14/0.36 cnf(c18, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(predicate_reduction, [assumptions([a10, a11])], [c12, c17])).
% 0.14/0.36
% 0.14/0.36 cnf(c19, axiom,
% 0.14/0.36 n0(e,e)).
% 0.14/0.36 cnf(a12, assumption,
% 0.14/0.36 e = e).
% 0.14/0.36 cnf(a13, assumption,
% 0.14/0.36 X0 = e).
% 0.14/0.36 cnf(c20, plain,
% 0.14/0.36 ~s1(X1),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c19])).
% 0.14/0.36 cnf(c21, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c19])).
% 0.14/0.36
% 0.14/0.36 cnf(c22, plain,
% 0.14/0.36 s1(X3)).
% 0.14/0.36 cnf(a14, assumption,
% 0.14/0.36 X1 = X3).
% 0.14/0.36 cnf(c23, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(predicate_reduction, [assumptions([a14])], [c20, c22])).
% 0.14/0.36
% 0.14/0.36 cnf(c24, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(constraint_solving, [
% 0.14/0.36 bind(X0, e),
% 0.14/0.36 bind(X1, b),
% 0.14/0.36 bind(X2, b),
% 0.14/0.36 bind(X3, b),
% 0.14/0.36 bind(X4, e),
% 0.14/0.36 bind(X5, b),
% 0.14/0.36 bind(X6, b),
% 0.14/0.36 bind(X7, b)
% 0.14/0.36 ],
% 0.14/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 0.14/0.36
% 0.14/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------