TSTP Solution File: NUM095-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM095-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 : art03.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 88.9s
% Output : Assurance 88.9s
% 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/NUM/NUM095-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(163,40,3,326,0,3,261074,4,2142,261878,5,2805,261879,1,2807,261879,50,2834,261879,40,2834,262042,0,2834,281871,3,4236,285159,4,4935,296449,5,5635,296450,5,5635,296451,1,5635,296451,50,5638,296451,40,5638,296614,0,5638,324944,3,6189,329204,4,6464,342560,62,6739,342560,5,6739,342560,1,6739,342560,50,6742,342560,40,6742,342723,0,6742,375492,3,7621,378280,4,8018,386272,5,8443,386273,5,8443,386274,1,8443,386274,50,8446,386274,40,8446,386437,0,8446,421672,3,9297,426062,4,9723)
%
%
% START OF PROOF
% 386276 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 386277 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 386278 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 386279 [] subclass(X,universal_class).
% 386282 [] -subclass(X,Y) | -subclass(Y,X) | equal(Y,X).
% 386296 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 386297 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 386298 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 386300 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 386400 [] member(least(X,Y),Y) | -well_ordering(X,Z) | -member(U,Y) | -subclass(Y,Z).
% 386406 [] -section(X,Y,Z) | subclass(Y,Z).
% 386434 [] well_ordering(xr,y).
% 386435 [] section(xr,w,y).
% 386436 [] -member(least(xr,intersection(complement(w),y)),complement(w)).
% 386437 [] -equal(y,w).
% 386440 [binary:386400.2,386434] member(least(xr,X),X) | -subclass(X,y) | -member(Y,X).
% 386447 [binary:386406,386435] subclass(w,y).
% 386450 [binary:386282,386447,cut:386437] -subclass(y,w).
% 386460 [binary:386296.2,386436] -member(least(xr,intersection(complement(w),y)),intersection(complement(w),X)).
% 386464 [binary:386277.2,386450] member(not_subclass_element(y,w),y).
% 386465 [binary:386278.2,386450] -member(not_subclass_element(y,w),w).
% 386470 [binary:386276,386464] member(not_subclass_element(y,w),X) | -subclass(y,X).
% 386474 [binary:386298.2,386464] member(not_subclass_element(y,w),intersection(X,y)) | -member(not_subclass_element(y,w),X).
% 386606 [binary:386277.2,386440.2] member(not_subclass_element(X,y),X) | member(least(xr,X),X) | -member(Y,X).
% 386608 [binary:386278.2,386440.2] -member(not_subclass_element(X,y),y) | member(least(xr,X),X) | -member(Y,X).
% 389217 [binary:386279,386470.2] member(not_subclass_element(y,w),universal_class).
% 390393 [binary:386300.3,386465,cut:389217] member(not_subclass_element(y,w),complement(w)).
% 390421 [binary:386474.2,390393] member(not_subclass_element(y,w),intersection(complement(w),y)).
% 405445 [binary:386460,386606.2,slowcut:390421] member(not_subclass_element(intersection(complement(w),y),y),intersection(complement(w),y)).
% 405735 [binary:386460,386608.2,slowcut:405445] -member(not_subclass_element(intersection(complement(w),y),y),y).
% 426980 [binary:405445,386297,cut:405735] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7061
% derived clauses: 730061
% kept clauses: 204009
% kept size sum: 517924
% kept mid-nuclei: 59723
% kept new demods: 416
% forw unit-subs: 226518
% forw double-subs: 66162
% forw overdouble-subs: 10914
% backward subs: 516
% fast unit cutoff: 4361
% full unit cutoff: 3097
% dbl unit cutoff: 586
% real runtime : 98.63
% process. runtime: 97.43
% specific non-discr-tree subsumption statistics:
% tried: 754256
% length fails: 56771
% strength fails: 123258
% predlist fails: 311751
% aux str. fails: 28962
% by-lit fails: 52080
% full subs tried: 108311
% full subs fail: 97958
%
% ; 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/NUM/NUM095-1+eq_r.in")
%
%------------------------------------------------------------------------------