↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL090-3 : TPTP v3.4.2. Released v2.7.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 19.5s
% Output   : Assurance 19.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/COL090-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 4 9)
% (binary-unit 9 #f 4 9)
% (binary-double 9 #f 4 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 9)
% (binary-order 25 #f 4 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(25,40,0,50,0,0,5676,4,1888)
% 
% 
% START OF PROOF
% 26 [] equal(X,X).
% 27 [] -equal(comb^k,comb^s).
% 28 [] -equal(comb^k,comb_app(X,Y)).
% 29 [] -equal(comb^s,comb_app(X,Y)).
% 30 [] -equal(comb_app(X,Y),comb_app(Z,U)) | equal(X,Z).
% 31 [] -equal(comb_app(X,Y),comb_app(Z,U)) | equal(Y,U).
% 33 [] -member(pair(comb_app(X,Y),Z),contract) | ap_contract^e_c4(X,Y,Z) | ap_contract^e_c3(X,Y,Z) | ap_contract^e_c2(X,Y,Z) | ap_contract^e_c1(X,Y,Z).
% 36 [] equal(X,comb_app(comb^k,Y)) | -ap_contract^e_c1(X,Z,Y).
% 41 [] equal(X,comb_app(comb_app(comb^s,ap_contract^e_sk1p(X,Y,Z)),ap_contract^e_sk1q(X,Y,Z))) | -ap_contract^e_c2(X,Y,Z).
% 42 [] member(pair(X,ap_contract^e_sk2q(X,Y,Z)),contract) | -ap_contract^e_c3(X,Y,Z).
% 44 [] equal(X,comb_app(ap_contract^e_sk2q(Y,Z,X),Z)) | -ap_contract^e_c3(Y,Z,X).
% 45 [] member(pair(X,ap_contract^e_sk3q(Y,X,Z)),contract) | -ap_contract^e_c4(Y,X,Z).
% 48 [] -member(pair(comb^k,X),contract).
% 49 [] -member(pair(comb^s,X),contract).
% 50 [] member(pair(comb_app(comb_app(comb^s,comb^k),comb^k),r),contract).
% 53 [hyper:33,50] ap_contract^e_c4(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c3(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c1(comb_app(comb^s,comb^k),comb^k,r).
% 66 [hyper:45,53,cut:48] ap_contract^e_c3(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c1(comb_app(comb^s,comb^k),comb^k,r).
% 79 [hyper:36,66] equal(comb_app(comb^s,comb^k),comb_app(comb^k,r)) | ap_contract^e_c3(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r).
% 105 [hyper:30,79] ap_contract^e_c3(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r) | equal(comb^s,comb^k).
% 106 [hyper:31,79] ap_contract^e_c3(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r) | equal(comb^k,r).
% 143 [hyper:42,106] member(pair(comb_app(comb^s,comb^k),ap_contract^e_sk2q(comb_app(comb^s,comb^k),comb^k,r)),contract) | ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r) | equal(comb^k,r).
% 556 [hyper:33,143] ap_contract^e_c4(comb^s,comb^k,ap_contract^e_sk2q(comb_app(comb^s,comb^k),comb^k,r)) | ap_contract^e_c3(comb^s,comb^k,ap_contract^e_sk2q(comb_app(comb^s,comb^k),comb^k,r)) | ap_contract^e_c2(comb^s,comb^k,ap_contract^e_sk2q(comb_app(comb^s,comb^k),comb^k,r)) | ap_contract^e_c1(comb^s,comb^k,ap_contract^e_sk2q(comb_app(comb^s,comb^k),comb^k,r)) | ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r) | equal(comb^k,r).
% 5700 [para:105.3.2,27.1.1,cut:26] ap_contract^e_c3(comb_app(comb^s,comb^k),comb^k,r) | ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r).
% 5870 [binary:41,29] -ap_contract^e_c2(comb^s,X,Y).
% 5877 [binary:36,29] -ap_contract^e_c1(comb^s,X,Y).
% 5878 [binary:30.2,29] -equal(comb_app(comb^s,X),comb_app(comb_app(Y,Z),U)).
% 6070 [binary:42,49] -ap_contract^e_c3(comb^s,X,Y).
% 6104 [binary:45,48] -ap_contract^e_c4(X,comb^k,Y).
% 6117 [binary:556.2,6070,cut:6104,cut:5870,cut:5877] ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r) | equal(comb^k,r).
% 6439 [binary:44,28] -ap_contract^e_c3(X,Y,comb^k).
% 10974 [para:6117.2.2,5700.1.3,cut:6439] ap_contract^e_c2(comb_app(comb^s,comb^k),comb^k,r).
% 20030 [para:41.1.2,5878.1.2] -equal(comb_app(comb^s,X),Y) | -ap_contract^e_c2(Y,Z,U).
% 20032 [binary:26,20030,slowcut:10974] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 4
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    248
%  derived clauses:   226236
%  kept clauses:      14990
%  kept size sum:     428041
%  kept mid-nuclei:   512
%  kept new demods:   0
%  forw unit-subs:    142534
%  forw double-subs: 19321
%  forw overdouble-subs: 24222
%  backward subs:     162
%  fast unit cutoff:  11895
%  full unit cutoff:  60
%  dbl  unit cutoff:  4231
%  real runtime  :  22.30
%  process. runtime:  21.82
% specific non-discr-tree subsumption statistics: 
%  tried:           27987326
%  length fails:    1585581
%  strength fails:  642748
%  predlist fails:  18880
%  aux str. fails:  1864597
%  by-lit fails:    13635261
%  full subs tried: 10230449
%  full subs fail:  10211997
% 
% ; 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/COL090-3+eq_r.in")
% 
%------------------------------------------------------------------------------