TSTP Solution File: LCL131-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL131-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 0.0s
% Output : Assurance 0.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/LCL131-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)
%
%
% START OF PROOF
% 4 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 5 [] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(U,Z)),equivalent(Y,U))),X)).
% 6 [] -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 9 [hyper:4,5,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z)),equivalent(equivalent(equivalent(U,V),equivalent(W,V)),equivalent(U,W)))).
% 13 [hyper:4,9,5] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))).
% 16 [hyper:4,13,9] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(equivalent(X,U),equivalent(Z,U)))).
% 18 [hyper:4,13,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U),equivalent(equivalent(X,Z),U))).
% 25 [hyper:4,16,13] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))).
% 29 [hyper:4,25,13] is_a_theorem(equivalent(X,X)).
% 34 [hyper:4,18,5] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),equivalent(X,equivalent(Y,U)))).
% 35 [hyper:4,18,16] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))).
% 44 [hyper:4,35,35] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(X,U),equivalent(Y,U)),Z))).
% 61 [hyper:4,34,18] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(U,Z)),equivalent(X,U))).
% 66 [hyper:4,34,35] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),V),equivalent(equivalent(X,equivalent(Y,U)),V))).
% 118 [hyper:4,61,34] is_a_theorem(equivalent(X,equivalent(X,equivalent(Y,Y)))).
% 142 [hyper:4,118,16] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Z,Z)),Y))).
% 168 [hyper:4,142,29] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)).
% 203 [hyper:4,168,44] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Z),Y)),X)).
% 1102 [hyper:4,66,203] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),X)).
% 1124 [hyper:4,1102,16] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),U),equivalent(X,U))).
% 5965 [hyper:4,1124,5,slowcut:6] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation 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 6
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 299
% derived clauses: 78421
% kept clauses: 5224
% kept size sum: 119004
% kept mid-nuclei: 732
% kept new demods: 0
% forw unit-subs: 51507
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 3
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.81
% process. runtime: 1.80
% 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/LCL131-1+noeq.in")
%
%------------------------------------------------------------------------------