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

View Problem - Process Solution

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

% Computer : n121.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:22 EDT 2016

% Result   : Timeout 300.11s
% 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  : LCL279-3 : TPTP v6.4.0. Released v2.3.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.23  % Computer : n121.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 : Sun Apr 10 16:19:09 CDT 2016
% 0.03/0.23  % CPUTime  : 
% 6.32/5.84  > val it = (): unit
% 6.51/6.03  Trying to find a model that refutes: True
% 6.82/6.37  Unfolded term: [| ~ bnd_theorem
% 6.82/6.37        (bnd_implies
% 6.82/6.37          (bnd_and (bnd_equivalent bnd_p bnd_r) (bnd_equivalent bnd_q bnd_s))
% 6.82/6.37          (bnd_equivalent (bnd_and bnd_p bnd_q) (bnd_and bnd_r bnd_s)));
% 6.82/6.37     !!P Q. bnd_equivalent P Q = bnd_and (bnd_implies P Q) (bnd_implies Q P);
% 6.82/6.37     !!P Q. bnd_and P Q = bnd_not (bnd_or (bnd_not P) (bnd_not Q));
% 6.82/6.37     !!X Y.
% 6.82/6.37        (bnd_theorem X | ~ bnd_theorem (bnd_implies Y X)) | ~ bnd_theorem Y;
% 6.82/6.37     !!X. bnd_theorem X | ~ bnd_axiom X;
% 6.82/6.37     !!X Y. bnd_implies X Y = bnd_or (bnd_not X) Y;
% 6.82/6.37     !!A B C.
% 6.82/6.37        bnd_axiom
% 6.82/6.37         (bnd_implies (bnd_implies A B)
% 6.82/6.37           (bnd_implies (bnd_or C A) (bnd_or C B)));
% 6.82/6.37     !!A B C.
% 6.82/6.37        bnd_axiom
% 6.82/6.37         (bnd_implies (bnd_or A (bnd_or B C)) (bnd_or B (bnd_or A C)));
% 6.82/6.37     !!A B. bnd_axiom (bnd_implies (bnd_or A B) (bnd_or B A));
% 6.82/6.37     !!A B. bnd_axiom (bnd_implies A (bnd_or B A));
% 6.82/6.37     !!A. bnd_axiom (bnd_implies (bnd_or A A) A) |]
% 6.82/6.37  ==> True
% 6.82/6.37  Adding axioms...
% 6.82/6.38  Typedef.type_definition_def
% 8.52/8.04   ...done.
% 8.52/8.05  Ground types: ?'b, TPTP_Interpret.ind
% 8.52/8.05  Translating term (sizes: 1, 1) ...
% 9.52/9.10  Invoking SAT solver...
% 9.52/9.10  No model exists.
% 9.52/9.10  Translating term (sizes: 2, 1) ...
% 11.54/11.02  Invoking SAT solver...
% 11.54/11.02  No model exists.
% 11.54/11.02  Translating term (sizes: 1, 2) ...
% 15.13/14.65  Invoking SAT solver...
% 15.13/14.65  No model exists.
% 15.13/14.65  Translating term (sizes: 3, 1) ...
% 19.43/18.95  Invoking SAT solver...
% 19.43/18.95  No model exists.
% 19.43/18.95  Translating term (sizes: 2, 2) ...
% 30.87/30.31  Invoking SAT solver...
% 30.87/30.31  No model exists.
% 30.87/30.31  Translating term (sizes: 1, 3) ...
% 39.49/38.95  Invoking SAT solver...
% 39.49/38.95  No model exists.
% 39.49/38.95  Translating term (sizes: 4, 1) ...
% 50.92/50.37  Invoking SAT solver...
% 50.92/50.37  No model exists.
% 50.92/50.37  Translating term (sizes: 3, 2) ...
% 142.63/141.79  Invoking SAT solver...
% 142.63/141.79  No model exists.
% 142.63/141.79  Translating term (sizes: 2, 3) ...
% 192.22/191.10  Invoking SAT solver...
% 192.22/191.10  No model exists.
% 192.22/191.10  Translating term (sizes: 1, 4) ...
% 209.53/208.29  Invoking SAT solver...
% 209.53/208.29  No model exists.
% 209.53/208.29  Translating term (sizes: 5, 1) ...
% 240.79/239.30  Invoking SAT solver...
% 240.79/239.30  No model exists.
% 240.79/239.30  Translating term (sizes: 4, 2) ...
% 300.11/298.02  /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 22779 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.11/298.02       22780                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.11/298.03  /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 22725 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.11/298.03       22726 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.$"
%------------------------------------------------------------------------------