TSTP Solution File: LAT253-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT253-1 : TPTP v3.4.2. Released v3.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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 168.9s
% Output : Assurance 168.9s
% 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/LAT/LAT253-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 6 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 6 5)
% (binary-posweight-lex-big-order 30 #f 6 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(15,40,1,30,0,1,27129,4,2255,28072,63,3002,28073,1,3002,28073,50,3004,28073,40,3004,28088,0,3004,40954,3,3609,43426,4,3905,45313,5,4205,45315,5,4205,45315,1,4205,45315,50,4207,45315,40,4207,45330,0,4207,64913,3,4809,73606,4,5108,79951,5,5408,79951,1,5408,79951,50,5410,79951,40,5410,79966,0,5410,113785,3,8411,127047,4,9913,141314,5,11411,141315,5,11411,141315,1,11411,141315,50,11415,141315,40,11415,141330,0,11415,163048,3,12918,166529,4,13667,178311,5,14436,178311,5,14437,178311,1,14437,178311,50,14439,178311,40,14439,178326,0,14439,207130,3,15941,210540,4,16694,212935,5,17440,212937,5,17441,212937,1,17441,212937,50,17443,212937,40,17443,212952,0,17443)
%
%
% START OF PROOF
% 212938 [] equal(X,X).
% 212941 [] equal(meet(X,join(X,Y)),X).
% 212942 [] equal(join(X,meet(X,Y)),X).
% 212943 [] equal(meet(X,Y),meet(Y,X)).
% 212944 [] equal(join(X,Y),join(Y,X)).
% 212946 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 212947 [] equal(join(X,complement(X)),one).
% 212948 [] equal(meet(X,complement(X)),zero).
% 212949 [] -equal(join(X,Y),one) | -equal(meet(X,Y),zero) | equal(complement(X),Y).
% 212950 [] equal(meet(X,join(Y,meet(Z,join(Y,U)))),meet(X,join(Y,meet(Z,join(U,meet(X,Y)))))).
% 212951 [] equal(meet(b,a),a).
% 212952 [] -equal(join(complement(b),complement(a)),complement(a)).
% 212953 [para:212947.1.1,212941.1.1.2] equal(meet(X,one),X).
% 212954 [para:212951.1.1,212942.1.1.2] equal(join(b,a),b).
% 212955 [para:212948.1.1,212942.1.1.2] equal(join(X,zero),X).
% 212957 [para:212943.1.1,212948.1.1] equal(meet(complement(X),X),zero).
% 212959 [para:212943.1.1,212953.1.1] equal(meet(one,X),X).
% 212962 [para:212959.1.1,212941.1.1] equal(join(one,X),one).
% 212963 [para:212944.1.1,212947.1.1] equal(join(complement(X),X),one).
% 212964 [para:212944.1.1,212952.1.1] -equal(join(complement(a),complement(b)),complement(a)).
% 212967 [para:212944.1.1,212954.1.1] equal(join(a,b),b).
% 213002 [para:212963.1.1,212946.1.1.1,demod:212962] equal(one,join(complement(X),join(X,Y))).
% 213027 [para:212963.1.1,212949.1.1,demod:212957,cut:212938,cut:212938] equal(complement(complement(X)),X).
% 213049 [para:212957.1.1,212950.1.2.2.2,demod:212955] equal(meet(X,join(Y,meet(complement(join(Z,meet(X,Y))),join(Y,Z)))),meet(X,Y)).
% 213112 [para:212967.1.1,213002.1.2.2] equal(one,join(complement(a),b)).
% 213116 [para:213002.1.2,212949.1.1,demod:213027,cut:212938] -equal(meet(complement(X),join(X,Y)),zero) | equal(X,join(X,Y)).
% 225910 [para:213049.1.1,213116.1.1,demod:212955,212957,cut:212938] equal(X,join(X,meet(complement(Y),join(X,Y)))).
% 225939 [para:213112.1.2,225910.1.2.2.2,demod:212953] equal(complement(a),join(complement(a),complement(b))).
% 226057 [para:225939.1.2,212964.1.1,cut:212938] 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: 156
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7763
% derived clauses: 5021604
% kept clauses: 176457
% kept size sum: 359291
% kept mid-nuclei: 32634
% kept new demods: 127077
% forw unit-subs: 4261917
% forw double-subs: 105975
% forw overdouble-subs: 27049
% backward subs: 279
% fast unit cutoff: 20808
% full unit cutoff: 66
% dbl unit cutoff: 562
% real runtime : 178.73
% process. runtime: 177.46
% specific non-discr-tree subsumption statistics:
% tried: 891496
% length fails: 9754
% strength fails: 67132
% predlist fails: 266442
% aux str. fails: 47055
% by-lit fails: 1952
% full subs tried: 497261
% full subs fail: 469586
%
% ; 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/LAT/LAT253-1+eq_r.in")
%
%------------------------------------------------------------------------------