TSTP Solution File: SYN699-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN699-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 20.0s
% Output : Assurance 20.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/SYN699-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 6 9)
% (binary-unit 10 #f 6 9)
% (binary-double 16 #f 6 9)
% (binary 54 #t 6 9)
% (binary-order 27 #f 6 9)
% (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(74,40,1,148,0,1,1110303,4,2047,1110425,50,2135,1110425,40,2135,1110499,0,2135)
%
%
% START OF PROOF
% 1110437 [] p2(f11(X,Y),f11(Z,U)) | -p3(X,Z) | -p10(Y,U).
% 1110442 [] p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)).
% 1110455 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 1110466 [] p3(f4(X),f4(Y)) | -p2(X,Y).
% 1110479 [] p2(c44,c46).
% 1110485 [] p2(X,X).
% 1110490 [] p10(X,X).
% 1110497 [] -p2(f11(f4(c46),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)).
% 1110645 [binary:1110479,1110466.2] p3(f4(c44),f4(c46)).
% 1110673 [binary:1110490,1110437.3] p2(f11(X,Y),f11(Z,Y)) | -p3(X,Z).
% 1110825 [binary:1110497,1110455.3] -p2(X,f11(f4(f23(c44,f9(f20(c37)))),c43)) | -p2(X,f11(f4(c46),c43)).
% 1110826 [binary:1110485,1110455.2] -p2(X,Y) | p2(Y,X).
% 1110903 [binary:1110826,1110442] p2(f11(f4(c44),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)).
% 1114067 [binary:1110645,1110673.2] p2(f11(f4(c44),X),f11(f4(c46),X)).
% 1124907 [binary:1110825.2,1114067,cut:1110903] 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 9
% clause depth limited to 6
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1390
% derived clauses: 1224768
% kept clauses: 91109
% kept size sum: 205882
% kept mid-nuclei: 14160
% kept new demods: 0
% forw unit-subs: 95689
% forw double-subs: 52
% forw overdouble-subs: 16
% backward subs: 6
% fast unit cutoff: 24
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 22.2
% process. runtime: 22.2
% specific non-discr-tree subsumption statistics:
% tried: 4980
% length fails: 0
% strength fails: 358
% predlist fails: 3780
% aux str. fails: 0
% by-lit fails: 3
% full subs tried: 838
% full subs fail: 823
%
% ; 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/SYN699-1+noeq.in")
%
%------------------------------------------------------------------------------