TSTP Solution File: LCL543+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : LCL543+1 : TPTP v6.4.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n121.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.75MB
% OS : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Tue Apr 12 17:05:52 EDT 2016
% Result : Timeout 299.05s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL543+1 : TPTP v6.4.0. Released v3.3.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n121.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.75MB
% 0.03/0.23 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Sun Apr 10 17:50:09 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.30/5.84 > val it = (): unit
% 6.61/6.19 Trying to find a model that refutes: bnd_axiom_m3
% 8.41/7.97 Unfolded term: [| bnd_op_strict_equiv; bnd_op_equiv; bnd_op_strict_implies; bnd_op_implies;
% 8.41/7.97 bnd_op_or; bnd_op_possibly; bnd_axiom_B; bnd_axiom_4; bnd_axiom_M;
% 8.41/7.97 bnd_axiom_K; bnd_necessitation; bnd_op_possibly;
% 8.41/7.97 bnd_op_strict_equiv -->
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_strict_equiv X Y =
% 8.41/7.97 bnd_and (bnd_strict_implies X Y) (bnd_strict_implies Y X));
% 8.41/7.97 bnd_op_strict_implies -->
% 8.41/7.97 (ALL X Y. bnd_strict_implies X Y = bnd_necessarily (bnd_implies X Y));
% 8.41/7.97 bnd_op_necessarily -->
% 8.41/7.97 (ALL X. bnd_necessarily X = bnd_not (bnd_possibly (bnd_not X)));
% 8.41/7.97 bnd_op_possibly -->
% 8.41/7.97 (ALL X. bnd_possibly X = bnd_not (bnd_necessarily (bnd_not X)));
% 8.41/7.97 bnd_axiom_m10 =
% 8.41/7.97 (ALL X.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies (bnd_possibly X)
% 8.41/7.97 (bnd_necessarily (bnd_possibly X))));
% 8.41/7.97 bnd_axiom_m9 =
% 8.41/7.97 (ALL X.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies (bnd_possibly (bnd_possibly X))
% 8.41/7.97 (bnd_possibly X)));
% 8.41/7.97 bnd_axiom_m8 =
% 8.41/7.97 (ALL P Q.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies (bnd_strict_implies P Q)
% 8.41/7.97 (bnd_strict_implies (bnd_possibly P) (bnd_possibly Q))));
% 8.41/7.97 bnd_axiom_m7 =
% 8.41/7.97 (ALL P Q.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies (bnd_possibly (bnd_and P Q)) P));
% 8.41/7.97 bnd_axiom_m6 =
% 8.41/7.97 (ALL X. bnd_is_a_theorem (bnd_strict_implies X (bnd_possibly X)));
% 8.41/7.97 bnd_axiom_m5 =
% 8.41/7.97 (ALL X Y Z.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies
% 8.41/7.97 (bnd_and (bnd_strict_implies X Y) (bnd_strict_implies Y Z))
% 8.41/7.97 (bnd_strict_implies X Z)));
% 8.41/7.97 bnd_axiom_m4 =
% 8.41/7.97 (ALL X. bnd_is_a_theorem (bnd_strict_implies X (bnd_and X X)));
% 8.41/7.97 bnd_axiom_m3 =
% 8.41/7.97 (ALL X Y Z.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies (bnd_and (bnd_and X Y) Z)
% 8.41/7.97 (bnd_and X (bnd_and Y Z))));
% 8.41/7.97 bnd_axiom_m2 =
% 8.41/7.97 (ALL X Y. bnd_is_a_theorem (bnd_strict_implies (bnd_and X Y) X));
% 8.41/7.97 bnd_axiom_m1 =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem (bnd_strict_implies (bnd_and X Y) (bnd_and Y X)));
% 8.41/7.97 bnd_axiom_s4 =
% 8.41/7.97 (ALL X.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies (bnd_necessarily X)
% 8.41/7.97 (bnd_necessarily (bnd_necessarily X))));
% 8.41/7.97 bnd_axiom_s3 =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies (bnd_strict_implies X Y)
% 8.41/7.97 (bnd_strict_implies (bnd_not (bnd_possibly Y))
% 8.41/7.97 (bnd_not (bnd_possibly X)))));
% 8.41/7.97 bnd_axiom_s2 =
% 8.41/7.97 (ALL P Q.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_strict_implies (bnd_possibly (bnd_and P Q))
% 8.41/7.97 (bnd_and (bnd_possibly P) (bnd_possibly Q))));
% 8.41/7.97 bnd_axiom_s1 =
% 8.41/7.97 (ALL X Y Z.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies
% 8.41/7.97 (bnd_and (bnd_necessarily (bnd_implies X Y))
% 8.41/7.97 (bnd_necessarily (bnd_implies Y Z)))
% 8.41/7.97 (bnd_necessarily (bnd_implies X Z))));
% 8.41/7.97 bnd_axiom_5 =
% 8.41/7.97 (ALL X.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_possibly X) (bnd_necessarily (bnd_possibly X))));
% 8.41/7.97 bnd_axiom_B =
% 8.41/7.97 (ALL X.
% 8.41/7.97 bnd_is_a_theorem (bnd_implies X (bnd_necessarily (bnd_possibly X))));
% 8.41/7.97 bnd_axiom_4 =
% 8.41/7.97 (ALL X.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_necessarily X)
% 8.41/7.97 (bnd_necessarily (bnd_necessarily X))));
% 8.41/7.97 bnd_axiom_M =
% 8.41/7.97 (ALL X. bnd_is_a_theorem (bnd_implies (bnd_necessarily X) X));
% 8.41/7.97 bnd_axiom_K =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_necessarily (bnd_implies X Y))
% 8.41/7.97 (bnd_implies (bnd_necessarily X) (bnd_necessarily Y))));
% 8.41/7.97 bnd_substitution_strict_equiv =
% 8.41/7.97 (ALL X Y. bnd_is_a_theorem (bnd_strict_equiv X Y) --> X = Y);
% 8.41/7.97 bnd_adjunction =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem X & bnd_is_a_theorem Y -->
% 8.41/7.97 bnd_is_a_theorem (bnd_and X Y));
% 8.41/7.97 bnd_modus_ponens_strict_implies =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem X & bnd_is_a_theorem (bnd_strict_implies X Y) -->
% 8.41/7.97 bnd_is_a_theorem Y);
% 8.41/7.97 bnd_necessitation =
% 8.41/7.97 (ALL X. bnd_is_a_theorem X --> bnd_is_a_theorem (bnd_necessarily X));
% 8.41/7.97 bnd_substitution_of_equivalents; bnd_equivalence_3; bnd_equivalence_2;
% 8.41/7.97 bnd_equivalence_1; bnd_or_3; bnd_or_2; bnd_or_1; bnd_and_3; bnd_and_2;
% 8.41/7.97 bnd_and_1; bnd_implies_3; bnd_implies_2; bnd_implies_1;
% 8.41/7.97 bnd_modus_tollens; bnd_modus_ponens; bnd_op_equiv; bnd_op_implies_and;
% 8.41/7.97 bnd_op_or;
% 8.41/7.97 bnd_op_equiv -->
% 8.41/7.97 (ALL X Y. bnd_equiv X Y = bnd_and (bnd_implies X Y) (bnd_implies Y X));
% 8.41/7.97 bnd_op_implies_or --> (ALL X Y. bnd_implies X Y = bnd_or (bnd_not X) Y);
% 8.41/7.97 bnd_op_implies_and -->
% 8.41/7.97 (ALL X Y. bnd_implies X Y = bnd_not (bnd_and X (bnd_not Y)));
% 8.41/7.97 bnd_op_and -->
% 8.41/7.97 (ALL X Y. bnd_and X Y = bnd_not (bnd_or (bnd_not X) (bnd_not Y)));
% 8.41/7.97 bnd_op_or -->
% 8.41/7.97 (ALL X Y. bnd_or X Y = bnd_not (bnd_and (bnd_not X) (bnd_not Y)));
% 8.41/7.97 bnd_r5 =
% 8.41/7.97 (ALL P Q R.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_implies Q R)
% 8.41/7.97 (bnd_implies (bnd_or P Q) (bnd_or P R))));
% 8.41/7.97 bnd_r4 =
% 8.41/7.97 (ALL P Q R.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_or P (bnd_or Q R)) (bnd_or Q (bnd_or P R))));
% 8.41/7.97 bnd_r3 =
% 8.41/7.97 (ALL P Q. bnd_is_a_theorem (bnd_implies (bnd_or P Q) (bnd_or Q P)));
% 8.41/7.97 bnd_r2 = (ALL P Q. bnd_is_a_theorem (bnd_implies Q (bnd_or P Q)));
% 8.41/7.97 bnd_r1 = (ALL P. bnd_is_a_theorem (bnd_implies (bnd_or P P) P));
% 8.41/7.97 bnd_cn3 =
% 8.41/7.97 (ALL P. bnd_is_a_theorem (bnd_implies (bnd_implies (bnd_not P) P) P));
% 8.41/7.97 bnd_cn2 =
% 8.41/7.97 (ALL P Q. bnd_is_a_theorem (bnd_implies P (bnd_implies (bnd_not P) Q)));
% 8.41/7.97 bnd_cn1 =
% 8.41/7.97 (ALL P Q R.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_implies P Q)
% 8.41/7.97 (bnd_implies (bnd_implies Q R) (bnd_implies P R))));
% 8.41/7.97 bnd_kn3 =
% 8.41/7.97 (ALL P Q R.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_implies P Q)
% 8.41/7.97 (bnd_implies (bnd_not (bnd_and Q R)) (bnd_not (bnd_and R P)))));
% 8.41/7.97 bnd_kn2 = (ALL P Q. bnd_is_a_theorem (bnd_implies (bnd_and P Q) P));
% 8.41/7.97 bnd_kn1 = (ALL P. bnd_is_a_theorem (bnd_implies P (bnd_and P P)));
% 8.41/7.97 bnd_equivalence_3 =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_implies X Y)
% 8.41/7.97 (bnd_implies (bnd_implies Y X) (bnd_equiv X Y))));
% 8.41/7.97 bnd_equivalence_2 =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem (bnd_implies (bnd_equiv X Y) (bnd_implies Y X)));
% 8.41/7.97 bnd_equivalence_1 =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem (bnd_implies (bnd_equiv X Y) (bnd_implies X Y)));
% 8.41/7.97 bnd_or_3 =
% 8.41/7.97 (ALL X Y Z.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_implies X Z)
% 8.41/7.97 (bnd_implies (bnd_implies Y Z) (bnd_implies (bnd_or X Y) Z))));
% 8.41/7.97 bnd_or_2 = (ALL X Y. bnd_is_a_theorem (bnd_implies Y (bnd_or X Y)));
% 8.41/7.97 bnd_or_1 = (ALL X Y. bnd_is_a_theorem (bnd_implies X (bnd_or X Y)));
% 8.41/7.97 bnd_and_3 =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem (bnd_implies X (bnd_implies Y (bnd_and X Y))));
% 8.41/7.97 bnd_and_2 = (ALL X Y. bnd_is_a_theorem (bnd_implies (bnd_and X Y) Y));
% 8.41/7.97 bnd_and_1 = (ALL X Y. bnd_is_a_theorem (bnd_implies (bnd_and X Y) X));
% 8.41/7.97 bnd_implies_3 =
% 8.41/7.97 (ALL X Y Z.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_implies X Y)
% 8.41/7.97 (bnd_implies (bnd_implies Y Z) (bnd_implies X Z))));
% 8.41/7.97 bnd_implies_2 =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_implies X (bnd_implies X Y)) (bnd_implies X Y)));
% 8.41/7.97 bnd_implies_1 =
% 8.41/7.97 (ALL X Y. bnd_is_a_theorem (bnd_implies X (bnd_implies Y X)));
% 8.41/7.97 bnd_modus_tollens =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem
% 8.41/7.97 (bnd_implies (bnd_implies (bnd_not Y) (bnd_not X))
% 8.41/7.97 (bnd_implies X Y)));
% 8.41/7.97 bnd_substitution_of_equivalents =
% 8.41/7.97 (ALL X Y. bnd_is_a_theorem (bnd_equiv X Y) --> X = Y);
% 8.41/7.97 bnd_modus_ponens =
% 8.41/7.97 (ALL X Y.
% 8.41/7.97 bnd_is_a_theorem X & bnd_is_a_theorem (bnd_implies X Y) -->
% 8.41/7.97 bnd_is_a_theorem Y) |]
% 8.41/7.97 ==> bnd_axiom_m3
% 8.41/7.97 Adding axioms...
% 8.51/8.04 Typedef.type_definition_def
% 16.82/16.35 ...done.
% 16.82/16.36 Ground types: ?'b, TPTP_Interpret.ind
% 16.82/16.36 Translating term (sizes: 1, 1) ...
% 22.14/21.65 Invoking SAT solver...
% 22.14/21.65 No model exists.
% 22.14/21.65 Translating term (sizes: 2, 1) ...
% 28.05/27.56 Invoking SAT solver...
% 28.05/27.56 No model exists.
% 28.05/27.56 Translating term (sizes: 1, 2) ...
% 43.77/43.23 Invoking SAT solver...
% 43.87/43.38 No model exists.
% 43.87/43.38 Translating term (sizes: 3, 1) ...
% 52.33/51.71 Invoking SAT solver...
% 52.33/51.71 No model exists.
% 52.33/51.71 Translating term (sizes: 2, 2) ...
% 75.89/75.20 Invoking SAT solver...
% 76.00/75.35 No model exists.
% 76.00/75.35 Translating term (sizes: 1, 3) ...
% 113.72/112.90 Invoking SAT solver...
% 175.78/169.56 No model exists.
% 175.78/169.56 Translating term (sizes: 4, 1) ...
% 191.56/185.23 Invoking SAT solver...
% 191.56/185.23 No model exists.
% 191.56/185.23 Translating term (sizes: 3, 2) ...
% 299.05/290.88 Invoking SAT solver...
% 299.28/291.03 No model exists.
% 299.28/291.03 Translating term (sizes: 2, 3) ...
% 300.11/291.82 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 61704 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.11/291.82 61705 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.11/291.83 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 61650 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.11/291.83 61651 CPU time limit exceeded (core dumped) | grep --line-buffered -v "^###\|^PROOF FAILED for depth\|^Failure node\|inferences so far. Searching to depth\|^val \|^Loading theory\|^Warning-The type of\|^ monotype.$"
%------------------------------------------------------------------------------