TSTP Solution File: LCL096-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL096-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 : art10.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/LCL096-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(5,40,1,10,0,1)
%
%
% 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(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)).
% 9 [] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),U),equivalent(equivalent(equivalent(X,V),Z),equivalent(equivalent(Y,V),U)))).
% 10 [] -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)).
% 17 [hyper:6,8,7] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))).
% 18 [hyper:6,8,8] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,Y),equivalent(equivalent(X,U),Z)))).
% 21 [hyper:6,17,7] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z))).
% 25 [hyper:6,9,7] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),V),equivalent(equivalent(equivalent(Y,Z),U),V))).
% 26 [hyper:6,9,8] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),V),W),equivalent(equivalent(equivalent(equivalent(Y,Z),U),V),W))).
% 33 [hyper:6,21,17] is_a_theorem(equivalent(X,X)).
% 34 [hyper:6,21,9] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Y),X))).
% 62 [hyper:6,18,21] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(equivalent(Y,U),X),equivalent(U,Z)))).
% 63 [hyper:6,18,33] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Z,Y)))).
% 259 [hyper:6,62,34] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,X),Y),Z),equivalent(Y,Z))).
% 293 [hyper:6,259,63] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,Z)),equivalent(Y,X)))).
% 321 [hyper:6,26,7] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Y)),Z),Z)).
% 397 [hyper:6,293,21] is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(Y,equivalent(Z,Z)),X)))).
% 456 [hyper:6,321,25] is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Y)).
% 468 [hyper:6,456,63] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Y),Z)),equivalent(X,Z))).
% 544 [hyper:6,397,62] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(equivalent(X,equivalent(U,U)),Z)))).
% 611 [hyper:6,468,21] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Y)),equivalent(X,Z)),Z)).
% 757 [hyper:6,611,25] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,X),Z)),Z)).
% 837 [hyper:6,757,63] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,Y),U))),equivalent(X,U))).
% 14447 [hyper:6,837,544,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 7
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 302
% derived clauses: 109839
% kept clauses: 13471
% kept size sum: 324120
% kept mid-nuclei: 963
% kept new demods: 0
% forw unit-subs: 78966
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 5.83
% process. runtime: 5.81
% 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/LCL096-1+noeq.in")
%
%------------------------------------------------------------------------------