TSTP Solution File: RNG034-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG034-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 : 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 407.9s
% Output : Assurance 407.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/RNG/RNG034-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 5 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 5 3)
% (binary-posweight-lex-big-order 30 #f 5 3)
% (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(20,40,0,40,0,1,12094,4,2254,13072,5,3002,13073,1,3002,13073,50,3003,13073,40,3003,13093,0,3003,33982,3,3605,34999,4,3904,40322,5,4204,40323,5,4204,40323,1,4204,40323,50,4206,40323,40,4206,40343,0,4206,53428,3,4822,56385,4,5114,58613,5,5420,58613,1,5420,58613,50,5421,58613,40,5421,58633,0,5421,102081,3,8423,106356,4,9922,110968,5,11440,110969,5,11442,110969,1,11442,110969,50,11445,110969,40,11445,110989,0,11445,141954,3,12948,143159,4,13696,147515,5,14446,147516,5,14446,147516,1,14446,147516,50,14449,147516,40,14449,147536,0,14449,170376,3,15950,174538,4,16700,177956,5,17450,177956,1,17450,177956,50,17453,177956,40,17453,177976,0,17453,244348,3,25262,325785,4,29155,394437,5,33054,394438,5,33055,394438,1,33055,394438,50,33060,394438,40,33060,394458,0,33060,423896,3,38348,433067,4,40712)
%
%
% START OF PROOF
% 394440 [] equal(add(additive_identity,X),X).
% 394443 [] equal(add(additive_inverse(X),X),additive_identity).
% 394444 [] equal(additive_inverse(add(X,Y)),add(additive_inverse(X),additive_inverse(Y))).
% 394445 [] equal(additive_inverse(additive_inverse(X)),X).
% 394446 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 394447 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 394449 [] equal(multiply(multiply(X,X),Y),multiply(X,multiply(X,Y))).
% 394450 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 394451 [] equal(multiply(X,additive_inverse(Y)),multiply(additive_inverse(X),Y)).
% 394453 [] equal(add(X,Y),add(Y,X)).
% 394454 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 394455 [] -equal(add(X,Y),add(Z,Y)) | equal(X,Z).
% 394456 [] -equal(add(X,Y),add(X,Z)) | equal(Y,Z).
% 394458 [] -equal(add(multiply(multiply(cy,cx),cz),multiply(additive_inverse(cy),multiply(cx,cz))),add(multiply(multiply(additive_inverse(cx),cy),cz),multiply(cx,multiply(cy,cz)))).
% 394461 [para:394453.1.1,394458.1.1] -equal(add(multiply(additive_inverse(cy),multiply(cx,cz)),multiply(multiply(cy,cx),cz)),add(multiply(multiply(additive_inverse(cx),cy),cz),multiply(cx,multiply(cy,cz)))).
% 394463 [para:394453.1.1,394461.1.2] -equal(add(multiply(additive_inverse(cy),multiply(cx,cz)),multiply(multiply(cy,cx),cz)),add(multiply(cx,multiply(cy,cz)),multiply(multiply(additive_inverse(cx),cy),cz))).
% 394475 [para:394450.1.2,394451.1.1.2] equal(multiply(X,multiply(additive_inverse(Y),Z)),multiply(additive_inverse(X),multiply(Y,Z))).
% 394494 [para:394453.1.1,394455.1.2] -equal(add(X,Y),add(Y,Z)) | equal(X,Z).
% 394532 [para:394451.1.2,394463.1.1.1,demod:394450] -equal(add(multiply(cy,multiply(additive_inverse(cx),cz)),multiply(multiply(cy,cx),cz)),add(multiply(cx,multiply(cy,cz)),multiply(multiply(additive_inverse(cx),cy),cz))).
% 394548 [para:394447.1.1,394449.1.1.1,demod:394449,394447,394454,394446,binarydemod:394456] equal(add(multiply(multiply(X,Y),Z),add(multiply(multiply(Y,X),Z),multiply(Y,multiply(Y,Z)))),add(multiply(X,multiply(Y,Z)),add(multiply(Y,multiply(X,Z)),multiply(Y,multiply(Y,Z))))).
% 394556 [para:394443.1.1,394454.1.2.1,demod:394440] equal(add(additive_inverse(X),add(X,Y)),Y).
% 394573 [para:394556.1.1,394453.1.1,demod:394454] equal(X,add(Y,add(X,additive_inverse(Y)))).
% 394590 [para:394556.1.1,394456.1.1] -equal(X,add(additive_inverse(Y),Z)) | equal(add(Y,X),Z).
% 394608 [para:394450.1.2,394573.1.2.2.2] equal(X,add(multiply(Y,Z),add(X,multiply(additive_inverse(Y),Z)))).
% 394836 [para:394573.1.2,394494.1.2] equal(X,add(Y,additive_inverse(Z))) | -equal(add(X,Z),Y).
% 394850 [para:394451.1.1,394475.1.1.2,demod:394445] equal(multiply(X,multiply(Y,Z)),multiply(additive_inverse(X),multiply(Y,additive_inverse(Z)))).
% 395096 [para:394451.1.2,394532.1.1.1.2] -equal(add(multiply(cy,multiply(cx,additive_inverse(cz))),multiply(multiply(cy,cx),cz)),add(multiply(cx,multiply(cy,cz)),multiply(multiply(additive_inverse(cx),cy),cz))).
% 398558 [binary:394836.2,394548,demod:394608,394454,394450,394444] equal(multiply(multiply(X,Y),Z),add(multiply(X,multiply(Y,Z)),add(multiply(Y,multiply(X,Z)),multiply(multiply(additive_inverse(Y),X),Z)))).
% 433650 [binary:395096,394590.2,demod:394850,394450,cut:398558] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 102
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 19102
% derived clauses: 3786137
% kept clauses: 252590
% kept size sum: 0
% kept mid-nuclei: 83529
% kept new demods: 23480
% forw unit-subs: 2200227
% forw double-subs: 466237
% forw overdouble-subs: 0
% backward subs: 580
% fast unit cutoff: 101
% full unit cutoff: 0
% dbl unit cutoff: 3
% real runtime : 411.36
% process. runtime: 408.77
% 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/RNG/RNG034-1+eq_r.in")
%
%------------------------------------------------------------------------------