TSTP Solution File: SWC071-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC071-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 : art07.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 60.0s
% Output : Assurance 60.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/SWC071-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(208,40,1,416,0,1,81830,4,2348,105670,5,2803,105671,1,2805,105671,50,2810,105671,40,2810,105879,0,2842,199990,3,4246,222730,4,4944,239639,5,5643,239641,1,5644,239641,50,5647,239641,40,5647,239849,0,5647,276656,3,6198,289245,4,6474)
%
%
% START OF PROOF
% 239642 [] equal(X,X).
% 239650 [] ss^list(nil).
% 239653 [] -singleton^p(nil).
% 239698 [] segment^p(X,nil) | -ss^list(X).
% 239699 [] segment^p(X,X) | -ss^list(X).
% 239721 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 239740 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 239742 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 239757 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 239758 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 239769 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 239815 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 239829 [] ss^list(sk2).
% 239830 [] ss^list(sk3).
% 239831 [] ss^list(sk4).
% 239832 [] equal(sk2,sk4).
% 239833 [] equal(sk1,sk3).
% 239834 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 239835 [] -equal(nil,sk2) | -equal(nil,sk1).
% 239836 [] equal(nil,sk4) | ss^item(sk5).
% 239838 [] equal(nil,sk4) | ss^list(sk6).
% 239839 [] equal(nil,sk4) | ss^list(sk7).
% 239840 [] equal(cons(sk5,nil),sk3) | equal(nil,sk4).
% 239846 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 239847 [] equal(app(app(sk6,sk3),sk7),sk4) | equal(nil,sk3).
% 239863 [input:239757,factor:cut:239642] -neq(X,X) | -ss^list(X).
% 240624 [para:239836.1.2,239832.1.2] equal(sk2,nil) | ss^item(sk5).
% 240629 [?] ?
% 240634 [para:239838.1.2,239832.1.2] equal(sk2,nil) | ss^list(sk6).
% 240640 [para:239839.1.2,239832.1.2] equal(sk2,nil) | ss^list(sk7).
% 240668 [?] ?
% 240695 [?] ?
% 240700 [para:240624.1.1,239835.1.2,cut:239642,binarycut:240629] ss^item(sk5).
% 240796 [binary:239830,239698.2] segment^p(sk3,nil).
% 240834 [binary:239830,239699.2] segment^p(sk3,sk3).
% 240906 [para:239833.1.2,240834.1.1] segment^p(sk1,sk3).
% 242508 [binary:239831,239863.2] -neq(sk4,sk4).
% 242593 [para:239832.1.2,242508.1.2] -neq(sk4,sk2).
% 243082 [binary:242593,239742,cut:239829,cut:239831] equal(sk4,sk2).
% 244126 [binary:239840,239758,cut:240700,cut:239830] equal(nil,sk4) | singleton^p(sk3).
% 249037 [para:240634.1.1,239835.1.2,cut:239642,binarycut:240668] ss^list(sk6).
% 252155 [para:240640.1.1,239835.1.2,cut:239642,binarycut:240695] ss^list(sk7).
% 253755 [para:239847.1.1,239815.1.1,cut:239830,cut:252155,cut:249037] equal(nil,sk3) | -equal(sk4,X) | segment^p(X,sk3) | -ss^list(X).
% 261218 [para:244126.1.2,239832.1.2] equal(sk2,nil) | singleton^p(sk3).
% 261241 [?] ?
% 269487 [para:261218.1.1,239835.1.2,cut:239642,binarycut:261241] singleton^p(sk3).
% 269490 [para:239846.2.2,269487.1.1,cut:239653] equal(cons(sk5,nil),sk3).
% 272872 [para:269490.1.1,239740.1.1,cut:240700,cut:239650] -equal(sk3,nil).
% 273109 [binary:239742.2,272872,cut:239650,cut:239830] neq(sk3,nil).
% 273116 [binary:239769.3,272872,cut:240796,cut:239830,cut:239650] -segment^p(nil,sk3).
% 273178 [binary:239834,273109,cut:240906,cut:239830] -segment^p(sk2,sk3).
% 273195 [binary:239721.2,273116,cut:239830] -equal(nil,sk3).
% 297964 [binary:243082,253755.2,cut:273195,cut:273178,cut:239829] 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 double 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: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2715
% derived clauses: 411131
% kept clauses: 200116
% kept size sum: 791325
% kept mid-nuclei: 44433
% kept new demods: 28829
% forw unit-subs: 37347
% forw double-subs: 35947
% forw overdouble-subs: 9005
% backward subs: 349
% fast unit cutoff: 32125
% full unit cutoff: 0
% dbl unit cutoff: 732
% real runtime : 65.93
% process. runtime: 65.89
% specific non-discr-tree subsumption statistics:
% tried: 1688234
% length fails: 24067
% strength fails: 216000
% predlist fails: 1071221
% aux str. fails: 63690
% by-lit fails: 40938
% full subs tried: 229143
% full subs fail: 219652
%
% ; 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/SWC071-1+eq_r.in")
%
%------------------------------------------------------------------------------