TSTP Solution File: COL041-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL041-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 : art05.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 79.5s
% Output : Assurance 79.5s
% 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/COL041-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 4 1)
% (binary-posweight-lex-big-order 30 #f 4 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(5,40,1,10,0,1,325,50,553,330,0,553,6232,3,3266,7405,4,4608,8080,5,5954,8080,1,5954,8080,50,5954,8080,40,5954,8085,0,5954,9014,3,7463,9014,4,8225,9014,50,8377,9014,40,8377,9019,0,8377)
%
%
% START OF PROOF
% 9016 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 9017 [] equal(apply(m,X),apply(X,X)).
% 9018 [] equal(apply(apply(apply(c,X),Y),Z),apply(apply(X,Z),Y)).
% 9019 [] -equal(apply(X,f(X)),apply(f(X),apply(X,f(X)))).
% 9020 [para:9016.1.1,9019.1.1,demod:9016] -equal(apply(X,apply(Y,f(apply(apply(b,X),Y)))),apply(f(apply(apply(b,X),Y)),apply(X,apply(Y,f(apply(apply(b,X),Y)))))).
% 9027 [para:9017.1.1,9020.1.1] -equal(apply(apply(X,f(apply(apply(b,m),X))),apply(X,f(apply(apply(b,m),X)))),apply(f(apply(apply(b,m),X)),apply(m,apply(X,f(apply(apply(b,m),X)))))).
% 9185 [para:9018.1.1,9027.1.1.2,demod:9018,slowcut:9016] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1589
% derived clauses: 3475004
% kept clauses: 9157
% kept size sum: 280255
% kept mid-nuclei: 0
% kept new demods: 969
% forw unit-subs: 841320
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 714
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 84.34
% process. runtime: 83.77
% 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/COL041-1+eq_r.in")
%
%------------------------------------------------------------------------------