TSTP Solution File: SWW103+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : SWW103+1 : TPTP v6.4.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n159.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 : Thu Apr 14 06:07:16 EDT 2016
% Result : Timeout 300.05s
% 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 : SWW103+1 : TPTP v6.4.0. Released v5.2.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.23 % Computer : n159.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 01:09:24 CDT 2016
% 0.02/0.23 % CPUTime :
% 6.31/5.86 > val it = (): unit
% 6.61/6.11 Trying to find a model that refutes: True
% 7.61/7.15 Unfolded term: [| ALL P. bnd_not2 P = bnd_impl P bnd_false2; bnd_not1 bnd_true = bnd_false;
% 7.61/7.15 bnd_not1 bnd_false = bnd_true;
% 7.61/7.15 ALL A. ~ bnd_bool A --> bnd_not1 A = bnd_phi A;
% 7.61/7.15 EX P. bnd_false2 = bnd_phi (bnd_f7 P) &
% 7.61/7.15 ~ (EX P1. bnd_forallprefers (bnd_f7 P1) (bnd_f7 P));
% 7.61/7.15 ALL P. bnd_f7 P = bnd_lazy_impl (bnd_prop P) P; bnd_false1 = bnd_false;
% 7.61/7.15 ALL P.
% 7.61/7.15 EX R. bnd_exists2 P = bnd_phi (bnd_f6 P R) &
% 7.61/7.15 ~ (EX R1. bnd_forallprefers (bnd_f6 P R1) (bnd_f6 P R));
% 7.61/7.15 ALL P R.
% 7.61/7.15 bnd_f6 P R = bnd_lazy_impl (bnd_prop R) (bnd_impl (bnd_f5 P R) R);
% 7.61/7.15 ALL P R.
% 7.61/7.15 EX X. bnd_f5 P R = bnd_phi (bnd_f4 P X R) &
% 7.61/7.15 ~ (EX X1. bnd_forallprefers (bnd_f4 P X1 R) (bnd_f4 P X R));
% 7.61/7.15 ALL P X R. bnd_f4 P X R = bnd_impl (bnd_apply P X) R;
% 7.61/7.15 ALL P.
% 7.61/7.15 EX X. bnd_exists1 P = bnd_phi (bnd_apply P X) &
% 7.61/7.15 ~ (EX X1. bnd_existsprefers (bnd_apply P X1) (bnd_apply P X));
% 7.61/7.15 ALL P Q.
% 7.61/7.15 EX R. bnd_or2 P Q = bnd_phi (bnd_f3 P Q R) &
% 7.61/7.15 ~ (EX R1. bnd_forallprefers (bnd_f3 P Q R1) (bnd_f3 P Q R));
% 7.61/7.15 ALL P Q R.
% 7.61/7.15 bnd_f3 P Q R =
% 7.61/7.15 bnd_lazy_impl (bnd_prop R)
% 7.61/7.15 (bnd_impl (bnd_impl P R) (bnd_impl (bnd_impl Q R) R));
% 7.61/7.15 ALL B. bnd_bool B --> bnd_or1 bnd_false B = B;
% 7.61/7.15 ALL B. bnd_bool B --> bnd_or1 bnd_true B = bnd_true;
% 7.61/7.15 ALL A B. bnd_bool A & ~ bnd_bool B --> bnd_or1 A B = bnd_phi B;
% 7.61/7.15 ALL A B. ~ bnd_bool A --> bnd_or1 A B = bnd_phi A;
% 7.61/7.15 ALL P Q.
% 7.61/7.15 EX R. bnd_lazy_and2 P Q = bnd_phi (bnd_f2 P Q R) &
% 7.61/7.15 ~ (EX R1. bnd_forallprefers (bnd_f2 P Q R1) (bnd_f2 P Q R));
% 7.61/7.15 ALL P Q R.
% 7.61/7.15 bnd_f2 P Q R =
% 7.61/7.15 bnd_lazy_impl (bnd_prop R)
% 7.61/7.15 (bnd_impl (bnd_lazy_impl P (bnd_impl Q R)) R);
% 7.61/7.15 ALL B. bnd_lazy_and1 bnd_true B = bnd_phi B;
% 7.61/7.15 ALL B. bnd_lazy_and1 bnd_false B = bnd_false;
% 7.61/7.15 ALL A B. ~ bnd_bool A --> bnd_lazy_and1 A B = bnd_phi A;
% 7.61/7.15 ALL P Q.
% 7.61/7.15 EX R. bnd_and2 P Q = bnd_phi (bnd_f1 P Q R) &
% 7.61/7.15 ~ (EX R1. bnd_forallprefers (bnd_f1 P Q R1) (bnd_f1 P Q R));
% 7.61/7.15 ALL P Q R.
% 7.61/7.15 bnd_f1 P Q R =
% 7.61/7.15 bnd_lazy_impl (bnd_prop R) (bnd_impl (bnd_impl P (bnd_impl Q R)) R);
% 7.61/7.15 ALL B. bnd_bool B --> bnd_and1 bnd_true B = B;
% 7.61/7.15 ALL B. bnd_bool B --> bnd_and1 bnd_false B = bnd_false;
% 7.61/7.15 ALL A B. bnd_bool A & ~ bnd_bool B --> bnd_and1 A B = bnd_phi B;
% 7.61/7.15 ALL A B. ~ bnd_bool A --> bnd_and1 A B = bnd_phi A;
% 7.61/7.15 ALL B. bnd_lazy_impl bnd_true B = bnd_phi B;
% 7.61/7.15 ALL B. bnd_lazy_impl bnd_false B = bnd_true;
% 7.61/7.15 ALL A B. ~ bnd_bool A --> bnd_lazy_impl A B = bnd_phi A;
% 7.61/7.15 ALL B. bnd_bool B --> bnd_impl bnd_true B = B;
% 7.61/7.15 ALL B. bnd_bool B --> bnd_impl bnd_false B = bnd_true;
% 7.61/7.15 ALL A B. bnd_bool A & ~ bnd_bool B --> bnd_impl A B = bnd_phi B;
% 7.61/7.15 ALL A B. ~ bnd_bool A --> bnd_impl A B = bnd_phi A;
% 7.61/7.15 ALL X. (bnd_prop X = bnd_false) = (~ bnd_bool X);
% 7.61/7.15 ALL X. (bnd_prop X = bnd_true) = bnd_bool X;
% 7.61/7.15 ALL X. bnd_d X & bnd_phi X = X | ~ bnd_d X & bnd_phi X = bnd_err;
% 7.61/7.15 ALL X Y.
% 7.61/7.15 bnd_existsprefers X Y =
% 7.61/7.15 ((~ bnd_d X & bnd_d Y |
% 7.61/7.15 ((bnd_d X & bnd_d Y) & ~ bnd_bool X) & bnd_bool Y) |
% 7.61/7.15 X = bnd_true & Y = bnd_false);
% 7.61/7.15 ALL X Y.
% 7.61/7.15 bnd_forallprefers X Y =
% 7.61/7.15 ((~ bnd_d X & bnd_d Y |
% 7.61/7.15 ((bnd_d X & bnd_d Y) & ~ bnd_bool X) & bnd_bool Y) |
% 7.61/7.15 X = bnd_false & Y = bnd_true);
% 7.61/7.15 (bnd_d bnd_true & bnd_d bnd_false) & bnd_d bnd_err;
% 7.61/7.15 (~ bnd_true = bnd_false & ~ bnd_true = bnd_err) & ~ bnd_false = bnd_err;
% 7.61/7.15 ALL X. bnd_bool X = (X = bnd_false | X = bnd_true) |]
% 7.61/7.15 ==> True
% 7.61/7.15 Adding axioms...
% 7.61/7.16 Typedef.type_definition_def
% 13.63/13.18 ...done.
% 13.63/13.19 Ground types: ?'b, TPTP_Interpret.ind
% 13.63/13.19 Translating term (sizes: 1, 1) ...
% 17.21/16.71 Invoking SAT solver...
% 17.21/16.71 No model exists.
% 17.21/16.71 Translating term (sizes: 2, 1) ...
% 21.43/20.92 Invoking SAT solver...
% 21.43/20.92 No model exists.
% 21.43/20.92 Translating term (sizes: 1, 2) ...
% 35.35/34.88 Invoking SAT solver...
% 35.35/34.88 No model exists.
% 35.35/34.88 Translating term (sizes: 3, 1) ...
% 42.06/41.50 Invoking SAT solver...
% 42.06/41.50 No model exists.
% 42.06/41.50 Translating term (sizes: 2, 2) ...
% 63.72/63.15 Invoking SAT solver...
% 63.72/63.15 No model exists.
% 63.72/63.15 Translating term (sizes: 1, 3) ...
% 106.17/105.42 Invoking SAT solver...
% 106.17/105.42 No model exists.
% 106.17/105.42 Translating term (sizes: 4, 1) ...
% 120.03/119.25 Invoking SAT solver...
% 120.03/119.25 No model exists.
% 120.03/119.25 Translating term (sizes: 3, 2) ...
% 221.97/220.65 Invoking SAT solver...
% 221.97/220.65 No model exists.
% 221.97/220.65 Translating term (sizes: 2, 3) ...
% 300.05/298.03 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 54950 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.05/298.03 54951 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.05/298.04 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 54896 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.05/298.04 54897 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.$"
%------------------------------------------------------------------------------