TSTP Solution File: COL078-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL078-1 : TPTP v3.4.2. Released v1.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.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 396.8s
% Output : Assurance 396.8s
% 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/COL/COL078-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 4 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 4 3)
% (binary-posweight-lex-big-order 30 #f 4 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(13,40,1,26,0,1,4017,4,2254,4024,50,2263,4024,40,2263,4037,0,2263,22701,3,2865,24910,4,3176,28639,5,3464,28640,5,3465,28640,1,3465,28640,50,3466,28640,40,3466,28653,0,3466,53439,3,4067,61581,4,4368,68598,5,4667,68598,1,4667,68598,50,4670,68598,40,4670,68611,0,4670,147962,3,7698,151507,4,9172,151832,5,10671,151833,1,10671,151833,50,10676,151833,40,10676,151846,0,10676,181010,3,12178,181781,4,12928,182236,5,13677,182237,5,13677,182237,1,13677,182237,50,13679,182237,40,13679,182250,0,13679,245616,3,15181,250075,4,15933,253976,1,16680,253976,50,16683,253976,40,16683,253989,0,16683,733406,3,24517,853664,4,28384,876060,5,32285,876061,1,32287,876061,50,32292,876061,40,32292,876074,0,32292,986358,3,37393,1063791,4,39965)
%
%
% START OF PROOF
% 876062 [] equal(X,X).
% 876063 [] equal(apply(k(X),Y),X).
% 876068 [] equal(apply(apply(apply(abstraction,X),Y),Z),apply(apply(X,k(Z)),apply(Y,Z))).
% 876071 [] -equal(apply(X,n(X,Y)),apply(Y,n(X,Y))) | equal(X,Y).
% 876073 [] equal(apply(identity,X),X).
% 876074 [] -equal(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),k(k(identity))).
% 876124 [para:876073.1.1,876068.1.2.1,demod:876063] equal(apply(apply(apply(abstraction,identity),X),Y),Y).
% 876126 [para:876063.1.1,876068.1.2.1] equal(apply(apply(apply(abstraction,k(X)),Y),Z),apply(X,apply(Y,Z))).
% 876129 [para:876068.1.1,876074.1.1] -equal(apply(apply(abstraction,k(abstraction)),apply(abstraction,abstraction)),k(k(identity))).
% 876150 [para:876068.1.2,876068.1.1.1,demod:876063] equal(apply(apply(apply(apply(abstraction,abstraction),X),Y),Z),apply(Y,apply(apply(X,Y),Z))).
% 876185 [para:876073.1.1,876071.1.1] -equal(n(identity,X),apply(X,n(identity,X))) | equal(identity,X).
% 876186 [para:876073.1.1,876071.1.2] -equal(apply(X,n(X,identity)),n(X,identity)) | equal(X,identity).
% 876187 [para:876063.1.1,876071.1.1] -equal(X,apply(Y,n(k(X),Y))) | equal(k(X),Y).
% 876188 [para:876063.1.1,876071.1.2] -equal(apply(X,n(X,k(Y))),Y) | equal(X,k(Y)).
% 884626 [para:876124.1.1,876185.1.2,cut:876062] equal(identity,apply(apply(abstraction,identity),X)).
% 884820 [binary:876187,884626] equal(k(identity),apply(abstraction,identity)).
% 884843 [para:884820.1.1,876129.1.2.1] -equal(apply(apply(abstraction,k(abstraction)),apply(abstraction,abstraction)),k(apply(abstraction,identity))).
% 896842 [para:876150.1.1,876068.1.2,demod:876063] equal(apply(apply(apply(abstraction,apply(apply(abstraction,abstraction),X)),Y),Z),Z).
% 994145 [binary:876186,896842] equal(apply(apply(abstraction,apply(apply(abstraction,abstraction),X)),Y),identity).
% 994199 [binary:876188,994145,demod:884820] equal(apply(abstraction,apply(apply(abstraction,abstraction),X)),apply(abstraction,identity)).
% 1063993 [binary:884843,876071.2,demod:876063,994199,876126,cut:876062] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 102
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13720
% derived clauses: 5302389
% kept clauses: 328653
% kept size sum: 0
% kept mid-nuclei: 27426
% kept new demods: 80533
% forw unit-subs: 2252252
% forw double-subs: 263868
% forw overdouble-subs: 45638
% backward subs: 3353
% fast unit cutoff: 28426
% full unit cutoff: 308
% dbl unit cutoff: 3
% real runtime : 403.51
% process. runtime: 399.83
% specific non-discr-tree subsumption statistics:
% tried: 426729
% length fails: 60555
% strength fails: 1518
% predlist fails: 15165
% aux str. fails: 29854
% by-lit fails: 572
% full subs tried: 312372
% full subs fail: 269344
%
% ; 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/COL/COL078-1+eq_r.in")
%
%------------------------------------------------------------------------------