TSTP Solution File: SWC027-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC027-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 : art08.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 50.0s
% Output : Assurance 50.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/SWC027-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(204,40,2,408,0,2,58853,4,2237,62801,63,2803,62801,1,2803,62801,50,2806,62801,40,2806,63005,0,2806,131105,3,4207,144639,4,4907,155248,5,5628,155248,5,5630,155248,1,5630,155248,50,5634,155248,40,5634,155452,0,5634)
%
%
% START OF PROOF
% 155249 [] equal(X,X).
% 155260 [] -singleton^p(nil).
% 155320 [] -member^p(nil,X) | -ss^item(X).
% 155365 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 155389 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 155394 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 155436 [] ss^list(sk2).
% 155437 [] ss^list(sk3).
% 155439 [] equal(sk2,sk4).
% 155440 [] equal(sk1,sk3).
% 155441 [] equal(nil,sk4) | ss^item(sk5).
% 155442 [] equal(nil,sk3) | ss^item(sk5).
% 155443 [] equal(cons(sk5,nil),sk3) | equal(nil,sk4).
% 155446 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 155447 [] member^p(sk4,sk5) | equal(nil,sk3).
% 155449 [] equal(nil,sk2) | equal(nil,sk1).
% 155452 [] -equal(nil,sk1) | -equal(nil,sk2).
% 155490 [input:155389,factor] member^p(app(X,X),Y) | -member^p(X,Y) | -ss^item(Y) | -ss^list(X).
% 155500 [input:155394,factor] equal(app(X,X),nil) | -equal(nil,X) | -ss^list(X).
% 156220 [para:155441.1.2,155439.1.2] equal(sk2,nil) | ss^item(sk5).
% 156224 [para:155440.1.2,155442.1.2] equal(nil,sk1) | ss^item(sk5).
% 156284 [para:156220.1.1,155452.2.2,cut:155249,binarycut:156224] ss^item(sk5).
% 156799 [binary:156284,155320.2] -member^p(nil,sk5).
% 159472 [binary:155443,155365,cut:156284,cut:155437] equal(nil,sk4) | singleton^p(sk3).
% 159486 [binary:155446,155365,cut:156284,cut:155437] equal(nil,sk3) | singleton^p(sk3).
% 167970 [para:159472.1.2,155439.1.2] equal(sk2,nil) | singleton^p(sk3).
% 168519 [para:155440.1.2,159486.1.2] equal(nil,sk1) | singleton^p(sk3).
% 177553 [para:167970.1.1,155452.2.2,cut:155249,binarycut:168519] singleton^p(sk3).
% 177555 [para:155440.1.2,177553.1.1] singleton^p(sk1).
% 177557 [para:155447.2.2,177553.1.1,cut:155260] member^p(sk4,sk5).
% 177560 [para:155449.2.2,177555.1.1,cut:155260] equal(nil,sk2).
% 177977 [para:155439.1.2,177557.1.1] member^p(sk2,sk5).
% 178001 [binary:155500.2,177560,cut:155436] equal(app(sk2,sk2),nil).
% 178051 [binary:155490.2,177977,demod:178001,cut:156799,cut:156284,cut:155436] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 2727
% derived clauses: 487978
% kept clauses: 144582
% kept size sum: 327211
% kept mid-nuclei: 26690
% kept new demods: 33859
% forw unit-subs: 30698
% forw double-subs: 7242
% forw overdouble-subs: 4025
% backward subs: 257
% fast unit cutoff: 14710
% full unit cutoff: 0
% dbl unit cutoff: 580
% real runtime : 59.9
% process. runtime: 59.9
% specific non-discr-tree subsumption statistics:
% tried: 1119105
% length fails: 6862
% strength fails: 50669
% predlist fails: 861098
% aux str. fails: 28130
% by-lit fails: 7146
% full subs tried: 128985
% full subs fail: 124421
%
% ; 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/SWC027-1+eq_r.in")
%
%------------------------------------------------------------------------------