TSTP Solution File: SYN074-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN074-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n004.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:07:54 EDT 2022
% Result : Unsatisfiable 48.99s 6.62s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN074-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 05:49:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 48.99/6.62 % SZS status Unsatisfiable
% 48.99/6.62 % SZS output begin IncompleteProof
% 48.99/6.62 cnf(c0, axiom,
% 48.99/6.62 f(X0) = X0 | big_f(f(X0),g(X0))).
% 48.99/6.62 cnf(c1, plain,
% 48.99/6.62 f(X0) = X0 | big_f(f(X0),g(X0)),
% 48.99/6.62 inference(start, [], [c0])).
% 48.99/6.62
% 48.99/6.62 cnf(c2, axiom,
% 48.99/6.62 ~big_f(f(X1),h(X1,X2)) | h(X1,X2) != X2 | f(X1) != X1).
% 48.99/6.62 cnf(a0, assumption,
% 48.99/6.62 f(X1) = f(X0)).
% 48.99/6.62 cnf(c3, plain,
% 48.99/6.62 big_f(f(X0),g(X0)),
% 48.99/6.62 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 48.99/6.62 cnf(c4, plain,
% 48.99/6.62 ~big_f(f(X1),h(X1,X2)) | h(X1,X2) != X2,
% 48.99/6.62 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 48.99/6.62 cnf(c5, plain,
% 48.99/6.62 X0 != X1,
% 48.99/6.62 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 48.99/6.62
% 48.99/6.62 cnf(a1, assumption,
% 48.99/6.62 X0 = X1).
% 48.99/6.62 cnf(c6, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(reflexivity, [assumptions([a1])], [c5])).
% 48.99/6.62
% 48.99/6.62 cnf(c7, axiom,
% 48.99/6.62 h(X3,X4) = X4 | big_f(f(X3),h(X3,X4)) | f(X3) != X3).
% 48.99/6.62 cnf(a2, assumption,
% 48.99/6.62 f(X1) = f(X3)).
% 48.99/6.62 cnf(a3, assumption,
% 48.99/6.62 h(X1,X2) = h(X3,X4)).
% 48.99/6.62 cnf(c8, plain,
% 48.99/6.62 h(X1,X2) != X2,
% 48.99/6.62 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c7])).
% 48.99/6.62 cnf(c9, plain,
% 48.99/6.62 h(X3,X4) = X4 | f(X3) != X3,
% 48.99/6.62 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c7])).
% 48.99/6.62
% 48.99/6.62 cnf(c10, plain,
% 48.99/6.62 ~big_f(f(X1),h(X1,X2))).
% 48.99/6.62 cnf(a4, assumption,
% 48.99/6.62 h(X1,X2) = h(X3,X4)).
% 48.99/6.62 cnf(c11, plain,
% 48.99/6.62 f(X3) != X3,
% 48.99/6.62 inference(subterm_reduction, [assumptions([a4])], [c9, c10])).
% 48.99/6.62 cnf(c12, plain,
% 48.99/6.62 ~big_f(f(X1),X4),
% 48.99/6.62 inference(subterm_reduction, [assumptions([a4])], [c9, c10])).
% 48.99/6.62
% 48.99/6.62 cnf(c13, plain,
% 48.99/6.62 f(X1) = X1).
% 48.99/6.62 cnf(a5, assumption,
% 48.99/6.62 f(X1) = f(X1)).
% 48.99/6.62 cnf(c14, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(equality_reduction, [assumptions([a5])], [c12, c13])).
% 48.99/6.62 cnf(c15, plain,
% 48.99/6.62 ~big_f(X1,X4),
% 48.99/6.62 inference(equality_reduction, [assumptions([a5])], [c12, c13])).
% 48.99/6.62
% 48.99/6.62 cnf(c16, axiom,
% 48.99/6.62 big_f(a,b)).
% 48.99/6.62 cnf(a6, assumption,
% 48.99/6.62 X1 = a).
% 48.99/6.62 cnf(a7, assumption,
% 48.99/6.62 X4 = b).
% 48.99/6.62 cnf(c17, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(strict_predicate_extension, [assumptions([a6, a7])], [c15, c16])).
% 48.99/6.62 cnf(c18, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(strict_predicate_extension, [assumptions([a6, a7])], [c15, c16])).
% 48.99/6.62
% 48.99/6.62 cnf(c19, plain,
% 48.99/6.62 f(X0) = X0).
% 48.99/6.62 cnf(a8, assumption,
% 48.99/6.62 f(X3) = f(X0)).
% 48.99/6.62 cnf(c20, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(equality_reduction, [assumptions([a8])], [c11, c19])).
% 48.99/6.62 cnf(c21, plain,
% 48.99/6.62 X0 != X3,
% 48.99/6.62 inference(equality_reduction, [assumptions([a8])], [c11, c19])).
% 48.99/6.62
% 48.99/6.62 cnf(a9, assumption,
% 48.99/6.62 X0 = X3).
% 48.99/6.62 cnf(c22, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(reflexivity, [assumptions([a9])], [c21])).
% 48.99/6.62
% 48.99/6.62 cnf(c23, axiom,
% 48.99/6.62 b = X5 | ~big_f(X6,X5)).
% 48.99/6.62 cnf(a10, assumption,
% 48.99/6.62 h(X1,X2) = X5).
% 48.99/6.62 cnf(c24, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(variable_extension, [assumptions([a10])], [c8, c23])).
% 48.99/6.62 cnf(c25, plain,
% 48.99/6.62 ~big_f(X6,X5),
% 48.99/6.62 inference(variable_extension, [assumptions([a10])], [c8, c23])).
% 48.99/6.62 cnf(c26, plain,
% 48.99/6.62 b != X7 | X7 != X2,
% 48.99/6.62 inference(variable_extension, [assumptions([a10])], [c8, c23])).
% 48.99/6.62
% 48.99/6.62 cnf(a11, assumption,
% 48.99/6.62 b = X7).
% 48.99/6.62 cnf(c27, plain,
% 48.99/6.62 X7 != X2,
% 48.99/6.62 inference(reflexivity, [assumptions([a11])], [c26])).
% 48.99/6.62
% 48.99/6.62 cnf(a12, assumption,
% 48.99/6.62 X7 = X2).
% 48.99/6.62 cnf(c28, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(reflexivity, [assumptions([a12])], [c27])).
% 48.99/6.62
% 48.99/6.62 cnf(c29, plain,
% 48.99/6.62 big_f(f(X1),h(X1,X2))).
% 48.99/6.62 cnf(a13, assumption,
% 48.99/6.62 X6 = f(X1)).
% 48.99/6.62 cnf(a14, assumption,
% 48.99/6.62 X5 = h(X1,X2)).
% 48.99/6.62 cnf(c30, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(predicate_reduction, [assumptions([a13, a14])], [c25, c29])).
% 48.99/6.62
% 48.99/6.62 cnf(c31, axiom,
% 48.99/6.62 a = X8 | ~big_f(X8,X9)).
% 48.99/6.62 cnf(a15, assumption,
% 48.99/6.62 f(X0) = X8).
% 48.99/6.62 cnf(a16, assumption,
% 48.99/6.62 g(X0) = X9).
% 48.99/6.62 cnf(c32, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(strict_predicate_extension, [assumptions([a15, a16])], [c3, c31])).
% 48.99/6.62 cnf(c33, plain,
% 48.99/6.62 a = X8,
% 48.99/6.62 inference(strict_predicate_extension, [assumptions([a15, a16])], [c3, c31])).
% 48.99/6.62
% 48.99/6.62 cnf(c34, plain,
% 48.99/6.62 f(X0) != X0).
% 48.99/6.62 cnf(a17, assumption,
% 48.99/6.62 f(X0) = X8).
% 48.99/6.62 cnf(a18, assumption,
% 48.99/6.62 a = X10).
% 48.99/6.62 cnf(c35, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(subterm_reduction, [assumptions([a17, a18])], [c33, c34])).
% 48.99/6.62 cnf(c36, plain,
% 48.99/6.62 X10 != X0,
% 48.99/6.62 inference(subterm_reduction, [assumptions([a17, a18])], [c33, c34])).
% 48.99/6.62
% 48.99/6.62 cnf(a19, assumption,
% 48.99/6.62 X10 = X0).
% 48.99/6.62 cnf(c37, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(reflexivity, [assumptions([a19])], [c36])).
% 48.99/6.62
% 48.99/6.62 cnf(c38, plain,
% 48.99/6.62 $false,
% 48.99/6.62 inference(constraint_solving, [
% 48.99/6.62 bind(X0, a),
% 48.99/6.62 bind(X1, a),
% 48.99/6.62 bind(X2, b),
% 48.99/6.62 bind(X3, a),
% 48.99/6.62 bind(X4, b),
% 48.99/6.62 bind(X5, h(X1,X2)),
% 48.99/6.62 bind(X6, f(X1)),
% 48.99/6.62 bind(X7, b),
% 48.99/6.62 bind(X8, f(X0)),
% 48.99/6.62 bind(X9, g(X0)),
% 48.99/6.62 bind(X10, a)
% 48.99/6.62 ],
% 48.99/6.62 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 48.99/6.62
% 48.99/6.62 % SZS output end IncompleteProof
%------------------------------------------------------------------------------