TSTP Solution File: KLE136+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : KLE136+1 : TPTP v6.4.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n101.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 16:15:46 EDT 2016
% Result : Timeout 295.33s
% 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 : KLE136+1 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n101.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 : Sat Apr 9 21:47:54 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.31/5.85 > val it = (): unit
% 6.51/6.07 Trying to find a model that refutes: bnd_divergence (bnd_addition X0 X1) = bnd_zero &
% 6.51/6.07 bnd_addition (bnd_multiplication X1 X0)
% 6.51/6.07 (bnd_multiplication (bnd_star X0) (bnd_star X1)) =
% 6.51/6.07 bnd_multiplication (bnd_star X0) (bnd_star X1) -->
% 6.51/6.07 bnd_addition (bnd_star (bnd_addition X0 X1))
% 6.51/6.07 (bnd_multiplication (bnd_star X0) (bnd_star X1)) =
% 6.51/6.07 bnd_multiplication (bnd_star X0) (bnd_star X1)
% 7.30/6.87 Unfolded term: [| ALL X0 X1 X2.
% 7.30/6.87 bnd_addition (bnd_domain X0)
% 7.30/6.87 (bnd_addition (bnd_forward_diamond X1 (bnd_domain X0))
% 7.30/6.87 (bnd_domain X2)) =
% 7.30/6.87 bnd_addition (bnd_forward_diamond X1 (bnd_domain X0))
% 7.30/6.87 (bnd_domain X2) -->
% 7.30/6.87 bnd_addition (bnd_domain X0)
% 7.30/6.87 (bnd_addition (bnd_divergence X1)
% 7.30/6.87 (bnd_forward_diamond (bnd_star X1) (bnd_domain X2))) =
% 7.30/6.87 bnd_addition (bnd_divergence X1)
% 7.30/6.87 (bnd_forward_diamond (bnd_star X1) (bnd_domain X2));
% 7.30/6.87 ALL X0. bnd_forward_diamond X0 (bnd_divergence X0) = bnd_divergence X0;
% 7.30/6.87 ALL X0 X1.
% 7.30/6.87 bnd_backward_box X0 X1 = bnd_c (bnd_backward_diamond X0 (bnd_c X1));
% 7.30/6.87 ALL X0 X1.
% 7.30/6.87 bnd_forward_box X0 X1 = bnd_c (bnd_forward_diamond X0 (bnd_c X1));
% 7.30/6.87 ALL X0 X1.
% 7.30/6.87 bnd_backward_diamond X0 X1 =
% 7.30/6.87 bnd_codomain (bnd_multiplication (bnd_codomain X1) X0);
% 7.30/6.87 ALL X0 X1.
% 7.30/6.87 bnd_forward_diamond X0 X1 =
% 7.30/6.87 bnd_domain (bnd_multiplication X0 (bnd_domain X1));
% 7.30/6.87 ALL X0 X1.
% 7.30/6.87 bnd_domain_difference X0 X1 =
% 7.30/6.87 bnd_multiplication (bnd_domain X0) (bnd_antidomain X1);
% 7.30/6.87 ALL X0. bnd_c X0 = bnd_antidomain (bnd_domain X0);
% 7.30/6.87 ALL X0. bnd_codomain X0 = bnd_coantidomain (bnd_coantidomain X0);
% 7.30/6.87 ALL X0.
% 7.30/6.87 bnd_addition (bnd_coantidomain (bnd_coantidomain X0))
% 7.30/6.87 (bnd_coantidomain X0) =
% 7.30/6.87 bnd_one;
% 7.30/6.87 ALL X0 X1.
% 7.30/6.87 bnd_addition (bnd_coantidomain (bnd_multiplication X0 X1))
% 7.30/6.87 (bnd_coantidomain
% 7.30/6.87 (bnd_multiplication (bnd_coantidomain (bnd_coantidomain X0)) X1)) =
% 7.30/6.87 bnd_coantidomain
% 7.30/6.87 (bnd_multiplication (bnd_coantidomain (bnd_coantidomain X0)) X1);
% 7.30/6.87 ALL X0. bnd_multiplication X0 (bnd_coantidomain X0) = bnd_zero;
% 7.30/6.87 ALL X0. bnd_domain X0 = bnd_antidomain (bnd_antidomain X0);
% 7.30/6.87 ALL X0.
% 7.30/6.87 bnd_addition (bnd_antidomain (bnd_antidomain X0))
% 7.30/6.87 (bnd_antidomain X0) =
% 7.30/6.87 bnd_one;
% 7.30/6.87 ALL X0 X1.
% 7.30/6.87 bnd_addition (bnd_antidomain (bnd_multiplication X0 X1))
% 7.30/6.87 (bnd_antidomain
% 7.30/6.87 (bnd_multiplication X0 (bnd_antidomain (bnd_antidomain X1)))) =
% 7.30/6.87 bnd_antidomain
% 7.30/6.87 (bnd_multiplication X0 (bnd_antidomain (bnd_antidomain X1)));
% 7.30/6.87 ALL X0. bnd_multiplication (bnd_antidomain X0) X0 = bnd_zero;
% 7.30/6.87 ALL A B. bnd_leq A B = (bnd_addition A B = B);
% 7.30/6.87 ALL A. bnd_multiplication bnd_zero A = bnd_zero;
% 7.30/6.87 ALL A. bnd_multiplication A bnd_zero = bnd_zero;
% 7.30/6.87 ALL A B C.
% 7.30/6.87 bnd_multiplication (bnd_addition A B) C =
% 7.30/6.87 bnd_addition (bnd_multiplication A C) (bnd_multiplication B C);
% 7.30/6.87 ALL A B C.
% 7.30/6.87 bnd_multiplication A (bnd_addition B C) =
% 7.30/6.87 bnd_addition (bnd_multiplication A B) (bnd_multiplication A C);
% 7.30/6.87 ALL A. bnd_multiplication bnd_one A = A;
% 7.30/6.87 ALL A. bnd_multiplication A bnd_one = A;
% 7.30/6.87 ALL A B C.
% 7.30/6.87 bnd_multiplication A (bnd_multiplication B C) =
% 7.30/6.87 bnd_multiplication (bnd_multiplication A B) C;
% 7.30/6.87 ALL A. bnd_addition A A = A; ALL A. bnd_addition A bnd_zero = A;
% 7.30/6.87 ALL C B A.
% 7.30/6.87 bnd_addition A (bnd_addition B C) = bnd_addition (bnd_addition A B) C;
% 7.30/6.87 ALL A B. bnd_addition A B = bnd_addition B A |]
% 7.30/6.87 ==> bnd_divergence (bnd_addition X0 X1) = bnd_zero &
% 7.30/6.87 bnd_addition (bnd_multiplication X1 X0)
% 7.30/6.87 (bnd_multiplication (bnd_star X0) (bnd_star X1)) =
% 7.30/6.87 bnd_multiplication (bnd_star X0) (bnd_star X1) -->
% 7.30/6.87 bnd_addition (bnd_star (bnd_addition X0 X1))
% 7.30/6.87 (bnd_multiplication (bnd_star X0) (bnd_star X1)) =
% 7.30/6.87 bnd_multiplication (bnd_star X0) (bnd_star X1)
% 7.30/6.87 Adding axioms...
% 7.30/6.88 Typedef.type_definition_def
% 12.41/11.94 ...done.
% 12.41/11.95 Ground types: ?'b, TPTP_Interpret.ind
% 12.41/11.95 Translating term (sizes: 1, 1) ...
% 14.82/14.37 Invoking SAT solver...
% 15.10/14.62 No model exists.
% 15.10/14.62 Translating term (sizes: 2, 1) ...
% 17.92/17.48 Invoking SAT solver...
% 17.92/17.48 No model exists.
% 17.92/17.48 Translating term (sizes: 1, 2) ...
% 26.02/25.50 Invoking SAT solver...
% 26.02/25.56 No model exists.
% 26.02/25.56 Translating term (sizes: 3, 1) ...
% 31.55/31.03 Invoking SAT solver...
% 31.55/31.03 No model exists.
% 31.55/31.03 Translating term (sizes: 2, 2) ...
% 47.29/46.77 Invoking SAT solver...
% 47.39/46.83 No model exists.
% 47.39/46.83 Translating term (sizes: 1, 3) ...
% 67.67/67.09 Invoking SAT solver...
% 95.92/94.76 No model exists.
% 95.92/94.76 Translating term (sizes: 4, 1) ...
% 108.67/107.45 Invoking SAT solver...
% 108.67/107.45 No model exists.
% 108.67/107.45 Translating term (sizes: 3, 2) ...
% 204.95/203.04 Invoking SAT solver...
% 205.06/203.10 No model exists.
% 205.06/203.10 Translating term (sizes: 2, 3) ...
% 266.94/264.39 Invoking SAT solver...
% 295.33/291.76 No model exists.
% 295.33/291.76 Translating term (sizes: 1, 4) ...
% 300.02/296.32 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 7721 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.02/296.32 7722 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.02/296.33 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 7667 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.02/296.33 7668 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.$"
%------------------------------------------------------------------------------