TSTP Solution File: HAL003+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : HAL003+1 : TPTP v6.4.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n157.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 15:24:49 EDT 2016
% Result : Timeout 300.04s
% 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 : HAL003+1 : TPTP v6.4.0. Released v2.6.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n157.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 15:23:24 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.36/6.00 > val it = (): unit
% 6.56/6.23 Trying to find a model that refutes: bnd_surjection bnd_g
% 7.27/6.98 Unfolded term: [| bnd_surjection bnd_h; bnd_surjection bnd_f;
% 7.27/6.98 bnd_commute bnd_beta bnd_h bnd_g bnd_delta;
% 7.27/6.98 bnd_commute bnd_alpha bnd_g bnd_f bnd_gamma;
% 7.27/6.98 bnd_exact bnd_gammma bnd_delta; bnd_exact bnd_alpha bnd_beta;
% 7.27/6.98 bnd_surjection bnd_delta; bnd_surjection bnd_beta;
% 7.27/6.98 bnd_injection bnd_gamma; bnd_injection bnd_alpha;
% 7.27/6.98 bnd_morphism bnd_h bnd_c bnd_r; bnd_morphism bnd_g bnd_b bnd_e;
% 7.27/6.98 bnd_morphism bnd_f bnd_a bnd_d; bnd_morphism bnd_delta bnd_e bnd_r;
% 7.27/6.98 bnd_morphism bnd_gamma bnd_d bnd_e; bnd_morphism bnd_beta bnd_b bnd_c;
% 7.27/6.98 bnd_morphism bnd_alpha bnd_a bnd_b;
% 7.27/6.98 ALL Morphism Dom Cod.
% 7.27/6.98 bnd_morphism Morphism Dom Cod -->
% 7.27/6.98 (ALL El1 El2.
% 7.27/6.98 bnd_element El1 Dom & bnd_element El2 Dom -->
% 7.27/6.98 bnd_apply Morphism (bnd_subtract Dom El1 El2) =
% 7.27/6.98 bnd_subtract Cod (bnd_apply Morphism El1)
% 7.27/6.98 (bnd_apply Morphism El2));
% 7.27/6.98 ALL Dom El1 El2.
% 7.27/6.98 bnd_element El1 Dom & bnd_element El2 Dom -->
% 7.27/6.98 bnd_subtract Dom El1 (bnd_subtract Dom El1 El2) = El2;
% 7.27/6.98 ALL Dom El. bnd_element El Dom --> bnd_subtract Dom El El = bnd_zero Dom;
% 7.27/6.98 ALL Dom El1 El2.
% 7.27/6.98 bnd_element El1 Dom & bnd_element El2 Dom -->
% 7.27/6.98 bnd_element (bnd_subtract Dom El1 El2) Dom;
% 7.27/6.98 ALL M1 M2 M3 M4 Dom DomCod1 DomCod2 Cod.
% 7.27/6.98 (((bnd_morphism M1 Dom DomCod1 & bnd_morphism M2 DomCod1 Cod) &
% 7.27/6.98 bnd_morphism M3 Dom DomCod2) &
% 7.27/6.98 bnd_morphism M4 DomCod2 Cod) &
% 7.27/6.98 (ALL ElDom.
% 7.27/6.98 bnd_element ElDom Dom -->
% 7.27/6.98 bnd_apply M2 (bnd_apply M1 ElDom) =
% 7.27/6.98 bnd_apply M4 (bnd_apply M3 ElDom)) -->
% 7.27/6.98 bnd_commute M1 M2 M3 M4;
% 7.27/6.98 ALL M1 M2 M3 M4 Dom DomCod1 DomCod2 Cod.
% 7.27/6.98 (((bnd_commute M1 M2 M3 M4 & bnd_morphism M1 Dom DomCod1) &
% 7.27/6.98 bnd_morphism M2 DomCod1 Cod) &
% 7.27/6.98 bnd_morphism M3 Dom DomCod2) &
% 7.27/6.98 bnd_morphism M4 DomCod2 Cod -->
% 7.27/6.98 (ALL ElDom.
% 7.27/6.98 bnd_element ElDom Dom -->
% 7.27/6.98 bnd_apply M2 (bnd_apply M1 ElDom) =
% 7.27/6.98 bnd_apply M4 (bnd_apply M3 ElDom));
% 7.27/6.98 ALL Morphism1 Morphism2 Dom CodDom Cod.
% 7.27/6.98 (bnd_morphism Morphism1 Dom CodDom &
% 7.27/6.98 bnd_morphism Morphism2 CodDom Cod) &
% 7.27/6.98 (ALL ElCodDom.
% 7.27/6.98 (bnd_element ElCodDom CodDom &
% 7.27/6.98 bnd_apply Morphism2 ElCodDom = bnd_zero Cod) =
% 7.27/6.98 (EX ElDom.
% 7.27/6.98 bnd_element ElDom Dom &
% 7.27/6.98 bnd_apply Morphism1 ElDom = ElCodDom)) -->
% 7.27/6.98 bnd_exact Morphism1 Morphism2;
% 7.27/6.98 ALL Morphism1 Morphism2 Dom CodDom Cod.
% 7.27/6.98 (bnd_exact Morphism1 Morphism2 & bnd_morphism Morphism1 Dom CodDom) &
% 7.27/6.98 bnd_morphism Morphism2 CodDom Cod -->
% 7.27/6.98 (ALL ElCodDom.
% 7.27/6.98 (bnd_element ElCodDom CodDom &
% 7.27/6.98 bnd_apply Morphism2 ElCodDom = bnd_zero Cod) =
% 7.27/6.98 (EX ElDom.
% 7.27/6.98 bnd_element ElDom Dom &
% 7.27/6.98 bnd_apply Morphism1 ElDom = ElCodDom));
% 7.27/6.98 ALL Morphism Dom Cod.
% 7.27/6.98 bnd_morphism Morphism Dom Cod &
% 7.27/6.98 (ALL ElCod.
% 7.27/6.98 bnd_element ElCod Cod -->
% 7.27/6.98 (EX ElDom.
% 7.27/6.98 bnd_element ElDom Dom & bnd_apply Morphism ElDom = ElCod)) -->
% 7.27/6.98 bnd_surjection Morphism;
% 7.27/6.98 ALL Morphism Dom Cod.
% 7.27/6.98 bnd_surjection Morphism & bnd_morphism Morphism Dom Cod -->
% 7.27/6.98 (ALL ElCod.
% 7.27/6.98 bnd_element ElCod Cod -->
% 7.27/6.98 (EX ElDom.
% 7.27/6.98 bnd_element ElDom Dom & bnd_apply Morphism ElDom = ElCod));
% 7.27/6.98 ALL Morphism Dom Cod.
% 7.27/6.98 bnd_morphism Morphism Dom Cod &
% 7.27/6.98 (ALL El1 El2.
% 7.27/6.98 (bnd_element El1 Dom & bnd_element El2 Dom) &
% 7.27/6.98 bnd_apply Morphism El1 = bnd_apply Morphism El2 -->
% 7.27/6.98 El1 = El2) -->
% 7.27/6.98 bnd_injection Morphism;
% 7.27/6.98 ALL Morphism Dom Cod.
% 7.27/6.98 bnd_injection Morphism & bnd_morphism Morphism Dom Cod -->
% 7.27/6.98 (ALL El1 El2.
% 7.27/6.98 (bnd_element El1 Dom & bnd_element El2 Dom) &
% 7.27/6.98 bnd_apply Morphism El1 = bnd_apply Morphism El2 -->
% 7.27/6.98 El1 = El2);
% 7.27/6.98 ALL Morphism Dom Cod.
% 7.27/6.98 bnd_morphism Morphism Dom Cod -->
% 7.27/6.98 (ALL El.
% 7.27/6.98 bnd_element El Dom --> bnd_element (bnd_apply Morphism El) Cod) &
% 7.27/6.98 bnd_apply Morphism (bnd_zero Dom) = bnd_zero Cod |]
% 7.27/6.98 ==> bnd_surjection bnd_g
% 7.27/6.98 Adding axioms...
% 7.36/7.00 Typedef.type_definition_def
% 11.98/11.64 ...done.
% 11.98/11.64 Ground types: ?'b, TPTP_Interpret.ind
% 11.98/11.64 Translating term (sizes: 1, 1) ...
% 14.79/14.42 Invoking SAT solver...
% 15.08/14.74 No model exists.
% 15.08/14.74 Translating term (sizes: 2, 1) ...
% 18.18/17.88 Invoking SAT solver...
% 18.18/17.88 No model exists.
% 18.18/17.88 Translating term (sizes: 1, 2) ...
% 184.35/183.41 Invoking SAT solver...
% 190.43/189.48 No model exists.
% 190.43/189.48 Translating term (sizes: 3, 1) ...
% 196.37/195.33 Invoking SAT solver...
% 196.37/195.33 No model exists.
% 196.37/195.33 Translating term (sizes: 2, 2) ...
% 300.04/298.23 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 56532 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.04/298.23 56533 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.04/298.24 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 56478 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.04/298.24 56479 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.$"
%------------------------------------------------------------------------------