TSTP Solution File: SYN094-1.005 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN094-1.005 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SYN/SYN094-1.005+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 1 7)
% (binary-unit 10 #f 1 7)
% (binary-double 16 #f 1 7)
% (binary 54 #t 1 7)
% (binary-order 27 #f 1 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% SOS clause
% u_1(0) | -p_0(0) | -q_0(0).
% was split for some strategies as:
% u_1(0).
% -p_0(0).
% -q_0(0).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(82,40,0,164,0,0)
%
%
% START OF PROOF
% 83 [] -u_1(0).
% 84 [] -p_2(0) | -p_1(0) | p_0(0) | u_2(0).
% 85 [] -u_2(0) | p_0(0).
% 88 [] -p_3(0) | -p_2(0) | u_4(0) | p_1(0).
% 89 [] -u_4(0) | p_1(0).
% 92 [] -p_4(0) | -p_3(0) | u_6(0) | p_2(0).
% 93 [] -u_6(0) | p_2(0).
% 96 [] -p_5(0) | -p_4(0) | u_8(0) | p_3(0).
% 97 [] -u_8(0) | p_3(0).
% 100 [] -p_6(0) | -p_5(0) | u_10(0) | p_4(0).
% 101 [] -u_10(0) | p_4(0).
% 104 [] -p_7(0) | -p_6(0) | u_12(0) | p_5(0).
% 105 [] -u_12(0) | p_5(0).
% 108 [] -p_8(0) | -p_7(0) | u_14(0) | p_6(0).
% 109 [] -u_14(0) | p_6(0).
% 112 [] -p_9(0) | -p_8(0) | u_16(0) | p_7(0).
% 113 [] -u_16(0) | p_7(0).
% 116 [] -q_2(0) | -p_1(0) | q_0(0) | u_18(0).
% 117 [] -u_18(0) | q_0(0).
% 124 [] -q_4(0) | -p_3(0) | u_22(0) | q_2(0).
% 125 [] -u_22(0) | q_2(0).
% 132 [] -q_6(0) | -p_5(0) | u_26(0) | q_4(0).
% 133 [] -u_26(0) | q_4(0).
% 140 [] -q_8(0) | -p_7(0) | u_30(0) | q_6(0).
% 141 [] -u_30(0) | q_6(0).
% 156 [?] ?
% 157 [] -u_38(0) | p_8(0).
% 158 [?] ?
% 159 [] -u_39(0) | p_9(0).
% 160 [?] ?
% 161 [] -u_40(0) | q_8(0).
% 164 [] -q_0(0) | -p_0(0) | u_1(0).
% 210 [input:156,binarycut:157] p_8(0).
% 223 [input:158,binarycut:159] p_9(0).
% 226 [hyper:112,223,210,binarycut:113] p_7(0).
% 231 [hyper:108,226,210,binarycut:109] p_6(0).
% 236 [hyper:104,231,cut:226,binarycut:105] p_5(0).
% 241 [hyper:100,236,cut:231,binarycut:101] p_4(0).
% 247 [hyper:96,236,cut:241,binarycut:97] p_3(0).
% 249 [hyper:92,241,cut:247,binarycut:93] p_2(0).
% 255 [hyper:88,247,cut:249,binarycut:89] p_1(0).
% 259 [hyper:84,249,cut:255,binarycut:85] p_0(0).
% 268 [input:160,binarycut:161] q_8(0).
% 270 [hyper:140,268,cut:226,binarycut:141] q_6(0).
% 274 [hyper:132,270,cut:236,binarycut:133] q_4(0).
% 279 [hyper:124,274,cut:247,binarycut:125] q_2(0).
% 287 [hyper:116,279,cut:255,binarycut:117] q_0(0).
% 292 [hyper:164,287,cut:259] u_1(0).
% 293 [hyper:83,292] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 1
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 74
% derived clauses: 106
% kept clauses: 21
% kept size sum: 42
% kept mid-nuclei: 30
% kept new demods: 0
% forw unit-subs: 2
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 125
% fast unit cutoff: 17
% full unit cutoff: 0
% dbl unit cutoff: 25
% real runtime: 0.0
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SYN/SYN094-1.005+noeq.in")
%
%------------------------------------------------------------------------------