TSTP Solution File: FLD025-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD025-2 : 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 : 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 89.5s
% Output : Assurance 89.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/FLD025-2+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(38,40,0,76,0,1,753883,4,2029,753913,50,2059,753913,40,2059,753951,0,2059,785599,3,2560,795963,4,2810,821343,5,3060,821344,5,3060,821344,1,3060,821344,50,3064,821344,40,3064,821382,0,3064,858672,3,3865,861091,4,4265,950489,5,4678,950490,5,4678,950490,1,4678,950490,50,4683,950490,40,4683,950528,0,4683,1041928,3,7385,1058534,4,8734)
%
%
% START OF PROOF
% 950492 [] equalish(add(additive_identity,X),X) | -defined(X).
% 950498 [] equalish(multiply(X,Y),multiply(Y,X)) | -defined(X) | -defined(Y).
% 950512 [] -equalish(X,Y) | equalish(Y,X).
% 950513 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 950515 [] equalish(multiply(X,Y),multiply(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 950519 [] defined(b).
% 950520 [] defined(c).
% 950523 [] defined(v).
% 950524 [] equalish(a,b).
% 950525 [] equalish(c,d).
% 950526 [] equalish(multiply(a,c),u).
% 950527 [] equalish(multiply(d,b),v).
% 950528 [] -equalish(v,u).
% 950569 [binary:950498.2,950519] equalish(multiply(b,X),multiply(X,b)) | -defined(X).
% 950672 [binary:950492.2,950523] equalish(add(additive_identity,v),v).
% 950782 [binary:950512,950524] equalish(b,a).
% 950809 [binary:950515.2,950525] equalish(multiply(c,X),multiply(d,X)) | -defined(X).
% 950813 [binary:950513.3,950528] -equalish(X,u) | -equalish(v,X).
% 950820 [binary:950513.2,950526] -equalish(X,multiply(a,c)) | equalish(X,u).
% 950835 [binary:950515.2,950782] equalish(multiply(b,X),multiply(a,X)) | -defined(X).
% 950839 [binary:950513.2,950527] -equalish(X,multiply(d,b)) | equalish(X,v).
% 950997 [binary:950512,950672] equalish(v,add(additive_identity,v)).
% 950999 [binary:950513.2,950672] -equalish(X,add(additive_identity,v)) | equalish(X,v).
% 951142 [binary:950513.2,950997] equalish(X,add(additive_identity,v)) | -equalish(X,v).
% 953285 [binary:950513,950569] -equalish(multiply(X,b),Y) | equalish(multiply(b,X),Y) | -defined(X).
% 966232 [binary:950512.2,950813.2] -equalish(X,u) | -equalish(X,v).
% 993367 [binary:950820,950835,cut:950520] equalish(multiply(b,c),u).
% 993385 [binary:966232,993367] -equalish(multiply(b,c),v).
% 993635 [binary:950809,950839,cut:950519] equalish(multiply(c,b),v).
% 1021135 [binary:993385,950999.2] -equalish(multiply(b,c),add(additive_identity,v)).
% 1057006 [binary:993635,951142.2] equalish(multiply(c,b),add(additive_identity,v)).
% 1101502 [binary:1057006,953285,cut:1021135,cut:950520] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation 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 3
% seconds given: 54
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8251
% derived clauses: 3685680
% kept clauses: 238849
% kept size sum: 994226
% kept mid-nuclei: 161970
% kept new demods: 0
% forw unit-subs: 136357
% forw double-subs: 42543
% forw overdouble-subs: 6041
% backward subs: 5
% fast unit cutoff: 9028
% full unit cutoff: 0
% dbl unit cutoff: 287
% real runtime : 90.50
% process. runtime: 89.98
% specific non-discr-tree subsumption statistics:
% tried: 72675
% length fails: 46
% strength fails: 5436
% predlist fails: 30037
% aux str. fails: 0
% by-lit fails: 22
% full subs tried: 36084
% full subs fail: 30384
%
% ; 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/FLD025-2+noeq.in")
%
%------------------------------------------------------------------------------