TSTP Solution File: LCL102-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL102-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 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/LCL102-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(5,40,0,10,0,0)
%
%
% START OF PROOF
% 6 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 7 [] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)).
% 8 [] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,Y),X)))).
% 9 [] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Z,Y)))).
% 10 [] -is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))).
% 17 [hyper:6,9,8] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,equivalent(equivalent(Z,U),equivalent(equivalent(U,Z),Y))))).
% 18 [hyper:6,9,9] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(equivalent(U,Y),equivalent(U,Z))))).
% 25 [hyper:6,7,9] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(Y,U))),equivalent(X,equivalent(Z,U)))).
% 44 [hyper:6,25,17] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),U),equivalent(Z,equivalent(equivalent(Y,X),U)))).
% 45 [hyper:6,25,18] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,U)),equivalent(Z,equivalent(X,U)))).
% 197 [hyper:6,45,7] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(U,X),equivalent(U,Y)),Z))).
% 657 [hyper:6,197,25] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U)),equivalent(equivalent(Z,Y),U))).
% 1868 [hyper:6,657,44,slowcut:10] 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: 116
% derived clauses: 15226
% kept clauses: 1519
% kept size sum: 33060
% kept mid-nuclei: 336
% kept new demods: 0
% forw unit-subs: 9221
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.22
% process. runtime: 0.21
% 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/LCL102-1+noeq.in")
%
%------------------------------------------------------------------------------