TSTP Solution File: SYN331-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN331-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n027.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:09:45 EDT 2022
% Result : Unsatisfiable 0.11s 0.33s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN331-1 : TPTP v8.1.0. Released v1.2.0.
% 0.00/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jul 11 23:08:49 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % SZS status Unsatisfiable
% 0.11/0.33 % SZS output begin IncompleteProof
% 0.11/0.33 cnf(c0, axiom,
% 0.11/0.33 ~f(z(X0,X1),X1)).
% 0.11/0.33 cnf(c1, plain,
% 0.11/0.33 ~f(z(X0,X1),X1),
% 0.11/0.33 inference(start, [], [c0])).
% 0.11/0.33
% 0.11/0.33 cnf(c2, axiom,
% 0.11/0.33 ~f(z(X2,X3),z(X2,X3)) | f(X2,X3)).
% 0.11/0.33 cnf(a0, assumption,
% 0.11/0.33 z(X0,X1) = X2).
% 0.11/0.33 cnf(a1, assumption,
% 0.11/0.33 X1 = X3).
% 0.11/0.33 cnf(c3, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.33 cnf(c4, plain,
% 0.11/0.33 ~f(z(X2,X3),z(X2,X3)),
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.33
% 0.11/0.33 cnf(c5, axiom,
% 0.11/0.33 f(z(X4,X5),z(X4,X5)) | f(X5,X4)).
% 0.11/0.33 cnf(a2, assumption,
% 0.11/0.33 z(X2,X3) = X5).
% 0.11/0.33 cnf(a3, assumption,
% 0.11/0.33 z(X2,X3) = X4).
% 0.11/0.33 cnf(c6, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.11/0.33 cnf(c7, plain,
% 0.11/0.33 f(z(X4,X5),z(X4,X5)),
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.11/0.33
% 0.11/0.33 cnf(c8, axiom,
% 0.11/0.33 ~f(z(X6,X7),z(X6,X7)) | f(X6,X7)).
% 0.11/0.33 cnf(a4, assumption,
% 0.11/0.33 z(X4,X5) = z(X6,X7)).
% 0.11/0.33 cnf(a5, assumption,
% 0.11/0.33 z(X4,X5) = z(X6,X7)).
% 0.11/0.33 cnf(c9, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.11/0.33 cnf(c10, plain,
% 0.11/0.33 f(X6,X7),
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.11/0.33
% 0.11/0.33 cnf(c11, plain,
% 0.11/0.33 ~f(z(X2,X3),z(X2,X3))).
% 0.11/0.33 cnf(a6, assumption,
% 0.11/0.33 X6 = z(X2,X3)).
% 0.11/0.33 cnf(a7, assumption,
% 0.11/0.33 X7 = z(X2,X3)).
% 0.11/0.33 cnf(c12, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])).
% 0.11/0.33
% 0.11/0.33 cnf(c13, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(constraint_solving, [
% 0.11/0.33 bind(X0, X0),
% 0.11/0.33 bind(X1, X3),
% 0.11/0.33 bind(X2, z(X0,X1)),
% 0.11/0.33 bind(X3, X3),
% 0.11/0.33 bind(X4, z(X2,X3)),
% 0.11/0.33 bind(X5, z(X2,X3)),
% 0.11/0.33 bind(X6, z(X2,X3)),
% 0.11/0.33 bind(X7, z(X2,X3))
% 0.11/0.33 ],
% 0.11/0.33 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.11/0.33
% 0.11/0.33 % SZS output end IncompleteProof
%------------------------------------------------------------------------------