TSTP Solution File: LCL129-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL129-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 : art03.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/LCL129-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,0,6,0,0,21416,4,2179,21416,50,2184,21416,40,2184,21419,0,2184)
%
%
% START OF PROOF
% 11903 [?] ?
% 21417 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 21418 [] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,equivalent(U,Z)),equivalent(Y,U)))).
% 21419 [] -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 21421 [binary:21417,21418] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(U,Y))) | -is_a_theorem(equivalent(X,equivalent(U,Z))).
% 21422 [binary:21417.2,21418] -is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,equivalent(U,Z)),equivalent(Y,U))),V)) | is_a_theorem(V).
% 21424 [binary:21418,21421.2] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(U,equivalent(Y,V))),equivalent(equivalent(X,equivalent(V,Z)),U))).
% 21426 [binary:21417,21424] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(U,equivalent(Y,V)))) | is_a_theorem(equivalent(equivalent(X,equivalent(V,Z)),U)).
% 21429 [binary:21422,21424] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(Y,Z)))).
% 21430 [binary:21417.2,21429] -is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(Y,Z))),U)) | is_a_theorem(U).
% 21433 [binary:21424,21430] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)).
% 21434 [binary:21417,21433] -is_a_theorem(equivalent(X,equivalent(Y,Y))) | is_a_theorem(X).
% 21436 [binary:21421.2,21433] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Z)),equivalent(U,Y)),equivalent(X,U))).
% 21439 [binary:21433,21434] is_a_theorem(equivalent(equivalent(X,X),equivalent(Y,Y))).
% 21444 [binary:21433,21426] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),X)).
% 21446 [binary:21421.2,21439] is_a_theorem(equivalent(equivalent(equivalent(X,X),equivalent(Y,Z)),equivalent(Z,Y))).
% 21473 [binary:21422,21446] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))).
% 21496 [binary:21417,21473] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Y))) | -is_a_theorem(equivalent(X,Z)).
% 21514 [binary:21422,21436] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)))).
% 21526 [binary:21444,21496.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),U),equivalent(X,U))).
% 21586 [binary:21417,21514] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y))) | -is_a_theorem(X).
% 21667 [binary:21473,21586.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z))),equivalent(U,V)),equivalent(V,U))).
% 22032 [binary:21417,21526] -is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),U)) | is_a_theorem(equivalent(X,U)).
% 22781 [binary:21422,21667] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,U),equivalent(Z,equivalent(U,Y))))).
% 23523 [binary:21419,22032.2] -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(X,Y)),equivalent(Y,X)),equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 25143 [binary:21417,22781] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,U)))) | -is_a_theorem(equivalent(equivalent(X,U),Z)).
% 28183 [binary:23523,25143,cut:11903] 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: 1758
% derived clauses: 895216
% kept clauses: 25812
% kept size sum: 644188
% kept mid-nuclei: 2098
% kept new demods: 0
% forw unit-subs: 531927
% forw double-subs: 47
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 24.58
% process. runtime: 24.57
% 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/LCL129-1+noeq.in")
%
%------------------------------------------------------------------------------