TSTP Solution File: SYN345+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN345+1 : TPTP v8.1.0. Released v2.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 : 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:09:55 EDT 2022
% Result : Theorem 0.18s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN345+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n015.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 : Mon Jul 11 18:50:24 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.34 % SZS status Theorem
% 0.18/0.34 % SZS output begin IncompleteProof
% 0.18/0.34 cnf(c0, axiom,
% 0.18/0.34 ~big_f(sK0,sK1,sK1) | ~big_f(sK0,sK0,sK1) | ~big_f(sK1,sK1,X0)).
% 0.18/0.34 cnf(c1, plain,
% 0.18/0.34 ~big_f(sK0,sK1,sK1) | ~big_f(sK0,sK0,sK1) | ~big_f(sK1,sK1,X0),
% 0.18/0.34 inference(start, [], [c0])).
% 0.18/0.34
% 0.18/0.34 cnf(c2, axiom,
% 0.18/0.34 big_f(sK0,sK1,sK1) | ~big_f(sK0,sK0,sK1) | ~big_f(X1,X2,sK2(X2,X1))).
% 0.18/0.34 cnf(a0, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a1, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(a2, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(c3, plain,
% 0.18/0.34 ~big_f(sK0,sK0,sK1) | ~big_f(sK1,sK1,X0),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.18/0.34 cnf(c4, plain,
% 0.18/0.34 ~big_f(sK0,sK0,sK1) | ~big_f(X1,X2,sK2(X2,X1)),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.18/0.34
% 0.18/0.34 cnf(c5, axiom,
% 0.18/0.34 big_f(sK0,sK1,sK1) | big_f(sK0,sK0,sK1) | ~big_f(sK1,sK1,X3)).
% 0.18/0.34 cnf(a3, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a4, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a5, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(c6, plain,
% 0.18/0.34 ~big_f(X1,X2,sK2(X2,X1)),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.18/0.34 cnf(c7, plain,
% 0.18/0.34 big_f(sK0,sK1,sK1) | ~big_f(sK1,sK1,X3),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.18/0.34
% 0.18/0.34 cnf(c8, plain,
% 0.18/0.34 ~big_f(sK0,sK1,sK1)).
% 0.18/0.34 cnf(a6, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a7, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(a8, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(c9, plain,
% 0.18/0.34 ~big_f(sK1,sK1,X3),
% 0.18/0.34 inference(predicate_reduction, [assumptions([a6, a7, a8])], [c7, c8])).
% 0.18/0.34
% 0.18/0.34 cnf(c10, axiom,
% 0.18/0.34 big_f(X4,X5,sK2(X4,X5))).
% 0.18/0.34 cnf(a9, assumption,
% 0.18/0.34 sK1 = X4).
% 0.18/0.34 cnf(a10, assumption,
% 0.18/0.34 sK1 = X5).
% 0.18/0.34 cnf(a11, assumption,
% 0.18/0.34 X3 = sK2(X4,X5)).
% 0.18/0.34 cnf(c11, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c10])).
% 0.18/0.34 cnf(c12, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c10])).
% 0.18/0.34
% 0.18/0.34 cnf(c13, plain,
% 0.18/0.34 big_f(sK1,sK1,X3)).
% 0.18/0.34 cnf(a12, assumption,
% 0.18/0.34 X1 = sK1).
% 0.18/0.34 cnf(a13, assumption,
% 0.18/0.34 X2 = sK1).
% 0.18/0.34 cnf(a14, assumption,
% 0.18/0.34 sK2(X2,X1) = X3).
% 0.18/0.34 cnf(c14, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(predicate_reduction, [assumptions([a12, a13, a14])], [c6, c13])).
% 0.18/0.34
% 0.18/0.34 cnf(c15, axiom,
% 0.18/0.34 big_f(sK0,sK0,sK1) | ~big_f(sK0,sK1,sK1) | big_f(sK1,X6,X7)).
% 0.18/0.34 cnf(a15, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a16, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a17, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(c16, plain,
% 0.18/0.34 ~big_f(sK1,sK1,X0),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c3, c15])).
% 0.18/0.34 cnf(c17, plain,
% 0.18/0.34 ~big_f(sK0,sK1,sK1) | big_f(sK1,X6,X7),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c3, c15])).
% 0.18/0.34
% 0.18/0.34 cnf(c18, plain,
% 0.18/0.34 big_f(sK0,sK1,sK1)).
% 0.18/0.34 cnf(a18, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a19, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(a20, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(c19, plain,
% 0.18/0.34 big_f(sK1,X6,X7),
% 0.18/0.34 inference(predicate_reduction, [assumptions([a18, a19, a20])], [c17, c18])).
% 0.18/0.34
% 0.18/0.34 cnf(c20, axiom,
% 0.18/0.34 big_f(sK0,sK0,sK1) | ~big_f(sK0,sK1,sK1) | ~big_f(X8,sK2(X8,X9),sK2(X8,X9))).
% 0.18/0.34 cnf(a21, assumption,
% 0.18/0.34 sK1 = X8).
% 0.18/0.34 cnf(a22, assumption,
% 0.18/0.34 X6 = sK2(X8,X9)).
% 0.18/0.34 cnf(a23, assumption,
% 0.18/0.34 X7 = sK2(X8,X9)).
% 0.18/0.34 cnf(c21, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c19, c20])).
% 0.18/0.34 cnf(c22, plain,
% 0.18/0.34 big_f(sK0,sK0,sK1) | ~big_f(sK0,sK1,sK1),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c19, c20])).
% 0.18/0.34
% 0.18/0.34 cnf(c23, plain,
% 0.18/0.34 ~big_f(sK0,sK0,sK1)).
% 0.18/0.34 cnf(a24, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a25, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a26, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(c24, plain,
% 0.18/0.34 ~big_f(sK0,sK1,sK1),
% 0.18/0.34 inference(predicate_reduction, [assumptions([a24, a25, a26])], [c22, c23])).
% 0.18/0.34
% 0.18/0.34 cnf(c25, plain,
% 0.18/0.34 big_f(sK0,sK1,sK1)).
% 0.18/0.34 cnf(a27, assumption,
% 0.18/0.34 sK0 = sK0).
% 0.18/0.34 cnf(a28, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(a29, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(c26, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(predicate_reduction, [assumptions([a27, a28, a29])], [c24, c25])).
% 0.18/0.34
% 0.18/0.34 cnf(c27, plain,
% 0.18/0.34 big_f(sK1,sK1,X3)).
% 0.18/0.34 cnf(a30, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(a31, assumption,
% 0.18/0.34 sK1 = sK1).
% 0.18/0.34 cnf(a32, assumption,
% 0.18/0.34 X0 = X3).
% 0.18/0.34 cnf(c28, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(predicate_reduction, [assumptions([a30, a31, a32])], [c16, c27])).
% 0.18/0.34
% 0.18/0.34 cnf(c29, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(constraint_solving, [
% 0.18/0.34 bind(X0, sK2(X4,X5)),
% 0.18/0.34 bind(X1, sK1),
% 0.18/0.34 bind(X2, sK1),
% 0.18/0.34 bind(X3, sK2(X4,X5)),
% 0.18/0.34 bind(X4, sK1),
% 0.18/0.34 bind(X5, sK1),
% 0.18/0.34 bind(X6, sK2(X8,X9)),
% 0.18/0.34 bind(X7, sK2(X8,X9)),
% 0.18/0.34 bind(X8, sK1),
% 0.18/0.34 bind(X9, X9)
% 0.18/0.34 ],
% 0.18/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32])).
% 0.18/0.34
% 0.18/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------