TSTP Solution File: LCL118-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL118-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/LCL118-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 4 5)
% (binary-unit 11 #f 4 5)
% (binary-double 17 #f 4 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 4 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,1,9,50,1,12,0,1,20,50,1,23,0,1)
%
%
% START OF PROOF
% 21 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 22 [] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,equivalent(Y,X)))).
% 23 [] -is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))).
% 26 [hyper:21,22,22] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,equivalent(X,Z))))).
% 31 [hyper:21,26,22] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,U)),equivalent(equivalent(U,equivalent(Z,Y)),X)))).
% 32 [hyper:21,26,26] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,equivalent(U,Y))),equivalent(equivalent(U,Z),X)))).
% 37 [hyper:21,31,22] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(Z,equivalent(Y,X)),equivalent(equivalent(U,equivalent(V,W)),equivalent(W,equivalent(V,U)))))).
% 40 [hyper:21,32,22] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,X))),equivalent(equivalent(Z,Y),equivalent(equivalent(U,equivalent(V,W)),equivalent(W,equivalent(V,U)))))).
% 43 [hyper:21,37,22] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,equivalent(X,Z)))),equivalent(equivalent(U,equivalent(V,W)),equivalent(W,equivalent(V,U))))).
% 49 [hyper:21,40,26] is_a_theorem(equivalent(equivalent(X,X),equivalent(equivalent(Y,equivalent(Z,U)),equivalent(U,equivalent(Z,Y))))).
% 50 [hyper:21,40,40] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z)),equivalent(equivalent(U,equivalent(V,W)),equivalent(W,equivalent(V,U))))).
% 53 [hyper:21,49,22] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(Z,equivalent(Y,X)),equivalent(U,U)))).
% 59 [hyper:21,53,22] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,equivalent(X,Z)))),equivalent(U,U))).
% 70 [hyper:21,59,cut:26] is_a_theorem(equivalent(X,X)).
% 72 [hyper:21,70,22] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,X)))).
% 78 [hyper:21,72,70] is_a_theorem(equivalent(X,equivalent(X,equivalent(Y,Y)))).
% 91 [hyper:21,78,26] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,Z)),equivalent(Y,X)))).
% 149 [hyper:21,91,22] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Z,Z)),Y))).
% 316 [hyper:21,149,70] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)).
% 349 [hyper:21,316,50] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))).
% 563 [hyper:21,349,43] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))).
% 852 [hyper:21,563,22,slowcut:23] 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: 76
% derived clauses: 4901
% kept clauses: 653
% kept size sum: 12356
% kept mid-nuclei: 182
% kept new demods: 0
% forw unit-subs: 2202
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 1
% 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/LCL118-1+noeq.in")
%
%------------------------------------------------------------------------------