TSTP Solution File: SWC024-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC024-1 : TPTP v3.4.2. Released v2.4.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/SWC/SWC024-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 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (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(199,40,1,403,0,2,50073,4,2147,52046,5,2803,52046,1,2803,52046,50,2805,52046,40,2805,52250,0,2819)
%
%
% START OF PROOF
% 52047 [] equal(X,X).
% 52055 [] ss^list(nil).
% 52108 [] frontseg^p(X,X) | -ss^list(X).
% 52120 [] equal(app(X,nil),X) | -ss^list(X).
% 52147 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52162 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52165 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 52191 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 52236 [] equal(app(sk3,sk5),sk4).
% 52237 [] ss^list(sk5).
% 52238 [] -neq(X,nil) | -frontseg^p(sk2,X) | -frontseg^p(sk1,X) | -ss^list(X).
% 52239 [] neq(sk2,nil).
% 52240 [] equal(sk1,sk3).
% 52241 [] equal(sk2,sk4).
% 52242 [] ss^list(sk4).
% 52243 [] ss^list(sk3).
% 52250 [] -equal(nil,sk3) | equal(nil,sk4).
% 52265 [input:52162,factor:cut:52047] -neq(X,X) | -ss^list(X).
% 53435 [binary:52243,52108.2] frontseg^p(sk3,sk3).
% 53505 [para:52240.1.2,53435.1.1] frontseg^p(sk1,sk3).
% 53704 [binary:52243,52120.2] equal(app(sk3,nil),sk3).
% 54761 [binary:52242,52265.2] -neq(sk4,sk4).
% 54792 [para:52241.1.2,54761.1.1] -neq(sk2,sk4).
% 54833 [para:52250.2.2,54792.1.2,cut:52239] -equal(nil,sk3).
% 56655 [para:53704.1.1,52165.1.1,cut:54833,cut:52243,cut:52055] -equal(sk3,nil).
% 56713 [binary:52147.2,56655,cut:52055,cut:52243] neq(sk3,nil).
% 56731 [binary:52238,56713,cut:53505,cut:52243] -frontseg^p(sk2,sk3).
% 60652 [binary:52236,52191,cut:52242,cut:52243,cut:52237] frontseg^p(sk4,sk3).
% 60799 [para:52241.1.2,60652.1.1,cut:56731] 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 19
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 630
% derived clauses: 98146
% kept clauses: 45353
% kept size sum: 632551
% kept mid-nuclei: 14123
% kept new demods: 30204
% forw unit-subs: 4535
% forw double-subs: 2065
% forw overdouble-subs: 819
% backward subs: 14
% fast unit cutoff: 1579
% full unit cutoff: 0
% dbl unit cutoff: 144
% real runtime : 28.74
% process. runtime: 28.74
% specific non-discr-tree subsumption statistics:
% tried: 89539
% length fails: 3670
% strength fails: 17157
% predlist fails: 40078
% aux str. fails: 2751
% by-lit fails: 892
% full subs tried: 22896
% full subs fail: 21770
%
% ; 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/SWC/SWC024-1+eq_r.in")
%
%------------------------------------------------------------------------------