TSTP Solution File: FLD034-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD034-1 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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 39.5s
% Output : Assurance 39.5s
% 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/FLD/FLD034-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 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 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(31,40,0,62,0,0,655242,4,2026,655516,50,2057,655516,40,2057,655547,0,2057,699690,3,2558,707653,4,2808,720380,5,3058,720380,1,3058,720380,50,3062,720380,40,3062,720411,0,3062,778047,3,3863,787307,4,4263,813482,5,4671,813483,1,4671,813483,50,4675,813483,40,4675,813514,0,4675)
%
%
% START OF PROOF
% 813489 [] equalish(multiply(multiplicative_identity,X),X) | -defined(X).
% 813506 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 813508 [] equalish(multiply(X,Y),multiply(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 813511 [] defined(a).
% 813513 [] equalish(m,multiplicative_identity).
% 813514 [] -equalish(multiply(m,a),a).
% 813542 [binary:813508.3,813511] equalish(multiply(X,a),multiply(Y,a)) | -equalish(X,Y).
% 813613 [binary:813506.3,813514] -equalish(multiply(m,a),X) | -equalish(X,a).
% 815229 [binary:813513,813542.2] equalish(multiply(m,a),multiply(multiplicative_identity,a)).
% 818815 [binary:813489,813613.2,cut:815229,cut:813511] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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 7
% clause depth limited to 3
% seconds given: 54
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5478
% derived clauses: 2297624
% kept clauses: 201537
% kept size sum: 59537
% kept mid-nuclei: 37898
% kept new demods: 0
% forw unit-subs: 52954
% forw double-subs: 187947
% forw overdouble-subs: 13904
% backward subs: 28
% fast unit cutoff: 3753
% full unit cutoff: 0
% dbl unit cutoff: 98
% real runtime : 47.65
% process. runtime: 47.9
% specific non-discr-tree subsumption statistics:
% tried: 137501
% length fails: 16
% strength fails: 3455
% predlist fails: 41344
% aux str. fails: 8
% by-lit fails: 216
% full subs tried: 76933
% full subs fail: 72882
%
% ; 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/FLD/FLD034-1+noeq.in")
%
%------------------------------------------------------------------------------