TSTP Solution File: GEO134+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : GEO134+1 : TPTP v6.4.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n118.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 14:35:05 EDT 2016
% Result : Timeout 300.03s
% 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 : GEO134+1 : TPTP v6.4.0. Released v2.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.23 % Computer : n118.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 : Sat Apr 9 13:27:54 CDT 2016
% 0.02/0.23 % CPUTime :
% 6.28/5.84 > val it = (): unit
% 6.48/6.06 Trying to find a model that refutes: (bnd_ordered_by O P Q & P ~= R) & ~ bnd_between O R P Q -->
% 6.48/6.06 bnd_ordered_by O R S = bnd_between O P R S
% 7.09/6.64 Unfolded term: [| ALL C O.
% 7.09/6.64 (C = bnd_underlying_curve O) =
% 7.09/6.64 (ALL P. bnd_incident_o P O = bnd_incident_c P C);
% 7.09/6.64 ALL O1 O2.
% 7.09/6.64 (ALL P Q. bnd_ordered_by O1 P Q = bnd_ordered_by O2 P Q) --> O1 = O2;
% 7.09/6.64 ALL P Q C.
% 7.09/6.64 ((bnd_open C & ~ P = Q) & bnd_incident_c P C) & bnd_incident_c Q C -->
% 7.09/6.64 (EX O. (ALL R. bnd_incident_o R O = bnd_incident_c R C) &
% 7.09/6.64 bnd_ordered_by O P Q);
% 7.09/6.64 ALL O. EX P. bnd_start_point P O;
% 7.09/6.64 ALL P Q R O.
% 7.09/6.64 bnd_between_o O P Q R =
% 7.09/6.64 (EX C. (ALL P. bnd_incident_o P O = bnd_incident_c P C) &
% 7.09/6.64 bnd_between_c C P Q R);
% 7.09/6.64 ALL O.
% 7.09/6.64 EX C. bnd_open C & (ALL P. bnd_incident_o P O = bnd_incident_c P C);
% 7.09/6.64 ALL O P Q.
% 7.09/6.64 bnd_ordered_by O P Q --> bnd_incident_o P O & bnd_incident_o Q O;
% 7.09/6.64 ALL P O.
% 7.09/6.64 bnd_finish_point P O =
% 7.09/6.64 (bnd_incident_o P O &
% 7.09/6.64 (ALL Q. ~ P = Q & bnd_incident_o Q O --> bnd_ordered_by O Q P));
% 7.09/6.64 ALL P O.
% 7.09/6.64 bnd_start_point P O =
% 7.09/6.64 (bnd_incident_o P O &
% 7.09/6.64 (ALL Q. ~ P = Q & bnd_incident_o Q O --> bnd_ordered_by O P Q));
% 7.09/6.64 ALL O P Q R.
% 7.09/6.64 bnd_between_o O P Q R =
% 7.09/6.64 (bnd_ordered_by O P Q & bnd_ordered_by O Q R |
% 7.09/6.64 bnd_ordered_by O R Q & bnd_ordered_by O Q P);
% 7.09/6.64 ALL C P Q R.
% 7.09/6.64 bnd_between_c C P Q R =
% 7.09/6.64 (~ P = R &
% 7.09/6.64 (EX Cpp.
% 7.09/6.64 ((bnd_part_of Cpp C & bnd_end_point P Cpp) &
% 7.09/6.64 bnd_end_point R Cpp) &
% 7.09/6.64 bnd_inner_point Q Cpp));
% 7.09/6.64 ALL C C1. (ALL P. bnd_incident_c P C = bnd_incident_c P C1) --> C = C1;
% 7.09/6.64 ALL C1 C2. (EX P. bnd_meet P C1 C2) --> (EX C. C = bnd_sum C1 C2);
% 7.09/6.64 ALL C C1 C2 P.
% 7.09/6.64 (bnd_closed C & bnd_meet P C1 C2) & C = bnd_sum C1 C2 -->
% 7.09/6.64 (ALL Q. bnd_end_point Q C1 --> bnd_meet Q C1 C2);
% 7.09/6.64 ALL C P. bnd_end_point P C --> (EX Q. bnd_end_point Q C & ~ P = Q);
% 7.09/6.64 ALL C P Q R.
% 7.09/6.64 (bnd_end_point P C & bnd_end_point Q C) & bnd_end_point R C -->
% 7.09/6.64 (P = Q | P = R) | Q = R;
% 7.09/6.64 ALL C P.
% 7.09/6.64 bnd_inner_point P C -->
% 7.09/6.64 (EX C1 C2. bnd_meet P C1 C2 & C = bnd_sum C1 C2);
% 7.09/6.64 ALL C. EX P. bnd_inner_point P C;
% 7.09/6.64 ALL C C1 C2 C3.
% 7.09/6.64 ((bnd_part_of C1 C & bnd_part_of C2 C) & bnd_part_of C3 C) &
% 7.09/6.64 (EX P. (bnd_end_point P C1 & bnd_end_point P C2) &
% 7.09/6.64 bnd_end_point P C3) -->
% 7.09/6.64 ((((bnd_part_of C2 C3 | bnd_part_of C3 C2) | bnd_part_of C1 C2) |
% 7.09/6.64 bnd_part_of C2 C1) |
% 7.09/6.64 bnd_part_of C1 C3) |
% 7.09/6.64 bnd_part_of C3 C1;
% 7.09/6.64 ALL C C1. bnd_part_of C1 C & ~ C1 = C --> bnd_open C1;
% 7.09/6.64 ALL C. bnd_open C = (EX P. bnd_end_point P C);
% 7.09/6.64 ALL C. bnd_closed C = (~ (EX P. bnd_end_point P C));
% 7.09/6.64 ALL P C C1.
% 7.09/6.64 bnd_meet P C C1 =
% 7.09/6.64 ((bnd_incident_c P C & bnd_incident_c P C1) &
% 7.09/6.64 (ALL Q.
% 7.09/6.64 bnd_incident_c Q C & bnd_incident_c Q C1 -->
% 7.09/6.64 bnd_end_point Q C & bnd_end_point Q C1));
% 7.09/6.64 ALL P C.
% 7.09/6.64 bnd_inner_point P C = (bnd_incident_c P C & ~ bnd_end_point P C);
% 7.09/6.64 ALL P C.
% 7.09/6.64 bnd_end_point P C =
% 7.09/6.64 (bnd_incident_c P C &
% 7.09/6.64 (ALL C1 C2.
% 7.09/6.64 ((bnd_part_of C1 C & bnd_part_of C2 C) & bnd_incident_c P C1) &
% 7.09/6.64 bnd_incident_c P C2 -->
% 7.09/6.64 bnd_part_of C1 C2 | bnd_part_of C2 C1));
% 7.09/6.64 ALL C C1 C2.
% 7.09/6.64 (C = bnd_sum C1 C2) =
% 7.09/6.64 (ALL Q.
% 7.09/6.64 bnd_incident_c Q C = (bnd_incident_c Q C1 | bnd_incident_c Q C2));
% 7.09/6.64 ALL C C1.
% 7.09/6.64 bnd_part_of C1 C =
% 7.09/6.64 (ALL P. bnd_incident_c P C1 --> bnd_incident_c P C) |]
% 7.09/6.64 ==> (bnd_ordered_by O P Q & ~ P = R) & ~ bnd_between O R P Q -->
% 7.09/6.64 bnd_ordered_by O R S = bnd_between O P R S
% 7.09/6.64 Adding axioms...
% 7.09/6.65 Typedef.type_definition_def
% 11.59/11.14 ...done.
% 11.59/11.15 Ground types: ?'b, TPTP_Interpret.ind
% 11.59/11.15 Translating term (sizes: 1, 1) ...
% 14.49/14.07 Invoking SAT solver...
% 14.49/14.07 No model exists.
% 14.49/14.07 Translating term (sizes: 2, 1) ...
% 18.11/17.68 Invoking SAT solver...
% 18.11/17.68 No model exists.
% 18.11/17.68 Translating term (sizes: 1, 2) ...
% 45.47/45.00 Invoking SAT solver...
% 45.47/45.01 No model exists.
% 45.47/45.01 Translating term (sizes: 3, 1) ...
% 51.59/51.03 Invoking SAT solver...
% 51.59/51.03 No model exists.
% 51.59/51.03 Translating term (sizes: 2, 2) ...
% 86.82/86.17 Invoking SAT solver...
% 86.82/86.17 No model exists.
% 86.82/86.17 Translating term (sizes: 1, 3) ...
% 237.33/235.78 Invoking SAT solver...
% 237.53/236.00 No model exists.
% 237.53/236.00 Translating term (sizes: 4, 1) ...
% 250.85/249.13 Invoking SAT solver...
% 250.85/249.13 No model exists.
% 250.85/249.13 Translating term (sizes: 3, 2) ...
% 300.03/297.82 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 1896 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.03/297.82 1897 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.03/297.83 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 1842 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.03/297.83 1843 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.$"
%------------------------------------------------------------------------------