TSTP Solution File: GEO115+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : GEO115+1 : TPTP v6.4.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n080.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:02 EDT 2016
% Result : Timeout 300.08s
% 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.04 % Problem : GEO115+1 : TPTP v6.4.0. Released v2.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n080.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 13:06:24 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.30/5.83 > val it = (): unit
% 6.50/6.03 Trying to find a model that refutes: (bnd_between_c C P Q R & bnd_incident_c Qpp C) & Q ~= Qpp -->
% 6.50/6.03 bnd_between_c C P Q Qpp | bnd_between_c C Qpp Q R
% 6.90/6.45 Unfolded term: [| ALL C P Q R.
% 6.90/6.45 bnd_between_c C P Q R =
% 6.90/6.45 (~ P = R &
% 6.90/6.45 (EX Cpp.
% 6.90/6.45 ((bnd_part_of Cpp C & bnd_end_point P Cpp) &
% 6.90/6.45 bnd_end_point R Cpp) &
% 6.90/6.45 bnd_inner_point Q Cpp));
% 6.90/6.45 ALL C C1. (ALL P. bnd_incident_c P C = bnd_incident_c P C1) --> C = C1;
% 6.90/6.45 ALL C1 C2. (EX P. bnd_meet P C1 C2) --> (EX C. C = bnd_sum C1 C2);
% 6.90/6.45 ALL C C1 C2 P.
% 6.90/6.45 (bnd_closed C & bnd_meet P C1 C2) & C = bnd_sum C1 C2 -->
% 6.90/6.45 (ALL Q. bnd_end_point Q C1 --> bnd_meet Q C1 C2);
% 6.90/6.45 ALL C P. bnd_end_point P C --> (EX Q. bnd_end_point Q C & ~ P = Q);
% 6.90/6.45 ALL C P Q R.
% 6.90/6.45 (bnd_end_point P C & bnd_end_point Q C) & bnd_end_point R C -->
% 6.90/6.45 (P = Q | P = R) | Q = R;
% 6.90/6.45 ALL C P.
% 6.90/6.45 bnd_inner_point P C -->
% 6.90/6.45 (EX C1 C2. bnd_meet P C1 C2 & C = bnd_sum C1 C2);
% 6.90/6.45 ALL C. EX P. bnd_inner_point P C;
% 6.90/6.45 ALL C C1 C2 C3.
% 6.90/6.45 ((bnd_part_of C1 C & bnd_part_of C2 C) & bnd_part_of C3 C) &
% 6.90/6.45 (EX P. (bnd_end_point P C1 & bnd_end_point P C2) &
% 6.90/6.45 bnd_end_point P C3) -->
% 6.90/6.45 ((((bnd_part_of C2 C3 | bnd_part_of C3 C2) | bnd_part_of C1 C2) |
% 6.90/6.45 bnd_part_of C2 C1) |
% 6.90/6.45 bnd_part_of C1 C3) |
% 6.90/6.45 bnd_part_of C3 C1;
% 6.90/6.45 ALL C C1. bnd_part_of C1 C & ~ C1 = C --> bnd_open C1;
% 6.90/6.45 ALL C. bnd_open C = (EX P. bnd_end_point P C);
% 6.90/6.45 ALL C. bnd_closed C = (~ (EX P. bnd_end_point P C));
% 6.90/6.45 ALL P C C1.
% 6.90/6.45 bnd_meet P C C1 =
% 6.90/6.45 ((bnd_incident_c P C & bnd_incident_c P C1) &
% 6.90/6.45 (ALL Q.
% 6.90/6.45 bnd_incident_c Q C & bnd_incident_c Q C1 -->
% 6.90/6.45 bnd_end_point Q C & bnd_end_point Q C1));
% 6.90/6.45 ALL P C.
% 6.90/6.45 bnd_inner_point P C = (bnd_incident_c P C & ~ bnd_end_point P C);
% 6.90/6.45 ALL P C.
% 6.90/6.45 bnd_end_point P C =
% 6.90/6.45 (bnd_incident_c P C &
% 6.90/6.45 (ALL C1 C2.
% 6.90/6.45 ((bnd_part_of C1 C & bnd_part_of C2 C) & bnd_incident_c P C1) &
% 6.90/6.45 bnd_incident_c P C2 -->
% 6.90/6.45 bnd_part_of C1 C2 | bnd_part_of C2 C1));
% 6.90/6.45 ALL C C1 C2.
% 6.90/6.45 (C = bnd_sum C1 C2) =
% 6.90/6.45 (ALL Q.
% 6.90/6.45 bnd_incident_c Q C = (bnd_incident_c Q C1 | bnd_incident_c Q C2));
% 6.90/6.45 ALL C C1.
% 6.90/6.45 bnd_part_of C1 C =
% 6.90/6.45 (ALL P. bnd_incident_c P C1 --> bnd_incident_c P C) |]
% 6.90/6.45 ==> (bnd_between_c C P Q R & bnd_incident_c Qpp C) & ~ Q = Qpp -->
% 6.90/6.45 bnd_between_c C P Q Qpp | bnd_between_c C Qpp Q R
% 6.90/6.45 Adding axioms...
% 6.90/6.45 Typedef.type_definition_def
% 9.80/9.35 ...done.
% 9.80/9.36 Ground types: ?'b, TPTP_Interpret.ind
% 9.80/9.36 Translating term (sizes: 1, 1) ...
% 11.91/11.40 Invoking SAT solver...
% 11.91/11.40 No model exists.
% 11.91/11.40 Translating term (sizes: 2, 1) ...
% 14.62/14.12 Invoking SAT solver...
% 14.62/14.12 No model exists.
% 14.62/14.12 Translating term (sizes: 1, 2) ...
% 32.14/31.66 Invoking SAT solver...
% 32.14/31.67 No model exists.
% 32.14/31.67 Translating term (sizes: 3, 1) ...
% 37.26/36.78 Invoking SAT solver...
% 37.26/36.78 No model exists.
% 37.26/36.78 Translating term (sizes: 2, 2) ...
% 62.53/61.94 Invoking SAT solver...
% 62.53/61.95 No model exists.
% 62.53/61.95 Translating term (sizes: 1, 3) ...
% 152.42/151.52 Invoking SAT solver...
% 152.42/151.57 No model exists.
% 152.42/151.57 Translating term (sizes: 4, 1) ...
% 164.77/163.83 Invoking SAT solver...
% 164.77/163.83 No model exists.
% 164.77/163.83 Translating term (sizes: 3, 2) ...
% 270.31/268.77 Invoking SAT solver...
% 270.31/268.77 No model exists.
% 270.31/268.77 Translating term (sizes: 2, 3) ...
% 300.08/298.22 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 12648 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.08/298.22 12649 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.08/298.23 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 12594 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.08/298.23 12595 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.$"
%------------------------------------------------------------------------------