↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL144-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 : art01.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/LCL144-1+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 3)
% (binary-unit 9 #f 4 3)
% (binary-double 9 #f 4 3)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 3)
% (binary-order 25 #f 4 3)
% (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)
% 
% 
% SOS clause 
% ordered(x,implies(y,z)) | ordered(y,implies(x,z)).
% was split for some strategies as: 
% ordered(x,implies(y,z)).
% ordered(y,implies(x,z)).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(11,40,0,22,0,0,13873,4,901)
% 
% 
% START OF PROOF
% 13 [] equal(implies(truth,X),X).
% 14 [] equal(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),truth).
% 15 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 17 [] equal(big_^v(X,Y),implies(implies(X,Y),Y)).
% 19 [] equal(implies(X,Y),truth) | -ordered(X,Y).
% 20 [] -equal(implies(X,Y),truth) | ordered(X,Y).
% 21 [] ordered(x,implies(y,z)) | ordered(y,implies(x,z)).
% 22 [] -ordered(x,implies(y,z)) | -ordered(y,implies(x,z)).
% 27 [hyper:19,21] equal(implies(x,implies(y,z)),truth) | ordered(y,implies(x,z)).
% 28 [hyper:19,21] equal(implies(y,implies(x,z)),truth) | ordered(x,implies(y,z)).
% 29 [para:13.1.1,17.1.2.1] equal(big_^v(truth,X),implies(X,X)).
% 30 [para:17.1.2,17.1.2.1] equal(big_^v(implies(X,Y),Y),implies(big_^v(X,Y),Y)).
% 35 [hyper:20,14] ordered(implies(X,Y),implies(implies(Y,Z),implies(X,Z))).
% 36 [para:13.1.1,14.1.1.1,demod:17,13] equal(implies(X,big_^v(X,Y)),truth).
% 38 [para:14.1.1,17.1.2.1,demod:13] equal(big_^v(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),implies(implies(Y,Z),implies(X,Z))).
% 39 [para:17.1.2,14.1.1.2.1] equal(implies(implies(X,implies(Y,Z)),implies(big_^v(Y,Z),implies(X,Z))),truth).
% 51 [para:29.1.1,36.1.1.2,demod:13] equal(implies(X,X),truth).
% 52 [para:36.1.1,14.1.1.1,demod:13] equal(implies(implies(big_^v(X,Y),Z),implies(X,Z)),truth).
% 57 [para:13.1.1,15.1.1.1,demod:17,51] equal(truth,big_^v(X,truth)).
% 58 [para:15.1.1,17.1.2,demod:17] equal(big_^v(X,Y),big_^v(Y,X)).
% 60 [para:17.1.2,15.1.1.1,demod:17] equal(implies(big_^v(X,Y),Y),big_^v(Y,implies(X,Y))).
% 66 [para:57.1.2,36.1.1.2] equal(implies(X,truth),truth).
% 70 [para:66.1.1,14.1.1.1,demod:13] equal(implies(X,implies(Y,X)),truth).
% 78 [para:70.1.1,17.1.2.1,demod:13,60] equal(implies(big_^v(X,Y),Y),implies(X,Y)).
% 113 [para:36.1.1,35.1.2.1,demod:13] ordered(implies(X,Y),implies(X,big_^v(Y,Z))).
% 132 [para:36.1.1,113.1.1] ordered(truth,implies(X,big_^v(big_^v(X,Y),Z))).
% 167 [hyper:19,132,demod:13] equal(implies(X,big_^v(big_^v(X,Y),Z)),truth).
% 195 [hyper:20,167] ordered(X,big_^v(big_^v(X,Y),Z)).
% 200 [para:58.1.1,195.1.2.1] ordered(X,big_^v(big_^v(Y,X),Z)).
% 212 [para:30.1.1,200.1.2.1,demod:78] ordered(X,big_^v(implies(Y,X),Z)).
% 216 [para:38.1.1,212.1.2] ordered(X,implies(implies(X,Y),implies(Z,Y))).
% 220 [para:15.1.1,216.1.2.2,demod:17] ordered(X,implies(implies(X,Y),big_^v(Y,Z))).
% 233 [para:39.1.1,220.1.2.1,demod:13] ordered(implies(X,implies(Y,Z)),big_^v(implies(big_^v(Y,Z),implies(X,Z)),U)).
% 266 [para:52.1.1,17.1.2.1,demod:13] equal(big_^v(implies(big_^v(X,Y),Z),implies(X,Z)),implies(X,Z)).
% 3635 [para:266.1.1,233.1.2] ordered(implies(X,implies(Y,Z)),implies(Y,implies(X,Z))).
% 11814 [hyper:19,3635] equal(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z))),truth).
% 13876 [binary:28.2,22] equal(implies(y,implies(x,z)),truth) | -ordered(y,implies(x,z)).
% 13878 [binary:20.2,22] -equal(implies(x,implies(y,z)),truth) | -ordered(y,implies(x,z)).
% 14317 [para:13876.1.1,11814.1.1.1,demod:13,binarycut:13878] -ordered(y,implies(x,z)).
% 14319 [binary:27.2,14317] equal(implies(x,implies(y,z)),truth).
% 14321 [binary:20.2,14317] -equal(implies(y,implies(x,z)),truth).
% 14549 [para:14319.1.1,11814.1.1.1,demod:13,cut:14321] 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 3
% clause depth limited to 4
% seconds given: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1995
%  derived clauses:   626253
%  kept clauses:      14460
%  kept size sum:     198125
%  kept mid-nuclei:   44
%  kept new demods:   1979
%  forw unit-subs:    444094
%  forw double-subs: 2804
%  forw overdouble-subs: 2
%  backward subs:     423
%  fast unit cutoff:  18
%  full unit cutoff:  0
%  dbl  unit cutoff:  4
%  real runtime  :  9.78
%  process. runtime:  9.78
% specific non-discr-tree subsumption statistics: 
%  tried:           4
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  2
%  by-lit fails:    0
%  full subs tried: 2
%  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/LCL144-1+eq_r.in")
% 
%------------------------------------------------------------------------------