%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : LCL907+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n076.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:07:39 EDT 2016
% Result : Timeout 298.29s
% 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 : LCL907+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.23 % Computer : n076.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Sun Apr 10 23:25:24 CDT 2016
% 0.02/0.23 % CPUTime :
% 6.26/5.87 > val it = (): unit
% 6.56/6.13 Trying to find a model that refutes: True
% 7.56/7.12 Unfolded term: [| bnd_substitution_of_equivalents; bnd_equivalence_3; bnd_equivalence_2;
% 7.56/7.12 bnd_equivalence_1; bnd_or_3; bnd_or_2; bnd_or_1; bnd_and_3; bnd_and_2;
% 7.56/7.12 bnd_and_1; bnd_implies_3; bnd_implies_2; bnd_implies_1;
% 7.56/7.12 bnd_modus_tollens; bnd_modus_ponens; bnd_op_equiv; bnd_op_implies_and;
% 7.56/7.12 bnd_op_or;
% 7.56/7.12 bnd_op_equiv -->
% 7.56/7.12 (ALL X Y. bnd_equiv X Y = bnd_and (bnd_implies X Y) (bnd_implies Y X));
% 7.56/7.12 bnd_op_implies_or --> (ALL X Y. bnd_implies X Y = bnd_or (bnd_not X) Y);
% 7.56/7.12 bnd_op_implies_and -->
% 7.56/7.12 (ALL X Y. bnd_implies X Y = bnd_not (bnd_and X (bnd_not Y)));
% 7.56/7.12 bnd_op_and -->
% 7.56/7.12 (ALL X Y. bnd_and X Y = bnd_not (bnd_or (bnd_not X) (bnd_not Y)));
% 7.56/7.12 bnd_op_or -->
% 7.56/7.12 (ALL X Y. bnd_or X Y = bnd_not (bnd_and (bnd_not X) (bnd_not Y)));
% 7.56/7.12 bnd_r5 =
% 7.56/7.12 (ALL P Q R.
% 7.56/7.12 bnd_is_a_theorem
% 7.56/7.12 (bnd_implies (bnd_implies Q R)
% 7.56/7.12 (bnd_implies (bnd_or P Q) (bnd_or P R))));
% 7.56/7.12 bnd_r4 =
% 7.56/7.12 (ALL P Q R.
% 7.56/7.12 bnd_is_a_theorem
% 7.56/7.12 (bnd_implies (bnd_or P (bnd_or Q R)) (bnd_or Q (bnd_or P R))));
% 7.56/7.12 bnd_r3 =
% 7.56/7.13 (ALL P Q. bnd_is_a_theorem (bnd_implies (bnd_or P Q) (bnd_or Q P)));
% 7.56/7.13 bnd_r2 = (ALL P Q. bnd_is_a_theorem (bnd_implies Q (bnd_or P Q)));
% 7.56/7.13 bnd_r1 = (ALL P. bnd_is_a_theorem (bnd_implies (bnd_or P P) P));
% 7.56/7.13 bnd_cn3 =
% 7.56/7.13 (ALL P. bnd_is_a_theorem (bnd_implies (bnd_implies (bnd_not P) P) P));
% 7.56/7.13 bnd_cn2 =
% 7.56/7.13 (ALL P Q. bnd_is_a_theorem (bnd_implies P (bnd_implies (bnd_not P) Q)));
% 7.56/7.13 bnd_cn1 =
% 7.56/7.13 (ALL P Q R.
% 7.56/7.13 bnd_is_a_theorem
% 7.56/7.13 (bnd_implies (bnd_implies P Q)
% 7.56/7.13 (bnd_implies (bnd_implies Q R) (bnd_implies P R))));
% 7.56/7.13 bnd_kn3 =
% 7.56/7.13 (ALL P Q R.
% 7.56/7.13 bnd_is_a_theorem
% 7.56/7.13 (bnd_implies (bnd_implies P Q)
% 7.56/7.13 (bnd_implies (bnd_not (bnd_and Q R)) (bnd_not (bnd_and R P)))));
% 7.56/7.13 bnd_kn2 = (ALL P Q. bnd_is_a_theorem (bnd_implies (bnd_and P Q) P));
% 7.56/7.13 bnd_kn1 = (ALL P. bnd_is_a_theorem (bnd_implies P (bnd_and P P)));
% 7.56/7.13 bnd_equivalence_3 =
% 7.56/7.13 (ALL X Y.
% 7.56/7.13 bnd_is_a_theorem
% 7.56/7.13 (bnd_implies (bnd_implies X Y)
% 7.56/7.13 (bnd_implies (bnd_implies Y X) (bnd_equiv X Y))));
% 7.56/7.13 bnd_equivalence_2 =
% 7.56/7.13 (ALL X Y.
% 7.56/7.13 bnd_is_a_theorem (bnd_implies (bnd_equiv X Y) (bnd_implies Y X)));
% 7.56/7.13 bnd_equivalence_1 =
% 7.56/7.13 (ALL X Y.
% 7.56/7.13 bnd_is_a_theorem (bnd_implies (bnd_equiv X Y) (bnd_implies X Y)));
% 7.56/7.13 bnd_or_3 =
% 7.56/7.13 (ALL X Y Z.
% 7.56/7.13 bnd_is_a_theorem
% 7.56/7.13 (bnd_implies (bnd_implies X Z)
% 7.56/7.13 (bnd_implies (bnd_implies Y Z) (bnd_implies (bnd_or X Y) Z))));
% 7.56/7.13 bnd_or_2 = (ALL X Y. bnd_is_a_theorem (bnd_implies Y (bnd_or X Y)));
% 7.56/7.13 bnd_or_1 = (ALL X Y. bnd_is_a_theorem (bnd_implies X (bnd_or X Y)));
% 7.56/7.13 bnd_and_3 =
% 7.56/7.13 (ALL X Y.
% 7.56/7.13 bnd_is_a_theorem (bnd_implies X (bnd_implies Y (bnd_and X Y))));
% 7.56/7.13 bnd_and_2 = (ALL X Y. bnd_is_a_theorem (bnd_implies (bnd_and X Y) Y));
% 7.56/7.13 bnd_and_1 = (ALL X Y. bnd_is_a_theorem (bnd_implies (bnd_and X Y) X));
% 7.56/7.13 bnd_implies_3 =
% 7.56/7.13 (ALL X Y Z.
% 7.56/7.13 bnd_is_a_theorem
% 7.56/7.13 (bnd_implies (bnd_implies X Y)
% 7.56/7.13 (bnd_implies (bnd_implies Y Z) (bnd_implies X Z))));
% 7.56/7.13 bnd_implies_2 =
% 7.56/7.13 (ALL X Y.
% 7.56/7.13 bnd_is_a_theorem
% 7.56/7.13 (bnd_implies (bnd_implies X (bnd_implies X Y)) (bnd_implies X Y)));
% 7.56/7.13 bnd_implies_1 =
% 7.56/7.13 (ALL X Y. bnd_is_a_theorem (bnd_implies X (bnd_implies Y X)));
% 7.56/7.13 bnd_modus_tollens =
% 7.56/7.13 (ALL X Y.
% 7.56/7.13 bnd_is_a_theorem
% 7.56/7.13 (bnd_implies (bnd_implies (bnd_not Y) (bnd_not X))
% 7.56/7.13 (bnd_implies X Y)));
% 7.56/7.13 bnd_substitution_of_equivalents =
% 7.56/7.13 (ALL X Y. bnd_is_a_theorem (bnd_equiv X Y) --> X = Y);
% 7.56/7.13 bnd_modus_ponens =
% 7.56/7.13 (ALL X Y.
% 7.56/7.13 bnd_is_a_theorem X & bnd_is_a_theorem (bnd_implies X Y) -->
% 7.56/7.13 bnd_is_a_theorem Y) |]
% 7.56/7.13 ==> True
% 7.56/7.13 Adding axioms...
% 7.66/7.25 Typedef.type_definition_def
% 12.36/11.91 ...done.
% 12.36/11.92 Ground types: ?'b, TPTP_Interpret.ind
% 12.36/11.92 Translating term (sizes: 1, 1) ...
% 15.37/14.92 Invoking SAT solver...
% 15.37/14.92 No model exists.
% 15.37/14.92 Translating term (sizes: 2, 1) ...
% 19.09/18.67 Invoking SAT solver...
% 19.09/18.67 No model exists.
% 19.09/18.67 Translating term (sizes: 1, 2) ...
% 28.70/28.22 Invoking SAT solver...
% 28.70/28.22 No model exists.
% 28.70/28.22 Translating term (sizes: 3, 1) ...
% 34.80/34.34 Invoking SAT solver...
% 34.80/34.34 No model exists.
% 34.80/34.34 Translating term (sizes: 2, 2) ...
% 52.04/51.59 Invoking SAT solver...
% 52.04/51.59 No model exists.
% 52.04/51.59 Translating term (sizes: 1, 3) ...
% 75.43/74.89 Invoking SAT solver...
% 75.43/74.89 No model exists.
% 75.43/74.89 Translating term (sizes: 4, 1) ...
% 88.77/88.14 Invoking SAT solver...
% 88.77/88.14 No model exists.
% 88.77/88.14 Translating term (sizes: 3, 2) ...
% 185.93/184.85 Invoking SAT solver...
% 185.93/184.85 No model exists.
% 185.93/184.85 Translating term (sizes: 2, 3) ...
% 250.53/248.94 Invoking SAT solver...
% 250.53/248.94 No model exists.
% 250.53/248.94 Translating term (sizes: 1, 4) ...
% 298.29/296.27 Invoking SAT solver...
% 298.29/296.27 No model exists.
% 298.29/296.27 Translating term (sizes: 5, 1) ...
% 300.01/297.92 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 45265 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.01/297.92 45266 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.01/297.93 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 45211 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.01/297.93 45212 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.$"
%------------------------------------------------------------------------------