TSTP Solution File: PRO010+4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : PRO010+4 : TPTP v8.1.0. Released v4.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 : n011.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 : Mon Jul 18 17:48:48 EDT 2022
% Result : Theorem 84.61s 11.89s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO010+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 01:24:18 EDT 2022
% 0.14/0.35 % CPUTime :
% 84.61/11.89 % SZS status Theorem
% 84.61/11.89 % SZS output begin IncompleteProof
% 84.61/11.89 cnf(c0, axiom,
% 84.61/11.89 occurrence_of(sK24,tptp0)).
% 84.61/11.89 cnf(c1, plain,
% 84.61/11.89 occurrence_of(sK24,tptp0),
% 84.61/11.89 inference(start, [], [c0])).
% 84.61/11.89
% 84.61/11.89 cnf(c2, axiom,
% 84.61/11.89 sP3(X0) | ~occurrence_of(X0,tptp0)).
% 84.61/11.89 cnf(a0, assumption,
% 84.61/11.89 sK24 = X0).
% 84.61/11.89 cnf(a1, assumption,
% 84.61/11.89 tptp0 = tptp0).
% 84.61/11.89 cnf(c3, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 84.61/11.89 cnf(c4, plain,
% 84.61/11.89 sP3(X0),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 84.61/11.89
% 84.61/11.89 cnf(c5, axiom,
% 84.61/11.89 leaf_occ(sK21(X1),X1) | ~sP3(X1)).
% 84.61/11.89 cnf(a2, assumption,
% 84.61/11.89 X0 = X1).
% 84.61/11.89 cnf(c6, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 84.61/11.89 cnf(c7, plain,
% 84.61/11.89 leaf_occ(sK21(X1),X1),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 84.61/11.89
% 84.61/11.89 cnf(c8, axiom,
% 84.61/11.89 sP5(X2) | sP6(X2,X3) | ~leaf_occ(X3,sK24)).
% 84.61/11.89 cnf(a3, assumption,
% 84.61/11.89 sK21(X1) = X3).
% 84.61/11.89 cnf(a4, assumption,
% 84.61/11.89 X1 = sK24).
% 84.61/11.89 cnf(c9, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 84.61/11.89 cnf(c10, plain,
% 84.61/11.89 sP5(X2) | sP6(X2,X3),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 84.61/11.89
% 84.61/11.89 cnf(c11, axiom,
% 84.61/11.89 min_precedes(X4,sK22(X4),tptp0) | ~sP5(X4)).
% 84.61/11.89 cnf(a5, assumption,
% 84.61/11.89 X2 = X4).
% 84.61/11.89 cnf(c12, plain,
% 84.61/11.89 sP6(X2,X3),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])).
% 84.61/11.89 cnf(c13, plain,
% 84.61/11.89 min_precedes(X4,sK22(X4),tptp0),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])).
% 84.61/11.89
% 84.61/11.89 cnf(c14, axiom,
% 84.61/11.89 ~min_precedes(X5,X6,X7) | ~leaf_occ(X5,X8) | ~occurrence_of(X8,X7)).
% 84.61/11.89 cnf(a6, assumption,
% 84.61/11.89 X4 = X5).
% 84.61/11.89 cnf(a7, assumption,
% 84.61/11.89 sK22(X4) = X6).
% 84.61/11.89 cnf(a8, assumption,
% 84.61/11.89 tptp0 = X7).
% 84.61/11.89 cnf(c15, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c13, c14])).
% 84.61/11.89 cnf(c16, plain,
% 84.61/11.89 ~leaf_occ(X5,X8) | ~occurrence_of(X8,X7),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c13, c14])).
% 84.61/11.89
% 84.61/11.89 cnf(c17, plain,
% 84.61/11.89 leaf_occ(sK21(X1),X1)).
% 84.61/11.89 cnf(a9, assumption,
% 84.61/11.89 X5 = sK21(X1)).
% 84.61/11.89 cnf(a10, assumption,
% 84.61/11.89 X8 = X1).
% 84.61/11.89 cnf(c18, plain,
% 84.61/11.89 ~occurrence_of(X8,X7),
% 84.61/11.89 inference(predicate_reduction, [assumptions([a9, a10])], [c16, c17])).
% 84.61/11.89
% 84.61/11.89 cnf(c19, plain,
% 84.61/11.89 occurrence_of(sK24,tptp0)).
% 84.61/11.89 cnf(a11, assumption,
% 84.61/11.89 X8 = sK24).
% 84.61/11.89 cnf(a12, assumption,
% 84.61/11.89 X7 = tptp0).
% 84.61/11.89 cnf(c20, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(predicate_reduction, [assumptions([a11, a12])], [c18, c19])).
% 84.61/11.89
% 84.61/11.89 cnf(c21, axiom,
% 84.61/11.89 sP4(X9) | ~sP6(X9,X10)).
% 84.61/11.89 cnf(a13, assumption,
% 84.61/11.89 X2 = X9).
% 84.61/11.89 cnf(a14, assumption,
% 84.61/11.89 X3 = X10).
% 84.61/11.89 cnf(c22, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a13, a14])], [c12, c21])).
% 84.61/11.89 cnf(c23, plain,
% 84.61/11.89 sP4(X9),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a13, a14])], [c12, c21])).
% 84.61/11.89
% 84.61/11.89 cnf(c24, axiom,
% 84.61/11.89 min_precedes(X11,sK23(X11),tptp0) | ~sP4(X11)).
% 84.61/11.89 cnf(a15, assumption,
% 84.61/11.89 X9 = X11).
% 84.61/11.89 cnf(c25, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a15])], [c23, c24])).
% 84.61/11.89 cnf(c26, plain,
% 84.61/11.89 min_precedes(X11,sK23(X11),tptp0),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a15])], [c23, c24])).
% 84.61/11.89
% 84.61/11.89 cnf(c27, axiom,
% 84.61/11.89 ~min_precedes(X12,X13,X14) | ~leaf_occ(X12,X15) | ~occurrence_of(X15,X14)).
% 84.61/11.89 cnf(a16, assumption,
% 84.61/11.89 X11 = X12).
% 84.61/11.89 cnf(a17, assumption,
% 84.61/11.89 sK23(X11) = X13).
% 84.61/11.89 cnf(a18, assumption,
% 84.61/11.89 tptp0 = X14).
% 84.61/11.89 cnf(c28, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a16, a17, a18])], [c26, c27])).
% 84.61/11.89 cnf(c29, plain,
% 84.61/11.89 ~leaf_occ(X12,X15) | ~occurrence_of(X15,X14),
% 84.61/11.89 inference(strict_predicate_extension, [assumptions([a16, a17, a18])], [c26, c27])).
% 84.61/11.89
% 84.61/11.89 cnf(c30, plain,
% 84.61/11.89 leaf_occ(sK21(X1),X1)).
% 84.61/11.89 cnf(a19, assumption,
% 84.61/11.89 X12 = sK21(X1)).
% 84.61/11.89 cnf(a20, assumption,
% 84.61/11.89 X15 = X1).
% 84.61/11.89 cnf(c31, plain,
% 84.61/11.89 ~occurrence_of(X15,X14),
% 84.61/11.89 inference(predicate_reduction, [assumptions([a19, a20])], [c29, c30])).
% 84.61/11.89
% 84.61/11.89 cnf(c32, plain,
% 84.61/11.89 occurrence_of(sK24,tptp0)).
% 84.61/11.89 cnf(a21, assumption,
% 84.61/11.89 X15 = sK24).
% 84.61/11.89 cnf(a22, assumption,
% 84.61/11.89 X14 = tptp0).
% 84.61/11.89 cnf(c33, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(predicate_reduction, [assumptions([a21, a22])], [c31, c32])).
% 84.61/11.89
% 84.61/11.89 cnf(c34, plain,
% 84.61/11.89 $false,
% 84.61/11.89 inference(constraint_solving, [
% 84.61/11.89 bind(X0, sK24),
% 84.61/11.89 bind(X1, sK24),
% 84.61/11.89 bind(X2, sK21(X1)),
% 84.61/11.89 bind(X3, sK21(X1)),
% 84.61/11.89 bind(X4, sK21(X1)),
% 84.61/11.89 bind(X5, sK21(X1)),
% 84.61/11.89 bind(X6, sK22(X4)),
% 84.61/11.89 bind(X7, tptp0),
% 84.61/11.89 bind(X8, sK24),
% 84.61/11.89 bind(X9, sK21(X1)),
% 84.61/11.89 bind(X10, sK21(X1)),
% 84.61/11.89 bind(X11, sK21(X1)),
% 84.61/11.89 bind(X12, sK21(X1)),
% 84.61/11.89 bind(X13, sK23(X11)),
% 84.61/11.89 bind(X14, tptp0),
% 84.61/11.89 bind(X15, sK24)
% 84.61/11.89 ],
% 84.61/11.89 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22])).
% 84.61/11.89
% 84.61/11.89 % SZS output end IncompleteProof
%------------------------------------------------------------------------------