TSTP Solution File: LCL122-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL122-1 : TPTP v3.4.2. Bugfixed v2.3.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.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 30.0s
% Output : Assurance 30.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/LCL122-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 7 5)
% (binary-unit 11 #f 7 5)
% (binary-double 17 #f 7 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 7 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,1,42262,4,2180,42262,50,2191,42262,40,2191,42265,0,2191,52873,3,2742,56252,4,3103,56414,5,3292,56414,5,3293,56415,1,3294,56415,50,3296,56415,40,3296,56418,0,3296)
%
%
% START OF PROOF
% 42316 [?] ?
% 43174 [?] ?
% 56416 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 56417 [] is_a_theorem(equivalent(X,equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))))).
% 56418 [] -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))).
% 56420 [binary:56416,56417] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U))))) | -is_a_theorem(X).
% 56424 [binary:56416,56420,slowcut:56417] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))).
% 56429 [binary:56416,56424] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Y))) | -is_a_theorem(equivalent(X,Z)).
% 56433 [binary:56416,56429] -is_a_theorem(equivalent(X,Z)) | -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,Z)).
% 56434 [binary:56416,56429,factor] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,Y)).
% 56445 [binary:56416.2,56434.2,factor] -is_a_theorem(equivalent(equivalent(X,X),X)) | is_a_theorem(X).
% 56449 [binary:56429,56434] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))) | -is_a_theorem(equivalent(Z,X)).
% 56451 [binary:56416.3,56445] -is_a_theorem(equivalent(X,equivalent(equivalent(Y,Y),Y))) | -is_a_theorem(X) | is_a_theorem(Y).
% 56460 [binary:56417,56433.2] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))),V)) | -is_a_theorem(equivalent(X,V)).
% 56463 [binary:56424,56433] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z)))) | -is_a_theorem(equivalent(equivalent(Y,U),X)).
% 56468 [binary:56418,56433.3] -is_a_theorem(equivalent(X,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))) | -is_a_theorem(equivalent(X,a)).
% 56469 [binary:56434.2,56433] -is_a_theorem(equivalent(Z,X)) | -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)).
% 56528 [binary:56433,56449,factor] -is_a_theorem(equivalent(equivalent(X,Y),X)) | is_a_theorem(equivalent(X,equivalent(X,Y))).
% 56568 [binary:56429,56469.2,factor] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),equivalent(X,Y))) | -is_a_theorem(equivalent(X,equivalent(X,Y))).
% 56660 [binary:56451,56528.2,cut:42316,binarydemod:56568] -is_a_theorem(equivalent(X,equivalent(X,X))) | is_a_theorem(X).
% 56716 [binary:56469,56660.2,slowcut:56424] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)).
% 56761 [binary:56416,56716.2] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(Y) | is_a_theorem(X).
% 56766 [binary:56424,56716] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))).
% 56767 [binary:56429,56716] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Y))) | -is_a_theorem(equivalent(Z,X)).
% 56770 [binary:56468,56716.2] -is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))),X)) | -is_a_theorem(equivalent(X,a)).
% 56783 [binary:56424,56761] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Y))) | is_a_theorem(equivalent(X,Z)).
% 56831 [binary:56716.2,56770.2] -is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))),X)) | -is_a_theorem(equivalent(a,X)).
% 57107 [binary:56429,56831] -is_a_theorem(equivalent(a,equivalent(X,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))) | -is_a_theorem(equivalent(a,X)).
% 61330 [binary:56766,56460.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(equivalent(U,V),equivalent(equivalent(U,W),equivalent(V,W)))),equivalent(X,Z))).
% 62543 [binary:57107,56463] -is_a_theorem(equivalent(a,equivalent(X,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))) | -is_a_theorem(equivalent(equivalent(X,equivalent(b,equivalent(c,e))),a)).
% 67925 [binary:56463,62543] -is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(c,f),equivalent(e,f))),equivalent(b,equivalent(c,e))),a)) | -is_a_theorem(equivalent(equivalent(X,b),a)).
% 70547 [binary:56416.3,67925,factor:binarydemod:56767,cut:43174] -is_a_theorem(equivalent(equivalent(X,b),a)).
% 70571 [binary:56783.2,70547] -is_a_theorem(equivalent(equivalent(equivalent(X,b),Y),equivalent(a,Y))).
% 71553 [binary:56783.2,70571,slowcut:61330] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 7
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1461
% derived clauses: 467857
% kept clauses: 68902
% kept size sum: 636206
% kept mid-nuclei: 1904
% kept new demods: 0
% forw unit-subs: 278647
% forw double-subs: 5776
% forw overdouble-subs: 5599
% backward subs: 76
% fast unit cutoff: 421
% full unit cutoff: 9
% dbl unit cutoff: 0
% real runtime : 34.97
% process. runtime: 34.96
% specific non-discr-tree subsumption statistics:
% tried: 35555
% length fails: 1555
% strength fails: 2196
% predlist fails: 10271
% aux str. fails: 232
% by-lit fails: 249
% full subs tried: 20031
% full subs fail: 14431
%
% ; 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/LCL122-1+noeq.in")
%
%------------------------------------------------------------------------------