TSTP Solution File: LCL108-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL108-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 : art06.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/LCL108-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 7 5)
% (binary-unit 11 #f 7 5)
% (binary-double 17 #f 7 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 7 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,0,6,0,0,14,50,0,17,0,0)
%
%
% START OF PROOF
% 15 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 16 [] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,V),equivalent(equivalent(equivalent(W,V),equivalent(W,U)),X1))),equivalent(Z,equivalent(equivalent(Y,X),X1)))).
% 17 [] -is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(b,a),c)),c)).
% 20 [hyper:15,16,16] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,Y),equivalent(Z,X)),U)),equivalent(equivalent(equivalent(V,W),equivalent(equivalent(X1,V),equivalent(X1,W))),U))).
% 26 [hyper:15,20,16] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(equivalent(equivalent(U,equivalent(equivalent(V,W),equivalent(V,X1))),equivalent(U,equivalent(W,X1))),X2)),equivalent(equivalent(Y,Z),X2))).
% 30 [hyper:15,26,16] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(Y,U))),equivalent(X,equivalent(Z,U))),equivalent(equivalent(equivalent(V,W),equivalent(V,X1)),X2)),equivalent(equivalent(W,X1),X2))).
% 34 [hyper:15,30,16] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U))).
% 35 [hyper:15,30,26] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(U,X),equivalent(U,Y)),Z))).
% 49 [hyper:15,34,30] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,U),equivalent(Z,X)),equivalent(U,Y)))).
% 60 [hyper:15,35,30] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(Y,U))),equivalent(X,equivalent(Z,U)))).
% 85 [hyper:15,49,20] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Z,Y))),equivalent(U,U))).
% 97 [hyper:15,60,34] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,U)),equivalent(Z,U))).
% 98 [hyper:15,60,35] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U)),equivalent(equivalent(Z,Y),U))).
% 147 [hyper:15,97,34] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Y),X))).
% 178 [hyper:15,147,85] is_a_theorem(equivalent(X,X)).
% 184 [hyper:15,178,34] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Z,Y)))).
% 758 [hyper:15,98,35] is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Y)).
% 829 [hyper:15,758,184] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Y),Z)),equivalent(X,Z))).
% 938 [hyper:15,829,98,slowcut:17] 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 8
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 50
% derived clauses: 2875
% kept clauses: 766
% kept size sum: 16836
% kept mid-nuclei: 159
% kept new demods: 0
% forw unit-subs: 1823
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.6
% process. runtime: 0.6
% 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/LCL108-1+noeq.in")
%
%------------------------------------------------------------------------------