TSTP Solution File: LCL565+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : LCL565+1 : TPTP v6.4.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n133.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:54 EDT 2016
% Result : Timeout 300.07s
% 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 : LCL565+1 : TPTP v6.4.0. Released v3.3.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n133.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:56:54 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.31/5.87 > val it = (): unit
% 6.60/6.15 Trying to find a model that refutes: bnd_necessitation
% 7.71/7.28 Unfolded term: [| bnd_substitution_of_equivalents; bnd_op_equiv; bnd_op_implies_and;
% 7.71/7.28 bnd_op_or; bnd_axiom_b; bnd_axiom_m9; bnd_axiom_s3; bnd_axiom_m6;
% 7.71/7.28 bnd_axiom_m5; bnd_axiom_m4; bnd_axiom_m3; bnd_axiom_m2; bnd_axiom_m1;
% 7.71/7.28 bnd_adjunction; bnd_substitution_strict_equiv;
% 7.71/7.28 bnd_modus_ponens_strict_implies; bnd_op_strict_equiv; bnd_op_equiv;
% 7.71/7.28 bnd_op_strict_implies; bnd_op_implies; bnd_op_or; bnd_op_possibly;
% 7.71/7.28 bnd_op_strict_equiv -->
% 7.71/7.28 (ALL X Y.
% 7.71/7.28 bnd_strict_equiv X Y =
% 7.71/7.28 bnd_and (bnd_strict_implies X Y) (bnd_strict_implies Y X));
% 7.71/7.28 bnd_op_strict_implies -->
% 7.71/7.28 (ALL X Y. bnd_strict_implies X Y = bnd_necessarily (bnd_implies X Y));
% 7.71/7.28 bnd_op_necessarily -->
% 7.71/7.28 (ALL X. bnd_necessarily X = bnd_not (bnd_possibly (bnd_not X)));
% 7.71/7.28 bnd_op_possibly -->
% 7.71/7.28 (ALL X. bnd_possibly X = bnd_not (bnd_necessarily (bnd_not X)));
% 7.71/7.28 bnd_axiom_m10 =
% 7.71/7.28 (ALL X.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies (bnd_possibly X)
% 7.71/7.28 (bnd_necessarily (bnd_possibly X))));
% 7.71/7.28 bnd_axiom_m9 =
% 7.71/7.28 (ALL X.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies (bnd_possibly (bnd_possibly X))
% 7.71/7.28 (bnd_possibly X)));
% 7.71/7.28 bnd_axiom_m8 =
% 7.71/7.28 (ALL P Q.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies (bnd_strict_implies P Q)
% 7.71/7.28 (bnd_strict_implies (bnd_possibly P) (bnd_possibly Q))));
% 7.71/7.28 bnd_axiom_m7 =
% 7.71/7.28 (ALL P Q.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies (bnd_possibly (bnd_and P Q)) P));
% 7.71/7.28 bnd_axiom_m6 =
% 7.71/7.28 (ALL X. bnd_is_a_theorem (bnd_strict_implies X (bnd_possibly X)));
% 7.71/7.28 bnd_axiom_m5 =
% 7.71/7.28 (ALL X Y Z.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies
% 7.71/7.28 (bnd_and (bnd_strict_implies X Y) (bnd_strict_implies Y Z))
% 7.71/7.28 (bnd_strict_implies X Z)));
% 7.71/7.28 bnd_axiom_m4 =
% 7.71/7.28 (ALL X. bnd_is_a_theorem (bnd_strict_implies X (bnd_and X X)));
% 7.71/7.28 bnd_axiom_m3 =
% 7.71/7.28 (ALL X Y Z.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies (bnd_and (bnd_and X Y) Z)
% 7.71/7.28 (bnd_and X (bnd_and Y Z))));
% 7.71/7.28 bnd_axiom_m2 =
% 7.71/7.28 (ALL X Y. bnd_is_a_theorem (bnd_strict_implies (bnd_and X Y) X));
% 7.71/7.28 bnd_axiom_m1 =
% 7.71/7.28 (ALL X Y.
% 7.71/7.28 bnd_is_a_theorem (bnd_strict_implies (bnd_and X Y) (bnd_and Y X)));
% 7.71/7.28 bnd_axiom_s4 =
% 7.71/7.28 (ALL X.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies (bnd_necessarily X)
% 7.71/7.28 (bnd_necessarily (bnd_necessarily X))));
% 7.71/7.28 bnd_axiom_s3 =
% 7.71/7.28 (ALL X Y.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies (bnd_strict_implies X Y)
% 7.71/7.28 (bnd_strict_implies (bnd_not (bnd_possibly Y))
% 7.71/7.28 (bnd_not (bnd_possibly X)))));
% 7.71/7.28 bnd_axiom_s2 =
% 7.71/7.28 (ALL P Q.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_strict_implies (bnd_possibly (bnd_and P Q))
% 7.71/7.28 (bnd_and (bnd_possibly P) (bnd_possibly Q))));
% 7.71/7.28 bnd_axiom_s1 =
% 7.71/7.28 (ALL X Y Z.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_implies
% 7.71/7.28 (bnd_and (bnd_necessarily (bnd_implies X Y))
% 7.71/7.28 (bnd_necessarily (bnd_implies Y Z)))
% 7.71/7.28 (bnd_necessarily (bnd_implies X Z))));
% 7.71/7.28 bnd_axiom_5 =
% 7.71/7.28 (ALL X.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_implies (bnd_possibly X) (bnd_necessarily (bnd_possibly X))));
% 7.71/7.28 bnd_axiom_B =
% 7.71/7.28 (ALL X.
% 7.71/7.28 bnd_is_a_theorem (bnd_implies X (bnd_necessarily (bnd_possibly X))));
% 7.71/7.28 bnd_axiom_4 =
% 7.71/7.28 (ALL X.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_implies (bnd_necessarily X)
% 7.71/7.28 (bnd_necessarily (bnd_necessarily X))));
% 7.71/7.28 bnd_axiom_M =
% 7.71/7.28 (ALL X. bnd_is_a_theorem (bnd_implies (bnd_necessarily X) X));
% 7.71/7.28 bnd_axiom_K =
% 7.71/7.28 (ALL X Y.
% 7.71/7.28 bnd_is_a_theorem
% 7.71/7.28 (bnd_implies (bnd_necessarily (bnd_implies X Y))
% 7.71/7.28 (bnd_implies (bnd_necessarily X) (bnd_necessarily Y))));
% 7.71/7.28 bnd_substitution_strict_equiv =
% 7.71/7.28 (ALL X Y. bnd_is_a_theorem (bnd_strict_equiv X Y) --> X = Y);
% 7.71/7.28 bnd_adjunction =
% 7.71/7.28 (ALL X Y.
% 7.71/7.28 bnd_is_a_theorem X & bnd_is_a_theorem Y -->
% 7.71/7.28 bnd_is_a_theorem (bnd_and X Y));
% 7.71/7.28 bnd_modus_ponens_strict_implies =
% 7.71/7.28 (ALL X Y.
% 7.71/7.28 bnd_is_a_theorem X & bnd_is_a_theorem (bnd_strict_implies X Y) -->
% 7.71/7.28 bnd_is_a_theorem Y);
% 7.71/7.28 bnd_necessitation =
% 7.71/7.28 (ALL X. bnd_is_a_theorem X --> bnd_is_a_theorem (bnd_necessarily X));
% 7.71/7.28 bnd_op_equiv -->
% 7.71/7.28 (ALL X Y. bnd_equiv X Y = bnd_and (bnd_implies X Y) (bnd_implies Y X));
% 7.71/7.28 bnd_op_implies_or --> (ALL X Y. bnd_implies X Y = bnd_or (bnd_not X) Y);
% 7.71/7.28 bnd_op_implies_and -->
% 7.71/7.28 (ALL X Y. bnd_implies X Y = bnd_not (bnd_and X (bnd_not Y)));
% 7.71/7.28 bnd_op_and -->
% 7.71/7.28 (ALL X Y. bnd_and X Y = bnd_not (bnd_or (bnd_not X) (bnd_not Y)));
% 7.71/7.28 bnd_op_or -->
% 7.71/7.28 (ALL X Y. bnd_or X Y = bnd_not (bnd_and (bnd_not X) (bnd_not Y))) |]
% 7.71/7.28 ==> bnd_necessitation
% 7.71/7.28 Adding axioms...
% 7.91/7.40 Typedef.type_definition_def
% 12.51/12.09 ...done.
% 12.51/12.09 Ground types: ?'b, TPTP_Interpret.ind
% 12.51/12.09 Translating term (sizes: 1, 1) ...
% 15.62/15.19 Invoking SAT solver...
% 15.62/15.19 No model exists.
% 15.62/15.19 Translating term (sizes: 2, 1) ...
% 19.42/19.00 Invoking SAT solver...
% 19.52/19.00 No model exists.
% 19.52/19.00 Translating term (sizes: 1, 2) ...
% 27.54/27.03 Invoking SAT solver...
% 27.64/27.16 No model exists.
% 27.64/27.16 Translating term (sizes: 3, 1) ...
% 33.86/33.34 Invoking SAT solver...
% 33.86/33.34 No model exists.
% 33.86/33.34 Translating term (sizes: 2, 2) ...
% 49.59/49.08 Invoking SAT solver...
% 49.79/49.21 No model exists.
% 49.79/49.21 Translating term (sizes: 1, 3) ...
% 67.32/66.78 Invoking SAT solver...
% 300.07/285.42 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 62742 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.07/285.42 62743 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.07/285.43 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 62688 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.07/285.43 62689 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.$"
%------------------------------------------------------------------------------