TSTP Solution File: LCL014-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL014-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 : art04.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 20.0s
% Output : Assurance 20.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/LCL014-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(3,40,0,6,0,0,14,50,0,17,0,0,35,50,0,38,0,0,39888,4,2180)
%
%
% START OF PROOF
% 36 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 37 [] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,equivalent(X,Y)))).
% 38 [] -is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))).
% 41 [hyper:36,37,37] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Y,Z)),Z))).
% 46 [hyper:36,41,37] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(Z,equivalent(X,Y)),U)),U)).
% 49 [hyper:36,41,37] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(Y,equivalent(Z,X))))).
% 53 [hyper:36,49,37] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,equivalent(Y,equivalent(equivalent(Z,equivalent(U,V)),equivalent(V,equivalent(Z,U))))))).
% 55 [hyper:36,49,41] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(Y,equivalent(Z,X))),U)),U)).
% 61 [hyper:36,46,41] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(Z,equivalent(X,Y)),U)),equivalent(U,V)),V)).
% 67 [hyper:36,55,41] is_a_theorem(equivalent(X,equivalent(equivalent(Y,X),Y))).
% 73 [hyper:36,67,67] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Z,Y),Z))),X)).
% 75 [hyper:36,67,37] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Y)))).
% 76 [hyper:36,67,41] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,X),Y),Z)),Z)).
% 88 [hyper:36,75,41] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(X,Y)),Z)),Z)).
% 103 [hyper:36,53,46] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(Z,equivalent(X,Y)),U)),equivalent(U,equivalent(equivalent(V,equivalent(W,X1)),equivalent(X1,equivalent(V,W)))))).
% 114 [hyper:36,73,75] is_a_theorem(equivalent(X,X)).
% 123 [hyper:36,114,41] is_a_theorem(equivalent(equivalent(X,equivalent(X,Y)),Y)).
% 125 [hyper:36,114,67] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)).
% 132 [hyper:36,123,41] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(X,Y)),equivalent(Y,Z)),Z)).
% 144 [hyper:36,125,73] is_a_theorem(equivalent(equivalent(X,X),equivalent(Y,equivalent(equivalent(Z,Y),Z)))).
% 266 [hyper:36,61,114] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Y,equivalent(Z,X)))).
% 471 [hyper:36,144,37] is_a_theorem(equivalent(equivalent(equivalent(X,Y),X),equivalent(equivalent(Z,Z),Y))).
% 1475 [hyper:36,266,37] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Y,equivalent(Z,X)),Z))).
% 2020 [hyper:36,471,76] is_a_theorem(equivalent(equivalent(X,X),equivalent(equivalent(equivalent(Y,Z),Y),Z))).
% 2906 [hyper:36,1475,114] is_a_theorem(equivalent(equivalent(X,equivalent(Y,X)),Y)).
% 3008 [hyper:36,2906,41] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,X)),equivalent(Y,Z)),Z)).
% 3106 [hyper:36,2020,cut:114] is_a_theorem(equivalent(equivalent(equivalent(X,Y),X),Y)).
% 3194 [hyper:36,3106,132] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,X)))).
% 3271 [hyper:36,3194,37] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))).
% 3295 [hyper:36,3194,266] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Y))).
% 3375 [hyper:36,3271,88] is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(Z,equivalent(Y,Z)),X)))).
% 3557 [hyper:36,3295,3271] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),X)).
% 3651 [hyper:36,3557,1475] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(X,Z),Z))),Y)).
% 4410 [hyper:36,3008,3271] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,Y)),equivalent(Z,X)))).
% 8047 [hyper:36,3375,37] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,X)),Z),equivalent(Z,Y))).
% 13791 [hyper:36,3651,3271] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,equivalent(equivalent(Y,Z),Z))))).
% 16179 [hyper:36,4410,37] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,equivalent(Z,equivalent(X,Z))))).
% 20238 [hyper:36,8047,3271] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,equivalent(Y,Z)),X))).
% 28181 [hyper:36,13791,103] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(equivalent(Z,equivalent(X,Y)),U),U)),equivalent(equivalent(V,equivalent(W,X1)),equivalent(X1,equivalent(V,W))))).
% 38252 [hyper:36,20238,16179] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(Z,equivalent(U,Z))),X)),equivalent(U,Y))).
% 39889 [binary:36.3,38] -is_a_theorem(equivalent(X,equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b))))) | -is_a_theorem(X).
% 39952 [binary:38252,39889,slowcut:28181] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 7
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 493
% derived clauses: 265431
% kept clauses: 38162
% kept size sum: 776276
% kept mid-nuclei: 1769
% kept new demods: 0
% forw unit-subs: 131983
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 24.49
% process. runtime: 24.48
% 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/LCL014-1+noeq.in")
%
%------------------------------------------------------------------------------