TSTP Solution File: GRA075+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : GRA075+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n125.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:48:04 EDT 2016
% Result : Timeout 299.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 : GRA075+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.22 % Computer : n125.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.75MB
% 0.02/0.22 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Sat Apr 9 11:39:39 CDT 2016
% 0.02/0.23 % CPUTime :
% 6.28/6.84 > val it = (): unit
% 6.48/7.05 Trying to find a model that refutes: True
% 6.98/7.53 Unfolded term: [| ALL V1 V2 E1 E2 P.
% 6.98/7.53 bnd_shortest_path V1 V2 P & bnd_precedes E1 E2 P -->
% 6.98/7.53 ~ (EX E3.
% 6.98/7.53 bnd_tail_of E3 = bnd_tail_of E1 &
% 6.98/7.53 bnd_head_of E3 = bnd_head_of E2) &
% 6.98/7.53 ~ bnd_precedes E2 E1 P;
% 6.98/7.53 ALL V1 V2 SP.
% 6.98/7.53 bnd_shortest_path V1 V2 SP =
% 6.98/7.53 ((bnd_path V1 V2 SP & ~ V1 = V2) &
% 6.98/7.53 (ALL P.
% 6.98/7.53 bnd_path V1 V2 P -->
% 6.98/7.53 bnd_less_or_equal (bnd_length_of SP) (bnd_length_of P)));
% 6.98/7.53 ALL P V1 V2.
% 6.98/7.53 bnd_path V1 V2 P -->
% 6.98/7.53 (ALL E1 E2.
% 6.98/7.53 bnd_precedes E1 E2 P -->
% 6.98/7.53 (bnd_on_path E1 P & bnd_on_path E2 P) &
% 6.98/7.53 ~ bnd_sequential E1 E2 =
% 6.98/7.53 (EX E3. bnd_sequential E1 E3 & bnd_precedes E3 E2 P));
% 6.98/7.53 ALL P V1 V2.
% 6.98/7.53 bnd_path V1 V2 P -->
% 6.98/7.53 (ALL E1 E2.
% 6.98/7.53 (bnd_on_path E1 P & bnd_on_path E2 P) &
% 6.98/7.53 (bnd_sequential E1 E2 |
% 6.98/7.53 (EX E3. bnd_sequential E1 E3 & bnd_precedes E3 E2 P)) -->
% 6.98/7.53 bnd_precedes E1 E2 P);
% 6.98/7.53 ALL E1 E2.
% 6.98/7.53 bnd_sequential E1 E2 =
% 6.98/7.53 (((bnd_edge E1 & bnd_edge E2) & ~ E1 = E2) &
% 6.98/7.53 bnd_head_of E1 = bnd_tail_of E2);
% 6.98/7.53 ALL V1 V2 P V.
% 6.98/7.53 bnd_path V1 V2 P & bnd_in_path V P -->
% 6.98/7.53 bnd_vertex V &
% 6.98/7.53 (EX E. bnd_on_path E P & (V = bnd_head_of E | V = bnd_tail_of E));
% 6.98/7.53 ALL V1 V2 P E.
% 6.98/7.53 bnd_path V1 V2 P & bnd_on_path E P -->
% 6.98/7.53 (bnd_edge E & bnd_in_path (bnd_head_of E) P) &
% 6.98/7.53 bnd_in_path (bnd_tail_of E) P;
% 6.98/7.53 ALL V1 V2 P.
% 6.98/7.53 bnd_path V1 V2 P -->
% 6.98/7.53 (bnd_vertex V1 & bnd_vertex V2) &
% 6.98/7.53 (EX E. (bnd_edge E & V1 = bnd_tail_of E) &
% 6.98/7.53 ~ (V2 = bnd_head_of E & P = bnd_path_cons E bnd_empty) =
% 6.98/7.53 (EX TP.
% 6.98/7.53 bnd_path (bnd_head_of E) V2 TP &
% 6.98/7.53 P = bnd_path_cons E TP));
% 6.98/7.53 ALL V1 V2 P.
% 6.98/7.53 (bnd_vertex V1 & bnd_vertex V2) &
% 6.98/7.53 (EX E. (bnd_edge E & V1 = bnd_tail_of E) &
% 6.98/7.53 (V2 = bnd_head_of E & P = bnd_path_cons E bnd_empty |
% 6.98/7.53 (EX TP.
% 6.98/7.53 bnd_path (bnd_head_of E) V2 TP &
% 6.98/7.53 P = bnd_path_cons E TP))) -->
% 6.98/7.53 bnd_path V1 V2 P;
% 6.98/7.53 bnd_complete -->
% 6.98/7.53 (ALL V1 V2.
% 6.98/7.53 (bnd_vertex V1 & bnd_vertex V2) & ~ V1 = V2 -->
% 6.98/7.53 (EX E. bnd_edge E &
% 6.98/7.53 ~ (V1 = bnd_head_of E & V2 = bnd_tail_of E) =
% 6.98/7.53 (V2 = bnd_head_of E & V1 = bnd_tail_of E)));
% 6.98/7.53 ALL E.
% 6.98/7.53 bnd_edge E -->
% 6.98/7.53 bnd_vertex (bnd_head_of E) & bnd_vertex (bnd_tail_of E);
% 6.98/7.53 ALL E. bnd_edge E --> ~ bnd_head_of E = bnd_tail_of E |]
% 6.98/7.53 ==> True
% 6.98/7.53 Adding axioms...
% 6.98/7.54 Typedef.type_definition_def
% 9.99/10.51 ...done.
% 10.50/11.09 Ground types: ?'b, TPTP_Interpret.ind
% 10.50/11.09 Translating term (sizes: 1, 1) ...
% 12.00/12.51 Invoking SAT solver...
% 12.00/12.51 No model exists.
% 12.00/12.51 Translating term (sizes: 2, 1) ...
% 14.69/15.21 Invoking SAT solver...
% 14.69/15.21 No model exists.
% 14.69/15.21 Translating term (sizes: 1, 2) ...
% 43.86/44.37 Invoking SAT solver...
% 43.86/44.37 No model exists.
% 43.86/44.37 Translating term (sizes: 3, 1) ...
% 48.98/49.41 Invoking SAT solver...
% 48.98/49.41 No model exists.
% 48.98/49.41 Translating term (sizes: 2, 2) ...
% 85.58/85.90 Invoking SAT solver...
% 85.58/85.90 No model exists.
% 85.58/85.90 Translating term (sizes: 1, 3) ...
% 299.06/297.99 Invoking SAT solver...
% 299.06/297.99 No model exists.
% 299.06/297.99 Translating term (sizes: 4, 1) ...
% 300.08/298.92 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 57853 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.08/298.92 57854 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.08/298.93 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 57799 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.08/298.93 57800 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.$"
%------------------------------------------------------------------------------