↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN715-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art04.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/SYN/SYN715-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: big
% detected subclass: long
% 
% strategies selected: 
% (hyper 25 #t 9 7)
% (binary-unit 25 #f 9 7)
% (binary-double 25 #f 9 7)
% (binary-posweight-order 25 #f 9 7)
% (binary 50 #t 9 7)
% (hyper 25 #t)
% (hyper 116 #f)
% (binary-posweight-order 76 #f)
% (binary-order 25 #f)
% (binary-weightorder 25 #f)
% (binary-posweight-order-sos 76 #t)
% (binary-unit-sos 40 #t)
% (binary 67 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(106,40,1,212,0,1,213,50,1,319,0,1,320,50,1,426,0,1,427,50,1,533,0,1,534,50,1,640,0,1,641,50,1,747,0,1,748,50,1,854,0,1,855,50,1,961,0,2,962,50,2,1068,0,2,1069,50,2,1175,0,2,1176,50,2,1282,0,2,1283,50,2,1389,0,2,1390,50,2,1496,0,3,1497,50,3,1497,40,3,1603,0,3,1893,50,4,1999,0,4)
% 
% 
% START OF PROOF
% 1894 [] p3(f8(f11(f13(c65,f16(f19(f21(c66,X),Y),Z)),U),V),f16(f19(f21(c66,f33(f35(f37(f39(f41(c74,X),Y),Z),U),V)),f43(f45(f47(f49(f51(c75,X),Y),Z),U),V)),f53(f55(f57(f59(f61(c76,X),Y),Z),U),V))).
% 1898 [] -p63(f24(f26(f30(c73,X),Y),Z),U) | p63(f24(f26(f30(c73,Z),U),X),Y).
% 1899 [] p62(f5(c64,f8(f11(f13(c65,f16(f19(f21(c66,c67),c68),c69)),c70),c71)),c72).
% 1902 [] -p62(f5(c64,f16(f19(f21(c66,X),Y),Z)),U) | p62(X,U).
% 1913 [] p4(f5(X,Y),f5(Z,U)) | -p2(X,Z) | -p3(Y,U).
% 1930 [] p63(f24(f26(f30(c73,f31(c68,c72)),f28(c69,c72)),c70),c71).
% 1932 [] -p62(X,Y) | -p27(Y,Z) | -p4(X,U) | p62(U,Z).
% 1971 [] p2(X,X).
% 1976 [] p27(X,X).
% 1999 [] -p62(f33(f35(f37(f39(f41(c74,X),Y),Z),U),V),W) | -p63(f24(f26(f30(c73,U),V),f31(Y,W)),f28(Z,W)).
% 2131 [binary:1971,1913.2] p4(f5(X,Y),f5(X,Z)) | -p3(Y,Z).
% 2182 [binary:1894,2131.2] p4(f5(X,f8(f11(f13(c65,f16(f19(f21(c66,Y),Z),U)),V),W)),f5(X,f16(f19(f21(c66,f33(f35(f37(f39(f41(c74,Y),Z),U),V),W)),f43(f45(f47(f49(f51(c75,Y),Z),U),V),W)),f53(f55(f57(f59(f61(c76,Y),Z),U),V),W)))).
% 2237 [binary:1976,1932.2] -p62(X,Y) | -p4(X,Z) | p62(Z,Y).
% 2244 [binary:1899,2237] -p4(f5(c64,f8(f11(f13(c65,f16(f19(f21(c66,c67),c68),c69)),c70),c71)),X) | p62(X,c72).
% 2261 [binary:1898,1930] p63(f24(f26(f30(c73,c70),c71),f31(c68,c72)),f28(c69,c72)).
% 2267 [binary:1999.2,2261] -p62(f33(f35(f37(f39(f41(c74,X),c68),c69),c70),c71),c72).
% 2271 [binary:1902.2,2267] -p62(f5(c64,f16(f19(f21(c66,f33(f35(f37(f39(f41(c74,X),c68),c69),c70),c71)),Y),Z)),c72).
% 2298 [binary:2244.2,2271,slowcut:2182] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit 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 7
% clause depth limited to 10
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    445
%  derived clauses:   987
%  kept clauses:      236
%  kept size sum:     3225
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    282
%  forw double-subs: 17
%  forw overdouble-subs: 0
%  backward subs:     2
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.5
%  process. runtime:  0.6
% specific non-discr-tree subsumption statistics: 
%  tried:           23
%  length fails:    0
%  strength fails:  8
%  predlist fails:  15
%  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/SYN/SYN715-1+noeq.in")
% 
%------------------------------------------------------------------------------