TSTP Solution File: LCL913+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : LCL913+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n051.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:40 EDT 2016
% Result : Timeout 300.06s
% 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 : LCL913+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n051.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 23:27:54 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.32/5.83 > val it = (): unit
% 6.62/6.10 Trying to find a model that refutes: True
% 7.62/7.16 Unfolded term: [| bnd_axiom_m5; bnd_axiom_m4; bnd_axiom_m3; bnd_axiom_m2; bnd_axiom_m1;
% 7.62/7.16 bnd_adjunction; bnd_substitution_strict_equiv;
% 7.62/7.16 bnd_modus_ponens_strict_implies; bnd_op_strict_equiv; bnd_op_equiv;
% 7.62/7.16 bnd_op_strict_implies; bnd_op_implies; bnd_op_or; bnd_op_possibly;
% 7.62/7.16 bnd_op_strict_equiv -->
% 7.62/7.16 (ALL X Y.
% 7.62/7.16 bnd_strict_equiv X Y =
% 7.62/7.16 bnd_and (bnd_strict_implies X Y) (bnd_strict_implies Y X));
% 7.62/7.16 bnd_op_strict_implies -->
% 7.62/7.16 (ALL X Y. bnd_strict_implies X Y = bnd_necessarily (bnd_implies X Y));
% 7.62/7.16 bnd_op_necessarily -->
% 7.62/7.16 (ALL X. bnd_necessarily X = bnd_not (bnd_possibly (bnd_not X)));
% 7.62/7.16 bnd_op_possibly -->
% 7.62/7.16 (ALL X. bnd_possibly X = bnd_not (bnd_necessarily (bnd_not X)));
% 7.62/7.16 bnd_axiom_m10 =
% 7.62/7.16 (ALL X.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies (bnd_possibly X)
% 7.62/7.16 (bnd_necessarily (bnd_possibly X))));
% 7.62/7.16 bnd_axiom_m9 =
% 7.62/7.16 (ALL X.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies (bnd_possibly (bnd_possibly X))
% 7.62/7.16 (bnd_possibly X)));
% 7.62/7.16 bnd_axiom_m8 =
% 7.62/7.16 (ALL P Q.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies (bnd_strict_implies P Q)
% 7.62/7.16 (bnd_strict_implies (bnd_possibly P) (bnd_possibly Q))));
% 7.62/7.16 bnd_axiom_m7 =
% 7.62/7.16 (ALL P Q.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies (bnd_possibly (bnd_and P Q)) P));
% 7.62/7.16 bnd_axiom_m6 =
% 7.62/7.16 (ALL X. bnd_is_a_theorem (bnd_strict_implies X (bnd_possibly X)));
% 7.62/7.16 bnd_axiom_m5 =
% 7.62/7.16 (ALL X Y Z.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies
% 7.62/7.16 (bnd_and (bnd_strict_implies X Y) (bnd_strict_implies Y Z))
% 7.62/7.16 (bnd_strict_implies X Z)));
% 7.62/7.16 bnd_axiom_m4 =
% 7.62/7.16 (ALL X. bnd_is_a_theorem (bnd_strict_implies X (bnd_and X X)));
% 7.62/7.16 bnd_axiom_m3 =
% 7.62/7.16 (ALL X Y Z.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies (bnd_and (bnd_and X Y) Z)
% 7.62/7.16 (bnd_and X (bnd_and Y Z))));
% 7.62/7.16 bnd_axiom_m2 =
% 7.62/7.16 (ALL X Y. bnd_is_a_theorem (bnd_strict_implies (bnd_and X Y) X));
% 7.62/7.16 bnd_axiom_m1 =
% 7.62/7.16 (ALL X Y.
% 7.62/7.16 bnd_is_a_theorem (bnd_strict_implies (bnd_and X Y) (bnd_and Y X)));
% 7.62/7.16 bnd_axiom_s4 =
% 7.62/7.16 (ALL X.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies (bnd_necessarily X)
% 7.62/7.16 (bnd_necessarily (bnd_necessarily X))));
% 7.62/7.16 bnd_axiom_s3 =
% 7.62/7.16 (ALL X Y.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies (bnd_strict_implies X Y)
% 7.62/7.16 (bnd_strict_implies (bnd_not (bnd_possibly Y))
% 7.62/7.16 (bnd_not (bnd_possibly X)))));
% 7.62/7.16 bnd_axiom_s2 =
% 7.62/7.16 (ALL P Q.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_strict_implies (bnd_possibly (bnd_and P Q))
% 7.62/7.16 (bnd_and (bnd_possibly P) (bnd_possibly Q))));
% 7.62/7.16 bnd_axiom_s1 =
% 7.62/7.16 (ALL X Y Z.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_implies
% 7.62/7.16 (bnd_and (bnd_necessarily (bnd_implies X Y))
% 7.62/7.16 (bnd_necessarily (bnd_implies Y Z)))
% 7.62/7.16 (bnd_necessarily (bnd_implies X Z))));
% 7.62/7.16 bnd_axiom_5 =
% 7.62/7.16 (ALL X.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_implies (bnd_possibly X) (bnd_necessarily (bnd_possibly X))));
% 7.62/7.16 bnd_axiom_B =
% 7.62/7.16 (ALL X.
% 7.62/7.16 bnd_is_a_theorem (bnd_implies X (bnd_necessarily (bnd_possibly X))));
% 7.62/7.16 bnd_axiom_4 =
% 7.62/7.16 (ALL X.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_implies (bnd_necessarily X)
% 7.62/7.16 (bnd_necessarily (bnd_necessarily X))));
% 7.62/7.16 bnd_axiom_M =
% 7.62/7.16 (ALL X. bnd_is_a_theorem (bnd_implies (bnd_necessarily X) X));
% 7.62/7.16 bnd_axiom_K =
% 7.62/7.16 (ALL X Y.
% 7.62/7.16 bnd_is_a_theorem
% 7.62/7.16 (bnd_implies (bnd_necessarily (bnd_implies X Y))
% 7.62/7.16 (bnd_implies (bnd_necessarily X) (bnd_necessarily Y))));
% 7.62/7.16 bnd_substitution_strict_equiv =
% 7.62/7.16 (ALL X Y. bnd_is_a_theorem (bnd_strict_equiv X Y) --> X = Y);
% 7.62/7.16 bnd_adjunction =
% 7.62/7.16 (ALL X Y.
% 7.62/7.16 bnd_is_a_theorem X & bnd_is_a_theorem Y -->
% 7.62/7.16 bnd_is_a_theorem (bnd_and X Y));
% 7.62/7.16 bnd_modus_ponens_strict_implies =
% 7.62/7.16 (ALL X Y.
% 7.62/7.16 bnd_is_a_theorem X & bnd_is_a_theorem (bnd_strict_implies X Y) -->
% 7.62/7.16 bnd_is_a_theorem Y);
% 7.62/7.16 bnd_necessitation =
% 7.62/7.16 (ALL X. bnd_is_a_theorem X --> bnd_is_a_theorem (bnd_necessarily X));
% 7.62/7.16 bnd_op_equiv -->
% 7.62/7.16 (ALL X Y. bnd_equiv X Y = bnd_and (bnd_implies X Y) (bnd_implies Y X));
% 7.62/7.16 bnd_op_implies_or --> (ALL X Y. bnd_implies X Y = bnd_or (bnd_not X) Y);
% 7.62/7.16 bnd_op_implies_and -->
% 7.62/7.16 (ALL X Y. bnd_implies X Y = bnd_not (bnd_and X (bnd_not Y)));
% 7.62/7.16 bnd_op_and -->
% 7.62/7.16 (ALL X Y. bnd_and X Y = bnd_not (bnd_or (bnd_not X) (bnd_not Y)));
% 7.62/7.16 bnd_op_or -->
% 7.62/7.16 (ALL X Y. bnd_or X Y = bnd_not (bnd_and (bnd_not X) (bnd_not Y))) |]
% 7.62/7.16 ==> True
% 7.62/7.16 Adding axioms...
% 7.72/7.26 Typedef.type_definition_def
% 12.42/11.91 ...done.
% 12.42/11.91 Ground types: ?'b, TPTP_Interpret.ind
% 12.42/11.91 Translating term (sizes: 1, 1) ...
% 15.33/14.86 Invoking SAT solver...
% 16.03/15.55 No model exists.
% 16.03/15.55 Translating term (sizes: 2, 1) ...
% 19.03/18.54 Invoking SAT solver...
% 19.03/18.54 No model exists.
% 19.03/18.54 Translating term (sizes: 1, 2) ...
% 26.96/26.44 Invoking SAT solver...
% 26.96/26.44 No model exists.
% 26.96/26.44 Translating term (sizes: 3, 1) ...
% 32.95/32.45 Invoking SAT solver...
% 32.95/32.45 No model exists.
% 32.95/32.45 Translating term (sizes: 2, 2) ...
% 48.69/48.14 Invoking SAT solver...
% 48.69/48.14 No model exists.
% 48.69/48.14 Translating term (sizes: 1, 3) ...
% 66.22/65.61 Invoking SAT solver...
% 66.22/65.61 No model exists.
% 66.22/65.61 Translating term (sizes: 4, 1) ...
% 79.46/78.85 Invoking SAT solver...
% 79.46/78.85 No model exists.
% 79.46/78.85 Translating term (sizes: 3, 2) ...
% 175.02/174.06 Invoking SAT solver...
% 175.02/174.06 No model exists.
% 175.02/174.06 Translating term (sizes: 2, 3) ...
% 233.67/232.38 Invoking SAT solver...
% 233.77/232.40 No model exists.
% 233.77/232.40 Translating term (sizes: 1, 4) ...
% 267.15/265.52 Invoking SAT solver...
% 267.15/265.52 No model exists.
% 267.15/265.52 Translating term (sizes: 5, 1) ...
% 300.06/298.14 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 54975 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.06/298.14 54976 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.06/298.16 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 54918 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.06/298.16 54919 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.$"
%------------------------------------------------------------------------------