TSTP Solution File: SWC364-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC364-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 : 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 49.5s
% Output : Assurance 49.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/SWC/SWC364-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(200,40,3,400,0,3,54953,4,2233,56885,5,2805,56886,1,2807,56886,50,2809,56886,40,2809,57086,0,2809,136514,3,4211,177875,4,4913)
%
%
% START OF PROOF
% 56895 [] ss^list(nil).
% 56938 [] ss^list(skaf45(X,Y)).
% 56948 [] frontseg^p(X,X) | -ss^list(X).
% 56973 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 57019 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 57060 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 57073 [] ss^list(sk1).
% 57074 [] ss^list(sk2).
% 57076 [] ss^list(sk4).
% 57077 [] equal(sk2,sk4).
% 57078 [] equal(sk1,sk3).
% 57079 [] neq(sk2,nil).
% 57084 [] -neq(sk4,nil) | ss^item(sk5).
% 57085 [] equal(app(cons(sk5,nil),sk3),sk4) | -neq(sk4,nil).
% 57086 [] -neq(sk4,nil) | -segment^p(sk2,sk1).
% 57854 [para:57077.1.2,57084.1.1,cut:57079] ss^item(sk5).
% 57856 [para:57077.1.2,57085.2.1,cut:57079] equal(app(cons(sk5,nil),sk3),sk4).
% 57859 [para:57077.1.2,57086.1.1,cut:57079] -segment^p(sk2,sk1).
% 57860 [para:57078.1.2,57856.1.1.2] equal(app(cons(sk5,nil),sk1),sk4).
% 58051 [binary:57076,56948.2] frontseg^p(sk4,sk4).
% 58123 [para:57077.1.2,58051.1.1] frontseg^p(sk2,sk4).
% 58974 [binary:57854,56973.2] ss^list(cons(sk5,X)) | -ss^list(X).
% 62755 [binary:58123,57019.2,cut:57074,cut:57076] equal(app(sk4,skaf45(sk2,sk4)),sk2).
% 70709 [para:57860.1.1,57060.1.1.1,cut:57073,binarydemod:58974,cut:56895] -equal(app(sk4,X),Y) | segment^p(Y,sk1) | -ss^list(X) | -ss^list(Y).
% 189781 [binary:62755,70709,cut:57859,cut:56938,cut:57074] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not 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 19
% clause depth limited to 5
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1672
% derived clauses: 263060
% kept clauses: 119037
% kept size sum: 0
% kept mid-nuclei: 26617
% kept new demods: 33044
% forw unit-subs: 20557
% forw double-subs: 5632
% forw overdouble-subs: 3815
% backward subs: 25
% fast unit cutoff: 19870
% full unit cutoff: 0
% dbl unit cutoff: 273
% real runtime : 52.23
% process. runtime: 51.72
% specific non-discr-tree subsumption statistics:
% tried: 1235879
% length fails: 18282
% strength fails: 125304
% predlist fails: 829942
% aux str. fails: 47664
% by-lit fails: 42914
% full subs tried: 146579
% full subs fail: 142539
%
% ; 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/SWC364-1+eq_r.in")
%
%------------------------------------------------------------------------------