TSTP Solution File: LCL116-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL116-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/LCL116-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(6,40,0,12,0,0)
%
%
% START OF PROOF
% 7 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 8 [] is_a_theorem(implies(X,implies(Y,X))).
% 9 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 10 [] is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))).
% 11 [] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 12 [] -is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))).
% 14 [hyper:7,8,8] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 28 [hyper:7,9,8] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 31 [hyper:7,9,9] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 38 [hyper:7,28,11] is_a_theorem(implies(not(X),implies(X,Y))).
% 48 [hyper:7,38,9] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 63 [hyper:7,10,14] is_a_theorem(implies(implies(implies(X,implies(Y,X)),Z),Z)).
% 68 [hyper:7,10,28] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 74 [hyper:7,68,9] is_a_theorem(implies(implies(implies(implies(X,Y),Y),Z),implies(X,Z))).
% 93 [hyper:7,48,11] is_a_theorem(implies(not(not(X)),implies(Y,X))).
% 109 [hyper:7,93,9] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(not(Y)),Z))).
% 168 [hyper:7,31,31] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 285 [hyper:7,74,31] is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 441 [hyper:7,109,63] is_a_theorem(implies(not(not(X)),X)).
% 449 [hyper:7,441,11] is_a_theorem(implies(X,not(not(X)))).
% 450 [hyper:7,441,9] is_a_theorem(implies(implies(X,Y),implies(not(not(X)),Y))).
% 734 [hyper:7,285,11] is_a_theorem(implies(implies(X,implies(not(Y),not(Z))),implies(X,implies(Z,Y)))).
% 757 [hyper:7,285,449] is_a_theorem(implies(implies(X,Y),implies(X,not(not(Y))))).
% 1053 [hyper:7,168,68] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 2024 [hyper:7,734,450] is_a_theorem(implies(implies(X,not(Y)),implies(Y,not(X)))).
% 2051 [hyper:7,2024,285] is_a_theorem(implies(implies(X,implies(Y,not(Z))),implies(X,implies(Z,not(Y))))).
% 3856 [hyper:7,2051,757] is_a_theorem(implies(implies(X,Y),implies(not(Y),not(X)))).
% 3928 [hyper:7,3856,1053] is_a_theorem(implies(not(X),implies(implies(Y,X),not(Y)))).
% 3982 [hyper:7,3928,2051,slowcut:12] 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: 714
% derived clauses: 147982
% kept clauses: 2497
% kept size sum: 38338
% kept mid-nuclei: 1452
% kept new demods: 0
% forw unit-subs: 39657
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 38
% fast unit cutoff: 0
% full unit cutoff: 18
% dbl unit cutoff: 0
% real runtime : 1.13
% process. runtime: 1.12
% 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/LCL116-1+noeq.in")
%
%------------------------------------------------------------------------------