TSTP Solution File: SYN323-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN323-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 : 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:09:39 EDT 2022
% Result : Unsatisfiable 0.14s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN323-1 : TPTP v8.1.0. Released v1.2.0.
% 0.04/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 20:45:43 EDT 2022
% 0.14/0.36 % 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 ~g(X0,a) | ~f(a,X0)).
% 0.14/0.36 cnf(c1, plain,
% 0.14/0.36 ~g(X0,a) | ~f(a,X0),
% 0.14/0.36 inference(start, [], [c0])).
% 0.14/0.36
% 0.14/0.36 cnf(c2, axiom,
% 0.14/0.36 g(X1,a) | f(X1,a)).
% 0.14/0.36 cnf(a0, assumption,
% 0.14/0.36 X0 = X1).
% 0.14/0.36 cnf(a1, assumption,
% 0.14/0.36 a = a).
% 0.14/0.36 cnf(c3, plain,
% 0.14/0.36 ~f(a,X0),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.36 cnf(c4, plain,
% 0.14/0.36 f(X1,a),
% 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 g(X2,a) | ~f(a,X2)).
% 0.14/0.36 cnf(a2, assumption,
% 0.14/0.36 X1 = a).
% 0.14/0.36 cnf(a3, assumption,
% 0.14/0.36 a = X2).
% 0.14/0.36 cnf(c6, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.36 cnf(c7, plain,
% 0.14/0.36 g(X2,a),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.36
% 0.14/0.36 cnf(c8, plain,
% 0.14/0.36 ~g(X0,a)).
% 0.14/0.36 cnf(a4, assumption,
% 0.14/0.36 X2 = X0).
% 0.14/0.36 cnf(a5, assumption,
% 0.14/0.36 a = a).
% 0.14/0.36 cnf(c9, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(predicate_reduction, [assumptions([a4, a5])], [c7, c8])).
% 0.14/0.36
% 0.14/0.36 cnf(c10, axiom,
% 0.14/0.36 ~g(X3,a) | f(X3,a)).
% 0.14/0.36 cnf(a6, assumption,
% 0.14/0.36 a = X3).
% 0.14/0.36 cnf(a7, assumption,
% 0.14/0.36 X0 = a).
% 0.14/0.36 cnf(c11, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c10])).
% 0.14/0.36 cnf(c12, plain,
% 0.14/0.36 ~g(X3,a),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c10])).
% 0.14/0.36
% 0.14/0.36 cnf(c13, plain,
% 0.14/0.36 g(X0,a)).
% 0.14/0.36 cnf(a8, assumption,
% 0.14/0.36 X3 = X0).
% 0.14/0.36 cnf(a9, assumption,
% 0.14/0.36 a = a).
% 0.14/0.36 cnf(c14, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(predicate_reduction, [assumptions([a8, a9])], [c12, c13])).
% 0.14/0.36
% 0.14/0.36 cnf(c15, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(constraint_solving, [
% 0.14/0.36 bind(X0, a),
% 0.14/0.36 bind(X1, a),
% 0.14/0.36 bind(X2, a),
% 0.14/0.36 bind(X3, a)
% 0.14/0.36 ],
% 0.14/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.14/0.36
% 0.14/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------