TSTP Solution File: LCL115-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL115-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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/LCL/LCL115-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 4 5)
% (binary-unit 11 #f 4 5)
% (binary-double 17 #f 4 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 4 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(6,40,0,12,0,0,57,50,0,63,0,0)
%
%
% START OF PROOF
% 58 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 59 [] is_a_theorem(implies(X,implies(Y,X))).
% 60 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 61 [] is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))).
% 62 [] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 63 [] -is_a_theorem(implies(not(implies(a,b)),not(b))).
% 65 [hyper:58,59,59] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 79 [hyper:58,60,59] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 81 [hyper:58,60,62] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(not(Y),not(X)),Z))).
% 89 [hyper:58,79,62] is_a_theorem(implies(not(X),implies(X,Y))).
% 99 [hyper:58,89,60] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 114 [hyper:58,61,65] is_a_theorem(implies(implies(implies(X,implies(Y,X)),Z),Z)).
% 144 [hyper:58,99,62] is_a_theorem(implies(not(not(X)),implies(Y,X))).
% 145 [hyper:58,99,79] is_a_theorem(implies(not(implies(X,Y)),implies(Y,Z))).
% 160 [hyper:58,144,60] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(not(Y)),Z))).
% 174 [hyper:58,145,60] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(implies(U,X)),Z))).
% 188 [hyper:58,81,59] is_a_theorem(implies(implies(not(X),not(Y)),implies(Z,implies(Y,X)))).
% 492 [hyper:58,160,114] is_a_theorem(implies(not(not(X)),X)).
% 500 [hyper:58,492,62] is_a_theorem(implies(X,not(not(X)))).
% 518 [hyper:58,500,160] is_a_theorem(implies(not(not(X)),not(not(implies(Y,X))))).
% 613 [hyper:58,188,518] is_a_theorem(implies(X,implies(not(implies(Y,Z)),not(Z)))).
% 619 [hyper:58,188,174] is_a_theorem(implies(not(implies(X,not(Y))),implies(Z,implies(U,Y)))).
% 623 [hyper:58,613,slowcut:63,slowcut:619] 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 5
% clause depth limited to 5
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 141
% derived clauses: 7103
% kept clauses: 302
% kept size sum: 3610
% kept mid-nuclei: 288
% kept new demods: 0
% forw unit-subs: 3020
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 0
% full unit cutoff: 11
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.4
% 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/LCL/LCL115-1+noeq.in")
%
%------------------------------------------------------------------------------