TSTP Solution File: SYN353-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN353-1 : TPTP v3.4.2. Released v1.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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/SYN353-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 7)
% (binary-unit 10 #f 2 7)
% (binary-double 16 #f 2 7)
% (binary 54 #t 2 7)
% (binary-order 27 #f 2 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(17,40,1,34,0,1)
%
%
% START OF PROOF
% 22 [] f(z(X,Y,Z),Y,X) | -f(Y,Z,X) | -f(Z,X,Y).
% 23 [] -f(z(X,Y,Z),Y,X) | f(X,Y,Z) | f(Y,Z,X).
% 24 [] -f(z(X,Y,Z),Y,X) | f(X,Y,Z) | f(Z,X,Y).
% 26 [] f(X,z(X,Y,Z),Y) | f(Y,Z,X).
% 27 [] -f(X,z(X,Y,Z),Y) | -f(Y,Z,X) | f(Z,X,Y).
% 28 [] -f(X,z(X,Y,Z),Y) | -f(Y,Z,X) | f(X,Y,Z).
% 29 [] f(X,Y,z(Y,X,Z)) | -f(X,Z,Y) | -f(Y,X,Z).
% 30 [] f(X,Y,z(Y,X,Z)) | f(Z,Y,X).
% 31 [] -f(X,Y,z(Y,X,Z)) | -f(Z,Y,X) | f(X,Z,Y).
% 32 [] -f(X,Y,z(Y,X,Z)) | -f(Z,Y,X) | f(Y,X,Z).
% 33 [] -f(a,a,z(X,Y,Z)) | -f(X,Y,Z) | f(Y,Z,X) | f(Z,X,Y).
% 34 [] -f(z(X,Y,Z),z(X,Y,Z),z(X,Y,Z)) | -f(Z,X,Y) | -f(X,Y,Z) | -f(Y,Z,X).
% 59 [hyper:22,30,26] f(z(X,Y,Z),Y,X) | f(X,z(X,Y,Z),Y) | f(Y,X,z(X,Y,Z)).
% 67 [hyper:29,30,30,factor] f(X,X,z(X,X,X)).
% 71 [hyper:33,30,30] f(z(a,a,X),a,a) | f(a,z(a,a,X),a) | f(X,a,a).
% 273 [hyper:22,71,26] f(z(a,a,X),a,a) | f(a,z(a,a,X),a).
% 274 [hyper:24,71] f(a,z(a,a,X),a) | f(a,a,X) | f(X,a,a).
% 296 [hyper:27,274,273] f(a,a,z(a,a,X)) | f(z(a,a,X),a,a).
% 314 [hyper:23,296] f(a,a,z(a,a,X)) | f(a,a,X) | f(a,X,a).
% 347 [hyper:31,314,273] f(a,a,z(a,a,X)) | f(a,z(a,a,X),a).
% 360 [hyper:28,347,314] f(a,a,z(a,a,X)) | f(a,a,X).
% 386 [hyper:32,360,296] f(a,a,z(a,a,X)).
% 399 [?] ?
% 402 [hyper:31,386,273] f(a,z(a,a,X),a).
% 414 [hyper:27,402,402] f(z(a,a,X),a,a).
% 418 [hyper:23,414] f(a,a,X) | f(a,X,a).
% 436 [hyper:27,418,binarycut:399] f(a,X,a).
% 437 [hyper:28,418,cut:402] f(a,a,X).
% 446 [hyper:27,436,cut:436] f(X,a,a).
% 458 [hyper:33,437,26] f(X,z(X,Y,Z),Y) | f(X,Y,Z) | f(Z,X,Y).
% 467 [hyper:33,437,59] f(X,z(X,Y,Z),Y) | f(Y,X,z(X,Y,Z)).
% 511 [hyper:32,458,467] f(X,z(X,Y,Z),Y) | f(X,Y,Z).
% 540 [hyper:28,511,67] f(z(X,X,X),X,X).
% 548 [hyper:23,540] f(X,X,X).
% 550 [hyper:34,548,436,cut:446,cut:437] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 68
% derived clauses: 9367
% kept clauses: 158
% kept size sum: 2702
% kept mid-nuclei: 295
% kept new demods: 0
% forw unit-subs: 1191
% forw double-subs: 1758
% forw overdouble-subs: 353
% backward subs: 89
% fast unit cutoff: 37
% full unit cutoff: 0
% dbl unit cutoff: 8
% real runtime: 0.10
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 1220
% length fails: 189
% strength fails: 5
% predlist fails: 59
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 967
% full subs fail: 614
%
% ; 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/SYN353-1+noeq.in")
%
%------------------------------------------------------------------------------