TSTP Solution File: HWC002-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWC002-1 : TPTP v3.4.2. Released v1.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 203.4s
% Output : Assurance 203.4s
% 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/HWC/HWC002-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 3)
% (binary-unit 28 #f 4 3)
% (binary-double 28 #f 4 3)
% (binary 45 #t 4 3)
% (hyper 11 #t 4 3)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(39,40,0,78,0,0,57686,3,2851,60286,4,4276,69201,5,5701,69201,1,5701,69201,50,5706,69201,40,5706,69240,0,5706,114397,3,7107,115783,4,7807,124142,5,8507,124142,1,8507,124142,50,8511,124142,40,8511,124181,0,8511,169228,3,9912,170880,4,10612,180182,5,11312,180182,1,11312,180182,50,11316,180182,40,11316,180221,0,11316,180223,50,11316,180262,0,11316,180273,50,11316,180312,0,11329,180454,50,11331,180493,0,11331,181824,50,11373,181863,0,11373,192740,3,13574,194482,4,14674,195616,5,15774,195616,1,15774,195616,50,15775,195616,40,15775,195655,0,15775,195657,50,15775,195696,0,15775,195707,50,15775,195746,0,15788,195888,50,15790,195927,0,15790,197258,50,15825,197297,0,15825,206145,4,16576,206145,50,16578,206145,40,16578,206184,0,16578,634852,4,18679,634852,50,18751,634852,40,18751,634891,0,18751,767473,3,19555,839096,4,19953,906141,5,20352,906145,1,20352,906145,50,20357,906145,40,20357,906184,0,20357)
%
%
% START OF PROOF
% 906147 [] equal(and(n0,n0),n0).
% 906148 [] equal(and(n0,n1),n0).
% 906172 [] circuit(top(X),Y,bottom(X)).
% 906173 [] equal(and(table(X,Y,Z,U),table(V,W,X1,X2)),table(and(X,V),and(Y,W),and(Z,X1),and(U,X2))).
% 906174 [] equal(and(nil,X),X).
% 906179 [] equal(table(n0,n0,n0,n0),nil).
% 906181 [] equal(connect(nil,X),X).
% 906184 [] -circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))).
% 906354 [para:906147.1.1,906173.1.2.2] equal(and(table(X,n0,Y,Z),table(U,n0,V,W)),table(and(X,U),n0,and(Y,V),and(Z,W))).
% 906355 [para:906147.1.1,906173.1.2.3] equal(and(table(X,Y,n0,Z),table(U,V,n0,W)),table(and(X,U),and(Y,V),n0,and(Z,W))).
% 906356 [para:906147.1.1,906173.1.2.4] equal(and(table(X,Y,Z,n0),table(U,V,W,n0)),table(and(X,U),and(Y,V),and(Z,W),n0)).
% 906358 [para:906148.1.1,906173.1.2.2,demod:906354] equal(and(table(X,n0,Y,Z),table(U,n1,V,W)),and(table(X,n0,Y,Z),table(U,n0,V,W))).
% 906359 [para:906148.1.1,906173.1.2.3,demod:906355] equal(and(table(X,Y,n0,Z),table(U,V,n1,W)),and(table(X,Y,n0,Z),table(U,V,n0,W))).
% 906360 [para:906148.1.1,906173.1.2.4,demod:906356] equal(and(table(X,Y,Z,n0),table(U,V,W,n1)),and(table(X,Y,Z,n0),table(U,V,W,n0))).
% 911239 [para:906179.1.1,906358.1.1.1,demod:906179,906174] equal(table(X,n1,Y,Z),table(X,n0,Y,Z)).
% 911247 [para:906179.1.1,906359.1.1.1,demod:906179,906174] equal(table(X,Y,n1,Z),table(X,Y,n0,Z)).
% 911256 [para:906179.1.1,906360.1.1.1,demod:906179,906174] equal(table(X,Y,Z,n1),table(X,Y,Z,n0)).
% 911261 [para:911239.1.1,906184.1.1.1.1,demod:911247,906181,906179,911256,cut:906172] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order 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: 22
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 28748
% derived clauses: 1941860
% kept clauses: 341507
% kept size sum: 131144
% kept mid-nuclei: 12947
% kept new demods: 274524
% forw unit-subs: 124764
% forw double-subs: 2362
% forw overdouble-subs: 0
% backward subs: 307
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 205.74
% process. runtime: 204.1
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/HWC/HWC002-1+eq_r.in")
% WARNING: TreeLimitedRun lost 203.44s, total lost is 203.44s
%
%------------------------------------------------------------------------------