TSTP Solution File: SYN039-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN039-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 : art10.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/SYN039-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 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f 2 5)
% (binary 54 #t 2 5)
% (binary-order 27 #f 2 5)
% (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)
%
%
% SOS clause
% -p(X,X) | -q(Y,Y) | -s(Z,Z).
% was split for some strategies as:
% -p(X,X).
% -q(Y,Y).
% -s(Z,Z).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(27,40,0,58,0,0,344,50,3,375,0,3)
%
%
% START OF PROOF
% 342 [?] ?
% 347 [] -q(X,f1(Y,X)) | -q(Z,Z) | s(U,Y).
% 351 [] -s(X,f1(X,Y)) | -s(Y,Y) | s(Z,X).
% 356 [] q(f1(X,Y),Z) | s(f1(X,Y),U) | -p(X,X).
% 359 [] p(f1(X,Y),f1(X,Y)) | -q(Z,Z) | -s(Y,Y).
% 363 [] p(f1(X,Y),f1(X,Y)) | q(f1(X,Y),Z) | s(f1(X,Y),U).
% 366 [] p(f1(X,Y),f1(X,Y)) | -s(X,f1(X,Y)) | q(f1(X,Y),Z).
% 368 [] -q(X,X) | -s(Y,Y) | -p(Z,Z).
% 369 [] -q(X,f1(Y,X)) | -q(Z,Z) | -p(Y,Y).
% 370 [] -s(X,f1(X,Y)) | -s(Y,Y) | -p(X,X).
% 372 [] $spltprd0($spltcnst3) | -p(X,X).
% 373 [] $spltprd0($spltcnst4) | -q(X,X).
% 374 [] $spltprd0($spltcnst5) | -s(X,X).
% 375 [] -$spltprd0($spltcnst4) | -$spltprd0($spltcnst3) | -$spltprd0($spltcnst5).
% 639 [hyper:372,363] $spltprd0($spltcnst3) | q(f1(X,Y),Z) | s(f1(X,Y),U).
% 658 [hyper:347,363,363,factor:factor:factor] p(f1(X,Y),f1(X,Y)) | s(f1(X,Y),Z).
% 724 [hyper:370,639,639,cut:342,factor] $spltprd0($spltcnst3) | q(f1(X,Y),Z).
% 741 [hyper:347,724,724] $spltprd0($spltcnst3) | s(X,Y).
% 754 [hyper:359,741,724] $spltprd0($spltcnst3) | p(f1(X,Y),f1(X,Y)).
% 761 [hyper:368,754,724,741] $spltprd0($spltcnst3).
% 773 [hyper:374,658] $spltprd0($spltcnst5) | p(f1(X,Y),f1(X,Y)).
% 783 [hyper:351,658,658,factor] p(f1(X,Y),f1(X,Y)) | s(Z,f1(X,Y)).
% 924 [hyper:366,783] p(f1(X,Y),f1(X,Y)) | q(f1(X,Y),Z).
% 967 [hyper:373,924] $spltprd0($spltcnst4) | p(f1(X,Y),f1(X,Y)).
% 1001 [hyper:375,967,cut:761,binarycut:773] p(f1(X,Y),f1(X,Y)).
% 1017 [hyper:356,1001] q(f1(f1(X,Y),Z),U) | s(f1(f1(X,Y),Z),V).
% 1038 [hyper:373,1017] $spltprd0($spltcnst4) | s(f1(f1(X,Y),Z),U).
% 1039 [hyper:374,1017] $spltprd0($spltcnst5) | q(f1(f1(X,Y),Z),U).
% 1064 [hyper:370,1038,1038,cut:1001] $spltprd0($spltcnst4).
% 1072 [hyper:369,1039,1039,slowcut:1001] $spltprd0($spltcnst5).
% 1074 [hyper:375,1072,cut:761,cut:1064] 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 5
% clause depth limited to 3
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 105
% derived clauses: 3336
% kept clauses: 301
% kept size sum: 5334
% kept mid-nuclei: 532
% kept new demods: 0
% forw unit-subs: 378
% forw double-subs: 930
% forw overdouble-subs: 248
% backward subs: 138
% fast unit cutoff: 46
% full unit cutoff: 7
% dbl unit cutoff: 8
% real runtime: 0.7
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 5220
% length fails: 282
% strength fails: 687
% predlist fails: 1980
% aux str. fails: 103
% by-lit fails: 29
% full subs tried: 2125
% full subs fail: 1823
%
% ; 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/SYN039-1+noeq.in")
%
%------------------------------------------------------------------------------