TSTP Solution File: LCL350-3 by Refute---2015

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Refute---2015
% Problem  : LCL350-3 : TPTP v6.4.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_refute %d %s

% Computer : n083.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 17:05:28 EDT 2016

% Result   : Timeout 300.12s
% 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  : LCL350-3 : TPTP v6.4.0. Released v2.3.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.02/0.23  % Computer : n083.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 : Sun Apr 10 16:45:39 CDT 2016
% 0.02/0.23  % CPUTime  : 
% 6.32/5.83  > val it = (): unit
% 6.52/6.02  Trying to find a model that refutes: True
% 6.81/6.35  Unfolded term: [| ~ bnd_theorem
% 6.81/6.35        (bnd_equivalent
% 6.81/6.35          (bnd_equivalent (bnd_or bnd_p bnd_r) (bnd_or bnd_q bnd_r))
% 6.81/6.35          (bnd_or bnd_r (bnd_equivalent bnd_p bnd_q)));
% 6.81/6.35     !!P Q. bnd_equivalent P Q = bnd_and (bnd_implies P Q) (bnd_implies Q P);
% 6.81/6.35     !!P Q. bnd_and P Q = bnd_not (bnd_or (bnd_not P) (bnd_not Q));
% 6.81/6.35     !!X Y.
% 6.81/6.35        (bnd_theorem X | ~ bnd_theorem (bnd_implies Y X)) | ~ bnd_theorem Y;
% 6.81/6.35     !!X. bnd_theorem X | ~ bnd_axiom X;
% 6.81/6.35     !!X Y. bnd_implies X Y = bnd_or (bnd_not X) Y;
% 6.81/6.35     !!A B C.
% 6.81/6.35        bnd_axiom
% 6.81/6.35         (bnd_implies (bnd_implies A B)
% 6.81/6.35           (bnd_implies (bnd_or C A) (bnd_or C B)));
% 6.81/6.35     !!A B C.
% 6.81/6.35        bnd_axiom
% 6.81/6.35         (bnd_implies (bnd_or A (bnd_or B C)) (bnd_or B (bnd_or A C)));
% 6.81/6.35     !!A B. bnd_axiom (bnd_implies (bnd_or A B) (bnd_or B A));
% 6.81/6.35     !!A B. bnd_axiom (bnd_implies A (bnd_or B A));
% 6.81/6.35     !!A. bnd_axiom (bnd_implies (bnd_or A A) A) |]
% 6.81/6.35  ==> True
% 6.81/6.35  Adding axioms...
% 6.81/6.37  Typedef.type_definition_def
% 8.50/8.01   ...done.
% 8.50/8.01  Ground types: ?'b, TPTP_Interpret.ind
% 8.50/8.01  Translating term (sizes: 1, 1) ...
% 9.51/9.05  Invoking SAT solver...
% 9.51/9.05  No model exists.
% 9.51/9.05  Translating term (sizes: 2, 1) ...
% 11.42/10.96  Invoking SAT solver...
% 11.42/10.96  No model exists.
% 11.42/10.96  Translating term (sizes: 1, 2) ...
% 15.10/14.63  Invoking SAT solver...
% 15.10/14.63  No model exists.
% 15.10/14.63  Translating term (sizes: 3, 1) ...
% 19.41/18.93  Invoking SAT solver...
% 19.41/18.93  No model exists.
% 19.41/18.93  Translating term (sizes: 2, 2) ...
% 30.85/30.33  Invoking SAT solver...
% 30.85/30.33  No model exists.
% 30.85/30.33  Translating term (sizes: 1, 3) ...
% 39.47/38.95  Invoking SAT solver...
% 39.47/38.95  No model exists.
% 39.47/38.95  Translating term (sizes: 4, 1) ...
% 50.79/50.26  Invoking SAT solver...
% 50.79/50.26  No model exists.
% 50.79/50.26  Translating term (sizes: 3, 2) ...
% 141.90/141.00  Invoking SAT solver...
% 141.90/141.00  No model exists.
% 141.90/141.00  Translating term (sizes: 2, 3) ...
% 191.38/190.27  Invoking SAT solver...
% 191.38/190.27  No model exists.
% 191.38/190.27  Translating term (sizes: 1, 4) ...
% 208.59/207.38  Invoking SAT solver...
% 208.59/207.38  No model exists.
% 208.59/207.38  Translating term (sizes: 5, 1) ...
% 239.86/238.39  Invoking SAT solver...
% 239.86/238.39  No model exists.
% 239.86/238.39  Translating term (sizes: 4, 2) ...
% 300.12/298.04  /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 33196 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.12/298.04       33197                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.12/298.05  /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 33141 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.12/298.05       33142 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.$"
%------------------------------------------------------------------------------