TSTP Solution File: CSR073+6 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR073+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n012.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 : Fri Jul 15 20:36:49 EDT 2022
% Result : Theorem 62.15s 55.21s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR073+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 11 17:38:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 62.15/55.21 % SZS status Theorem
% 62.15/55.21 % SZS output begin IncompleteProof
% 62.15/55.21 cnf(c0, axiom,
% 62.15/55.21 ~tptptypes_5_387(X0,c_pushingababycarriage)).
% 62.15/55.21 cnf(c1, plain,
% 62.15/55.21 ~tptptypes_5_387(X0,c_pushingababycarriage),
% 62.15/55.21 inference(start, [], [c0])).
% 62.15/55.21
% 62.15/55.21 cnf(c2, axiom,
% 62.15/55.21 tptptypes_5_387(X1,X2) | ~tptptypes_6_388(X1,X2)).
% 62.15/55.21 cnf(a0, assumption,
% 62.15/55.21 X0 = X1).
% 62.15/55.21 cnf(a1, assumption,
% 62.15/55.21 c_pushingababycarriage = X2).
% 62.15/55.21 cnf(c3, plain,
% 62.15/55.21 $false,
% 62.15/55.21 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 62.15/55.21 cnf(c4, plain,
% 62.15/55.21 ~tptptypes_6_388(X1,X2),
% 62.15/55.21 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 62.15/55.21
% 62.15/55.21 cnf(c5, axiom,
% 62.15/55.21 tptptypes_6_388(X3,X4) | ~tptptypes_7_396(X3,X4)).
% 62.15/55.21 cnf(a2, assumption,
% 62.15/55.21 X1 = X3).
% 62.15/55.21 cnf(a3, assumption,
% 62.15/55.21 X2 = X4).
% 62.15/55.21 cnf(c6, plain,
% 62.15/55.21 $false,
% 62.15/55.21 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 62.15/55.21 cnf(c7, plain,
% 62.15/55.21 ~tptptypes_7_396(X3,X4),
% 62.15/55.21 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 62.15/55.21
% 62.15/55.21 cnf(c8, axiom,
% 62.15/55.21 tptptypes_7_396(c_tptpcol_16_7586,c_pushingababycarriage)).
% 62.15/55.21 cnf(a4, assumption,
% 62.15/55.21 X3 = c_tptpcol_16_7586).
% 62.15/55.21 cnf(a5, assumption,
% 62.15/55.21 X4 = c_pushingababycarriage).
% 62.15/55.21 cnf(c9, plain,
% 62.15/55.21 $false,
% 62.15/55.21 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 62.15/55.21 cnf(c10, plain,
% 62.15/55.21 $false,
% 62.15/55.21 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 62.15/55.21
% 62.15/55.21 cnf(c11, plain,
% 62.15/55.21 $false,
% 62.15/55.21 inference(constraint_solving, [
% 62.15/55.21 bind(X0, c_tptpcol_16_7586),
% 62.15/55.21 bind(X1, c_tptpcol_16_7586),
% 62.15/55.21 bind(X2, c_pushingababycarriage),
% 62.15/55.21 bind(X3, c_tptpcol_16_7586),
% 62.15/55.21 bind(X4, c_pushingababycarriage)
% 62.15/55.21 ],
% 62.15/55.21 [a0, a1, a2, a3, a4, a5])).
% 62.15/55.21
% 62.15/55.21 % SZS output end IncompleteProof
%------------------------------------------------------------------------------