TSTP Solution File: LCL099-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL099-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 : art02.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 149.6s
% Output : Assurance 149.6s
% 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/LCL099-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(4,40,0,8,0,0,40819,4,2183,41002,5,2902,41003,1,2906,41003,50,2910,41003,40,2910,41007,0,2910,47109,3,3473,48474,4,3742,49088,5,4011,49089,5,4012,49090,1,4012,49090,50,4013,49090,40,4013,49094,0,4013,75952,3,4879,83741,4,5302,91847,5,5714,91848,5,5714,91848,1,5714,91848,50,5716,91848,40,5716,91852,0,5716,136856,4,7900,136987,5,8619,136988,1,8625,136988,50,8630,136988,40,8630,136992,0,8630,144208,3,10346,146177,4,11238,147538,5,12031,147540,5,12032,147540,1,12032,147540,50,12033,147540,40,12033,147544,0,12033,176705,3,14060)
%
%
% START OF PROOF
% 147541 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 147542 [] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)).
% 147543 [] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)).
% 147544 [] -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))).
% 147546 [binary:147541,147542] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U)) | is_a_theorem(U).
% 147548 [binary:147541,147543] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V)) | is_a_theorem(V).
% 147550 [binary:147542,147548] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))).
% 147551 [binary:147543,147548] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,Y),equivalent(equivalent(X,U),Z)))).
% 147552 [binary:147546,147550] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z))).
% 147553 [binary:147548,147550] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U))).
% 147554 [binary:147541,147551] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U))) | -is_a_theorem(equivalent(equivalent(Z,Y),U)).
% 147555 [binary:147546,147551] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(equivalent(Y,U),X),equivalent(U,Z)))).
% 147557 [binary:147541,147552] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Z))) | is_a_theorem(equivalent(Y,Z)).
% 147558 [binary:147541,147553] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U)) | is_a_theorem(equivalent(equivalent(Y,Z),U)).
% 147560 [binary:147550,147557] is_a_theorem(equivalent(X,X)).
% 147561 [binary:147551,147557] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Y),X))).
% 147563 [binary:147541,147554] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(equivalent(X,U),Z)) | -is_a_theorem(equivalent(U,Y)).
% 147565 [binary:147546,147554] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(Y,U))),V)) | -is_a_theorem(equivalent(equivalent(X,equivalent(Z,U)),V)).
% 147566 [binary:147548,147554] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),V)),W)) | -is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Z,U),V)),W)).
% 147567 [binary:147541,147555] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,U))) | -is_a_theorem(equivalent(Z,equivalent(X,U))).
% 147568 [binary:147546,147555] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Z,U))),equivalent(Y,U))).
% 147582 [binary:147560,147558] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Z,Y)))).
% 147584 [binary:147561,147558] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Z),equivalent(equivalent(U,X),equivalent(U,Y))))).
% 147592 [binary:147560,147563] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Z))) | -is_a_theorem(equivalent(Y,Z)).
% 147612 [binary:147558,147565] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,U)),V)) | is_a_theorem(equivalent(equivalent(Z,equivalent(X,U)),V)).
% 147616 [binary:147541,147592] -is_a_theorem(equivalent(Z,X)) | -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Z,Y)).
% 147620 [binary:147541,147566] -is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),V))) | -is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Z,U),V)),W)) | is_a_theorem(W).
% 147632 [binary:147563,147567] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,U))) | -is_a_theorem(equivalent(V,equivalent(X,U))) | -is_a_theorem(equivalent(Z,V)).
% 147640 [binary:147563,147568] -is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(Y,U)))) | is_a_theorem(equivalent(equivalent(equivalent(Z,V),X),equivalent(V,U))).
% 147653 [binary:147561,147616] -is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Z)) | is_a_theorem(equivalent(Y,Z)).
% 147658 [binary:147567,147616] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),U)) | -is_a_theorem(equivalent(Z,equivalent(X,V))) | -is_a_theorem(equivalent(equivalent(Y,V),U)).
% 147685 [binary:147582,147653] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,Z)),equivalent(Y,X)))).
% 148216 [binary:147542,147612] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U)),equivalent(equivalent(Z,Y),U))).
% 148442 [binary:147685,147620] -is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,Y),X))),U)) | is_a_theorem(U).
% 149192 [binary:147584,147640] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,U)),equivalent(Z,equivalent(X,U)))).
% 150057 [binary:147544,147658] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,a),c),X),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))) | -is_a_theorem(equivalent(equivalent(equivalent(e,a),falsehood),equivalent(a,X))).
% 179836 [binary:148216,150057] -is_a_theorem(equivalent(equivalent(equivalent(e,a),falsehood),equivalent(a,equivalent(equivalent(equivalent(equivalent(a,b),e),equivalent(b,a)),falsehood)))).
% 180569 [binary:147632,179836] -is_a_theorem(equivalent(X,equivalent(e,equivalent(equivalent(equivalent(equivalent(a,b),e),equivalent(b,a)),falsehood)))) | -is_a_theorem(equivalent(falsehood,X)).
% 181777 [binary:148442,149192] is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(Z,U),equivalent(equivalent(Y,equivalent(U,Z)),X))))).
% 181870 [binary:147552,180569,slowcut:181777] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 40
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2692
% derived clauses: 818450
% kept clauses: 164360
% kept size sum: 0
% kept mid-nuclei: 13395
% kept new demods: 0
% forw unit-subs: 438153
% forw double-subs: 43380
% forw overdouble-subs: 34530
% backward subs: 62
% fast unit cutoff: 6301
% full unit cutoff: 0
% dbl unit cutoff: 2
% real runtime : 150.25
% process. runtime: 149.74
% specific non-discr-tree subsumption statistics:
% tried: 674174
% length fails: 23587
% strength fails: 38927
% predlist fails: 31921
% aux str. fails: 41964
% by-lit fails: 32685
% full subs tried: 468834
% full subs fail: 433898
%
% ; 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/LCL099-1+noeq.in")
%
%------------------------------------------------------------------------------