↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL160-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 : 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 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/LCL160-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 5 1)
% (binary-posweight-lex-big-order 30 #f 5 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 *********
% 
% 
% timer checkpoints: c(18,40,0,36,0,0)
% 
% 
% START OF PROOF
% 20 [] equal(implies(truth,X),X).
% 21 [] equal(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),truth).
% 22 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 23 [] equal(implies(implies(not(X),not(Y)),implies(Y,X)),truth).
% 24 [] equal(or(X,Y),implies(not(X),Y)).
% 26 [] equal(or(X,Y),or(Y,X)).
% 27 [] equal(and(X,Y),not(or(not(X),not(Y)))).
% 29 [] equal(and(X,Y),and(Y,X)).
% 30 [] equal(xor(X,Y),or(and(X,not(Y)),and(not(X),Y))).
% 35 [] equal(not(truth),falsehood).
% 36 [] -equal(and(xor(and(xor(truth,x),y),truth),y),and(xor(and(xor(truth,y),x),truth),x)).
% 38 [para:29.1.1,36.1.1.1.1] -equal(and(xor(and(y,xor(truth,x)),truth),y),and(xor(and(xor(truth,y),x),truth),x)).
% 45 [para:35.1.1,24.1.2.1] equal(or(truth,X),implies(falsehood,X)).
% 53 [para:20.1.1,21.1.1.1,demod:20] equal(implies(X,implies(implies(X,Y),Y)),truth).
% 60 [para:45.1.1,26.1.1] equal(implies(falsehood,X),or(X,truth)).
% 61 [para:53.1.1,20.1.1,demod:20] equal(truth,implies(X,X)).
% 65 [para:61.1.2,24.1.2] equal(or(X,not(X)),truth).
% 67 [para:65.1.1,26.1.1] equal(truth,or(not(X),X)).
% 68 [para:20.1.1,22.1.1.1,demod:61] equal(truth,implies(implies(X,truth),truth)).
% 69 [para:24.1.2,22.1.1.1] equal(implies(or(X,Y),Y),implies(implies(Y,not(X)),not(X))).
% 83 [para:68.1.2,53.1.1.2] equal(implies(X,truth),truth).
% 84 [para:83.1.1,24.1.2,demod:60] equal(implies(falsehood,X),truth).
% 85 [para:83.1.1,21.1.1.1,demod:20] equal(implies(X,implies(Y,X)),truth).
% 86 [para:29.1.1,38.1.2] -equal(and(xor(and(y,xor(truth,x)),truth),y),and(x,xor(and(xor(truth,y),x),truth))).
% 93 [para:84.1.1,22.1.1.1,demod:20] equal(X,implies(implies(X,falsehood),falsehood)).
% 94 [para:35.1.1,23.1.1.1.2,demod:20,24] equal(implies(or(X,falsehood),X),truth).
% 95 [para:24.1.2,23.1.1.1] equal(implies(or(X,not(Y)),implies(Y,X)),truth).
% 102 [para:24.1.2,85.1.1.2] equal(implies(X,or(Y,X)),truth).
% 106 [para:26.1.1,102.1.1.2] equal(implies(X,or(X,Y)),truth).
% 115 [para:24.1.2,93.1.2.1] equal(not(X),implies(or(X,falsehood),falsehood)).
% 123 [para:94.1.1,22.1.1.1,demod:106,20] equal(X,or(X,falsehood)).
% 124 [para:67.1.2,94.1.1.1,demod:20] equal(not(falsehood),truth).
% 132 [para:124.1.1,24.1.2.1,demod:20] equal(or(falsehood,X),X).
% 139 [para:35.1.1,27.1.2.1.1,demod:132] equal(and(truth,X),not(not(X))).
% 146 [para:124.1.1,27.1.2.1.1,demod:35,84,45] equal(and(falsehood,X),falsehood).
% 147 [para:124.1.1,27.1.2.1.2,demod:35,84,60] equal(and(X,falsehood),falsehood).
% 238 [para:26.1.1,115.1.2.1,demod:132] equal(not(X),implies(X,falsehood)).
% 240 [para:115.1.2,21.1.1.2.1,demod:24,238,123] equal(implies(implies(X,Y),or(Y,not(X))),truth).
% 241 [para:238.1.2,24.1.2,demod:139,123] equal(X,and(truth,X)).
% 242 [para:241.1.2,29.1.1] equal(X,and(X,truth)).
% 243 [para:241.1.2,30.1.2.1,demod:123,146,35] equal(xor(truth,X),not(X)).
% 244 [para:242.1.2,30.1.2.2,demod:132,147,35] equal(xor(X,truth),not(X)).
% 352 [para:95.1.1,22.1.1.1,demod:240,20] equal(implies(X,Y),or(Y,not(X))).
% 377 [para:352.1.2,27.1.2.1] equal(and(X,Y),not(implies(Y,not(X)))).
% 385 [para:24.1.2,377.1.2.1,demod:352] equal(and(X,not(Y)),not(implies(X,Y))).
% 397 [para:139.1.2,377.1.2.1.2,demod:241] equal(and(not(X),Y),not(implies(Y,X))).
% 627 [para:69.1.1,377.1.2.1,demod:377,24,352] equal(and(X,implies(X,Y)),and(Y,implies(Y,X))).
% 820 [para:29.1.1,86.1.1,demod:397,241,139,244,385,243,cut:627] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 5
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    194
%  derived clauses:   12284
%  kept clauses:      783
%  kept size sum:     10545
%  kept mid-nuclei:   0
%  kept new demods:   653
%  forw unit-subs:    10624
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     10
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.18
%  process. runtime:  0.16
% 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/LCL/LCL160-1+eq_r.in")
% 
%------------------------------------------------------------------------------