TSTP Solution File: LCL130-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL130-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 : art07.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/LCL130-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 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,1,23311,4,2181,23311,50,2186,23311,40,2186,23314,0,2186)
%
%
% START OF PROOF
% 23312 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 23313 [] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))),X)).
% 23314 [] -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 23316 [binary:23312,23313] -is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U))))) | is_a_theorem(X).
% 23319 [binary:23313,23316,binarydemod:23316] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))).
% 23320 [binary:23312,23319] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Y))) | -is_a_theorem(equivalent(X,Z)).
% 23321 [binary:23312.2,23319] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z))),U)) | is_a_theorem(U).
% 23323 [binary:23319,23320.2] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(X,U),equivalent(Y,U)),Z))).
% 23325 [binary:23312,23323] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U)) | -is_a_theorem(equivalent(equivalent(X,Z),U)).
% 23327 [binary:23316,23323] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(X,Z),U),equivalent(equivalent(Y,Z),U)))).
% 23329 [binary:23321,23323] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(equivalent(X,U),equivalent(Z,U)))).
% 23332 [binary:23312,23327] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,Y),Z))) | -is_a_theorem(equivalent(X,U)).
% 23336 [binary:23312,23329] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Y))) | is_a_theorem(equivalent(equivalent(X,U),equivalent(Z,U))).
% 23346 [binary:23329,23336] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,Y),Z))).
% 23347 [binary:23312.2,23346] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,Y),Z)),U)) | is_a_theorem(U).
% 23348 [binary:23325.2,23346] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(U,Z)),equivalent(equivalent(X,Y),U))).
% 23354 [binary:23347,23348] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))).
% 23356 [binary:23312.2,23354] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,Y)),Z)) | is_a_theorem(Z).
% 23357 [binary:23325.2,23354] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))).
% 23360 [binary:23312.2,23357] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z)),U)) | is_a_theorem(U).
% 23361 [binary:23320.2,23357] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U),equivalent(equivalent(X,Z),U))).
% 23363 [binary:23332.2,23357] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U),V),equivalent(equivalent(equivalent(X,Z),U),V))).
% 23364 [binary:23356,23357] is_a_theorem(equivalent(X,X)).
% 23365 [binary:23312.2,23364] -is_a_theorem(equivalent(equivalent(X,X),Y)) | is_a_theorem(Y).
% 23374 [binary:23312,23361] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U)) | is_a_theorem(equivalent(equivalent(X,Z),U)).
% 23391 [binary:23313,23374] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(equivalent(Y,U),equivalent(Z,U))))).
% 23393 [binary:23361,23374] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,U),equivalent(Z,equivalent(U,Y))))).
% 23409 [binary:23312,23393] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,U)))) | -is_a_theorem(equivalent(equivalent(X,U),Z)).
% 23467 [binary:23360,23363] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,U))),equivalent(equivalent(X,U),Z))).
% 23469 [binary:23312,23467] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,U)))) | is_a_theorem(equivalent(equivalent(X,U),Z)).
% 23479 [binary:23391,23469] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)).
% 23480 [binary:23312,23479] -is_a_theorem(equivalent(X,equivalent(Y,Y))) | is_a_theorem(X).
% 23493 [binary:23479,23480] is_a_theorem(equivalent(equivalent(X,X),equivalent(Y,Y))).
% 23498 [binary:23409.2,23493] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Z),equivalent(Y,X)))).
% 23581 [binary:23312,23498,binarydemod:23365] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)).
% 23599 [binary:23313,23581,slowcut:23314] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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 6
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 953
% derived clauses: 589684
% kept clauses: 21617
% kept size sum: 566248
% kept mid-nuclei: 1941
% kept new demods: 0
% forw unit-subs: 341070
% forw double-subs: 6
% forw overdouble-subs: 0
% backward subs: 16
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 21.89
% process. runtime: 21.87
% 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/LCL130-1+noeq.in")
%
%------------------------------------------------------------------------------