TSTP Solution File: COL080-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL080-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 : 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 30.0s
% Output : Assurance 30.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/COL/COL080-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,0,26,0,0,4021,4,2255,4028,50,2264,4028,40,2264,4041,0,2264,22737,3,2869,25085,4,3174)
%
%
% START OF PROOF
% 4030 [] equal(apply(k(X),Y),X).
% 4035 [] equal(apply(apply(apply(abstraction,X),Y),Z),apply(apply(X,k(Z)),apply(Y,Z))).
% 4038 [] -equal(apply(X,n(X,Y)),apply(Y,n(X,Y))) | equal(X,Y).
% 4041 [] -equal(k(b),apply(abstraction,apply(abstraction,k(b)))).
% 4094 [para:4030.1.1,4035.1.2.1] equal(apply(apply(apply(abstraction,k(X)),Y),Z),apply(X,apply(Y,Z))).
% 4162 [para:4030.1.1,4038.1.1] -equal(X,apply(Y,n(k(X),Y))) | equal(k(X),Y).
% 4462 [para:4030.1.1,4162.1.2] equal(k(X),k(Y)) | -equal(X,Y).
% 4572 [para:4462.1.1,4030.1.1.1,demod:4030] -equal(X,Y) | equal(Y,X).
% 4608 [binary:4041,4572.2] -equal(apply(abstraction,apply(abstraction,k(b))),k(b)).
% 4710 [binary:4038.2,4608,demod:4030] -equal(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b).
% 7765 [para:4094.1.1,4035.1.2,demod:4030] equal(apply(apply(apply(abstraction,apply(abstraction,k(X))),Y),Z),apply(X,Z)).
% 25160 [binary:7765,4038,slowcut:4710] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1935
% derived clauses: 1134803
% kept clauses: 24793
% kept size sum: 594581
% kept mid-nuclei: 73
% kept new demods: 8455
% forw unit-subs: 285236
% forw double-subs: 4766
% forw overdouble-subs: 0
% backward subs: 445
% fast unit cutoff: 82
% full unit cutoff: 32
% dbl unit cutoff: 2
% real runtime : 31.81
% process. runtime: 31.80
% 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/COL/COL080-1+eq_r.in")
%
%------------------------------------------------------------------------------