TSTP Solution File: LCL416-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL416-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art04.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/LCL416-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,0,6,0,0,9,50,0,12,0,1,17,50,1,20,0,1,25,50,1,28,0,1,39,50,1,42,0,1,57,50,1,60,0,1)
%
%
% START OF PROOF
% 58 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 59 [] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z))).
% 60 [] -is_a_theorem(equivalent(a,a)).
% 63 [hyper:58,59,59] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z)),U),equivalent(V,U)),V)).
% 68 [hyper:58,63,59] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z)),U),V),equivalent(U,V))).
% 73 [hyper:58,68,59] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(equivalent(Y,equivalent(equivalent(equivalent(Y,Z),equivalent(U,Z)),U)),X),V),equivalent(W,V)),W))).
% 75 [hyper:58,68,68] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(equivalent(Y,equivalent(equivalent(equivalent(Y,Z),equivalent(U,Z)),U)),V),equivalent(W,V)),W),X))).
% 80 [hyper:58,73,59] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z)),equivalent(U,equivalent(equivalent(equivalent(U,V),equivalent(W,V)),W))),X1),equivalent(X2,X1)),X2)).
% 88 [hyper:58,75,59] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z)),U),equivalent(V,U)),V),equivalent(W,equivalent(equivalent(equivalent(W,X1),equivalent(X2,X1)),X2)))).
% 92 [hyper:58,80,59] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z)),equivalent(U,equivalent(equivalent(equivalent(U,V),equivalent(W,V)),W))),X1),X2),equivalent(X1,X2))).
% 114 [hyper:58,92,63] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(equivalent(Y,Z),equivalent(U,Z)),U))),X)).
% 118 [hyper:58,92,88] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z)),equivalent(U,equivalent(equivalent(equivalent(U,V),equivalent(W,V)),W)))).
% 126 [hyper:58,114,68] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z)),U),equivalent(equivalent(equivalent(U,V),equivalent(W,V)),W))).
% 159 [hyper:58,126,63] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))).
% 170 [hyper:58,159,59] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Y)),Z),equivalent(U,Z)),U)).
% 177 [hyper:58,170,59] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Y)),Z),U),equivalent(Z,U))).
% 197 [hyper:58,177,118] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Y)),Z),equivalent(U,Z)),U),equivalent(V,equivalent(equivalent(equivalent(V,W),equivalent(X1,W)),X1)))).
% 202 [hyper:58,177,73] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),Z)),equivalent(equivalent(equivalent(equivalent(equivalent(U,V),equivalent(U,V)),W),X1),equivalent(W,X1))),X2),equivalent(X3,X2)),X3)).
% 12108 [hyper:58,202,197] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Y)),Z),Z)).
% 12121 [hyper:58,12108,92,slowcut:60] 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 10
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 278
% derived clauses: 57176
% kept clauses: 11308
% kept size sum: 486530
% kept mid-nuclei: 784
% kept new demods: 0
% forw unit-subs: 36603
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 6.96
% process. runtime: 4.91
% 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/LCL416-1+noeq.in")
%
%------------------------------------------------------------------------------