TSTP Solution File: LCL100-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL100-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.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 398.1s
% Output : Assurance 398.1s
% 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/LCL/LCL100-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 7 5)
% (binary-unit 11 #f 7 5)
% (binary-double 17 #f 7 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 7 5)
% (binary-posweight-order 283 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(4,40,0,8,0,0,37412,4,2176,37412,50,2186,37412,40,2186,37416,0,2186,50079,3,2737,53585,4,3119,53697,5,3288,53699,5,3292,53699,1,3292,53699,50,3296,53699,40,3296,53703,0,3296,72977,3,4150,75828,4,4584,80064,5,4997,80065,5,4997,80066,1,4997,80066,50,4999,80066,40,4999,80070,0,4999,131744,4,7176,131881,5,7904,131882,1,7910,131882,50,7914,131882,40,7914,131886,0,7914,138799,3,9619,140322,4,10479,141854,5,11315,141855,5,11316,141855,1,11316,141855,50,11317,141855,40,11317,141859,0,11317,183051,3,13330,190361,4,14319,198228,5,15318,198230,5,15319,198230,1,15319,198230,50,15321,198230,40,15321,198234,0,15321,230686,3,16172,233239,4,16597,256027,5,17022,256028,5,17022,256029,1,17022,256029,50,17023,256029,40,17023,256033,0,17023,300545,3,18475,306431,4,19199,314856,5,19924,314858,5,19925,314858,1,19925,314858,50,19927,314858,40,19927,314862,0,19927,401994,3,25482,431859,4,28253,432286,5,31030,432286,5,31032,432287,1,31037,432287,50,31053,432287,40,31053,432291,0,31055)
%
%
% START OF PROOF
% 37534 [?] ?
% 38993 [?] ?
% 46023 [binary:37534,38993] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(equivalent(Z,Y),U)),U)).
% 53750 [?] ?
% 53786 [?] ?
% 63311 [?] ?
% 66221 [binary:53786.2,53750.2,factor:slowcut:63311] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U)),equivalent(equivalent(Z,Y),U))).
% 142324 [?] ?
% 152562 [?] ?
% 161998 [binary:142324,152562] -is_a_theorem(equivalent(equivalent(e,equivalent(equivalent(c,b),equivalent(equivalent(e,equivalent(equivalent(a,b),equivalent(a,c))),falsehood))),falsehood)).
% 314867 [?] ?
% 314870 [?] ?
% 314878 [?] ?
% 314889 [binary:314878,314870] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Y),X))).
% 314934 [?] ?
% 316063 [binary:314867,314934] is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Y)).
% 432288 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 432293 [binary:314889,432288] is_a_theorem(equivalent(equivalent(X,X),Y)) | -is_a_theorem(Y).
% 432294 [binary:316063,432288] -is_a_theorem(equivalent(equivalent(X,X),Y)) | is_a_theorem(Y).
% 432704 [binary:432293.2,46023,binarydemod:432294] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(equivalent(Z,Y),U)),U)).
% 432762 [binary:432288,66221] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U))) | is_a_theorem(equivalent(equivalent(Z,Y),U)).
% 436170 [binary:432704,432762] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(X,equivalent(equivalent(U,Z),equivalent(U,Y))),V))),V)).
% 742693 [binary:161998,436170] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 283
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11078
% derived clauses: 2402401
% kept clauses: 382580
% kept size sum: 0
% kept mid-nuclei: 48202
% kept new demods: 0
% forw unit-subs: 1218640
% forw double-subs: 45384
% forw overdouble-subs: 59526
% backward subs: 434
% fast unit cutoff: 13772
% full unit cutoff: 5
% dbl unit cutoff: 37
% real runtime : 405.98
% process. runtime: 403.69
% specific non-discr-tree subsumption statistics:
% tried: 8481173
% length fails: 319027
% strength fails: 792672
% predlist fails: 315643
% aux str. fails: 668822
% by-lit fails: 496731
% full subs tried: 5616979
% full subs fail: 5551441
%
% ; 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/LCL/LCL100-1+noeq.in")
%
%------------------------------------------------------------------------------