TSTP Solution File: GRA010+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GRA010+2 : TPTP v8.1.0. Bugfixed v3.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 : n028.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 : Sat Jul 16 07:18:58 EDT 2022
% Result : Theorem 23.22s 3.33s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRA010+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 22:48:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 23.22/3.33 % SZS status Theorem
% 23.22/3.33 % SZS output begin IncompleteProof
% 23.22/3.33 cnf(c0, axiom,
% 23.22/3.33 triangle(X0,X1,sK27(X0,X1)) | ~sequential(X0,X1) | ~on_path(X1,sK24) | ~on_path(X0,sK24)).
% 23.22/3.33 cnf(c1, plain,
% 23.22/3.33 triangle(X0,X1,sK27(X0,X1)) | ~sequential(X0,X1) | ~on_path(X1,sK24) | ~on_path(X0,sK24),
% 23.22/3.33 inference(start, [], [c0])).
% 23.22/3.33
% 23.22/3.33 cnf(c2, axiom,
% 23.22/3.33 ~triangle(sK21(X2),sK22(X2),X3) | ~sP14(X2)).
% 23.22/3.33 cnf(a0, assumption,
% 23.22/3.33 X0 = sK21(X2)).
% 23.22/3.33 cnf(a1, assumption,
% 23.22/3.33 X1 = sK22(X2)).
% 23.22/3.33 cnf(a2, assumption,
% 23.22/3.33 sK27(X0,X1) = X3).
% 23.22/3.33 cnf(c3, plain,
% 23.22/3.33 ~sequential(X0,X1) | ~on_path(X1,sK24) | ~on_path(X0,sK24),
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 23.22/3.33 cnf(c4, plain,
% 23.22/3.33 ~sP14(X2),
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 23.22/3.33
% 23.22/3.33 cnf(c5, axiom,
% 23.22/3.33 number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) | sP14(X4) | ~path(X5,X6,X4)).
% 23.22/3.33 cnf(a3, assumption,
% 23.22/3.33 X2 = X4).
% 23.22/3.33 cnf(c6, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a3])], [c4, c5])).
% 23.22/3.33 cnf(c7, plain,
% 23.22/3.33 number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) | ~path(X5,X6,X4),
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a3])], [c4, c5])).
% 23.22/3.33
% 23.22/3.33 cnf(c8, axiom,
% 23.22/3.33 number_of_in(sequential_pairs,sK24) != number_of_in(triangles,sK24)).
% 23.22/3.33 cnf(a4, assumption,
% 23.22/3.33 number_of_in(triangles,sK24) = number_of_in(triangles,X4)).
% 23.22/3.33 cnf(a5, assumption,
% 23.22/3.33 number_of_in(sequential_pairs,X4) = X7).
% 23.22/3.33 cnf(c9, plain,
% 23.22/3.33 ~path(X5,X6,X4),
% 23.22/3.33 inference(strict_subterm_extension, [assumptions([a4, a5])], [c7, c8])).
% 23.22/3.33 cnf(c10, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(strict_subterm_extension, [assumptions([a4, a5])], [c7, c8])).
% 23.22/3.33 cnf(c11, plain,
% 23.22/3.33 number_of_in(sequential_pairs,sK24) != X7,
% 23.22/3.33 inference(strict_subterm_extension, [assumptions([a4, a5])], [c7, c8])).
% 23.22/3.33
% 23.22/3.33 cnf(a6, assumption,
% 23.22/3.33 number_of_in(sequential_pairs,sK24) = X7).
% 23.22/3.33 cnf(c12, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(reflexivity, [assumptions([a6])], [c11])).
% 23.22/3.33
% 23.22/3.33 cnf(c13, axiom,
% 23.22/3.33 path(sK25,sK26,sK24)).
% 23.22/3.33 cnf(a7, assumption,
% 23.22/3.33 X5 = sK25).
% 23.22/3.33 cnf(a8, assumption,
% 23.22/3.33 X6 = sK26).
% 23.22/3.33 cnf(a9, assumption,
% 23.22/3.33 X4 = sK24).
% 23.22/3.33 cnf(c14, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c9, c13])).
% 23.22/3.33 cnf(c15, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c9, c13])).
% 23.22/3.33
% 23.22/3.33 cnf(c16, axiom,
% 23.22/3.33 sequential(sK21(X8),sK22(X8)) | ~sP14(X8)).
% 23.22/3.33 cnf(a10, assumption,
% 23.22/3.33 X0 = sK21(X8)).
% 23.22/3.33 cnf(a11, assumption,
% 23.22/3.33 X1 = sK22(X8)).
% 23.22/3.33 cnf(c17, plain,
% 23.22/3.33 ~on_path(X1,sK24) | ~on_path(X0,sK24),
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a10, a11])], [c3, c16])).
% 23.22/3.33 cnf(c18, plain,
% 23.22/3.33 ~sP14(X8),
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a10, a11])], [c3, c16])).
% 23.22/3.33
% 23.22/3.33 cnf(c19, plain,
% 23.22/3.33 sP14(X2)).
% 23.22/3.33 cnf(a12, assumption,
% 23.22/3.33 X8 = X2).
% 23.22/3.33 cnf(c20, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(predicate_reduction, [assumptions([a12])], [c18, c19])).
% 23.22/3.33
% 23.22/3.33 cnf(c21, axiom,
% 23.22/3.33 on_path(sK22(X9),X9) | ~sP14(X9)).
% 23.22/3.33 cnf(a13, assumption,
% 23.22/3.33 X1 = sK22(X9)).
% 23.22/3.33 cnf(a14, assumption,
% 23.22/3.33 sK24 = X9).
% 23.22/3.33 cnf(c22, plain,
% 23.22/3.33 ~on_path(X0,sK24),
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a13, a14])], [c17, c21])).
% 23.22/3.33 cnf(c23, plain,
% 23.22/3.33 ~sP14(X9),
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a13, a14])], [c17, c21])).
% 23.22/3.33
% 23.22/3.33 cnf(c24, plain,
% 23.22/3.33 sP14(X2)).
% 23.22/3.33 cnf(a15, assumption,
% 23.22/3.33 X9 = X2).
% 23.22/3.33 cnf(c25, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(predicate_reduction, [assumptions([a15])], [c23, c24])).
% 23.22/3.33
% 23.22/3.33 cnf(c26, axiom,
% 23.22/3.33 on_path(sK21(X10),X10) | ~sP14(X10)).
% 23.22/3.33 cnf(a16, assumption,
% 23.22/3.33 X0 = sK21(X10)).
% 23.22/3.33 cnf(a17, assumption,
% 23.22/3.33 sK24 = X10).
% 23.22/3.33 cnf(c27, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a16, a17])], [c22, c26])).
% 23.22/3.33 cnf(c28, plain,
% 23.22/3.33 ~sP14(X10),
% 23.22/3.33 inference(strict_predicate_extension, [assumptions([a16, a17])], [c22, c26])).
% 23.22/3.33
% 23.22/3.33 cnf(c29, plain,
% 23.22/3.33 sP14(X2)).
% 23.22/3.33 cnf(a18, assumption,
% 23.22/3.33 X10 = X2).
% 23.22/3.33 cnf(c30, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(predicate_reduction, [assumptions([a18])], [c28, c29])).
% 23.22/3.33
% 23.22/3.33 cnf(c31, plain,
% 23.22/3.33 $false,
% 23.22/3.33 inference(constraint_solving, [
% 23.22/3.33 bind(X0, sK21(X2)),
% 23.22/3.33 bind(X1, sK22(X2)),
% 23.22/3.33 bind(X2, sK24),
% 23.22/3.33 bind(X3, sK27(X0,X1)),
% 23.22/3.33 bind(X4, sK24),
% 23.22/3.33 bind(X5, sK25),
% 23.22/3.33 bind(X6, sK26),
% 23.22/3.33 bind(X7, number_of_in(sequential_pairs,X4)),
% 23.22/3.33 bind(X8, sK24),
% 23.22/3.33 bind(X9, sK24),
% 23.22/3.33 bind(X10, sK24)
% 23.22/3.33 ],
% 23.22/3.33 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 23.22/3.33
% 23.22/3.33 % SZS output end IncompleteProof
%------------------------------------------------------------------------------