TSTP Solution File: LCL167-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL167-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 188.6s
% Output : Assurance 188.6s
% 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/LCL167-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,0,6,0,0,9,50,0,12,0,0,17,50,0,20,0,0,25,50,0,28,0,0,59,50,0,62,0,0,358,50,7,361,0,7,32317,4,2115,32610,5,2808,32611,1,2812,32611,50,2814,32611,40,2814,32614,0,2814,32617,50,2814,32620,0,2826,32628,50,2826,32631,0,2826,32642,50,2826,32645,0,2826,32832,50,2830,32835,0,2841,39175,3,3346,40341,4,3594,42591,5,3842,42591,5,3842,42591,1,3842,42591,50,3843,42591,40,3843,42594,0,3843,42880,50,3846,42883,0,3846,90824,3,4647,106420,4,5047,120026,5,5447,120026,1,5447,120026,50,5450,120026,40,5450,120029,0,5450,154530,4,7639,154685,5,8353,154686,1,8358,154686,50,8361,154686,40,8361,154689,0,8361,161388,3,10073,163065,4,10916,164018,5,11762,164019,5,11763,164019,1,11763,164019,50,11763,164019,40,11763,164022,0,11779,196473,3,13782,205824,4,14780,220875,5,15780,220876,1,15780,220876,50,15782,220876,40,15782,220879,0,15782,248925,3,16633,250590,4,17058,252529,5,17483,252530,5,17483,252531,1,17483,252531,50,17484,252531,40,17484,252534,0,17484,296525,3,18950)
%
%
% START OF PROOF
% 252532 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 252533 [] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(X,Z),Y)))).
% 252534 [] -is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(c,b),a)))).
% 252536 [binary:252532,252533] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),X))) | -is_a_theorem(Z).
% 252538 [binary:252532,252536] is_a_theorem(equivalent(equivalent(X,Y),Z)) | -is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(X).
% 252541 [binary:252532,252538] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(X) | is_a_theorem(Z).
% 252546 [binary:252533,252541] -is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(U,Z),Y)))) | -is_a_theorem(U) | is_a_theorem(X).
% 252548 [binary:252536,252541] -is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),U))) | -is_a_theorem(equivalent(U,Z)) | -is_a_theorem(Y) | is_a_theorem(X).
% 252551 [binary:252536,252541.2,factor] -is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Z))) | is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(X).
% 252552 [binary:252538,252541] -is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(equivalent(U,Z)) | -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(U).
% 252555 [binary:252538,252541,factor:factor:slowcut:252533] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(Y) | is_a_theorem(X).
% 252571 [binary:252533,252555] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),X))) | is_a_theorem(Z).
% 252572 [binary:252536,252555] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(X).
% 252580 [binary:252536,252546,factor] is_a_theorem(equivalent(equivalent(equivalent(X,Y),X),Y)) | -is_a_theorem(X).
% 252585 [binary:252532,252580] -is_a_theorem(equivalent(equivalent(X,Y),X)) | -is_a_theorem(X) | is_a_theorem(Y).
% 252591 [binary:252555,252580] is_a_theorem(equivalent(equivalent(X,Y),X)) | -is_a_theorem(Y) | -is_a_theorem(X).
% 252592 [binary:252555,252580,factor] is_a_theorem(equivalent(equivalent(X,X),X)) | -is_a_theorem(X).
% 252596 [binary:252555,252592] is_a_theorem(equivalent(X,X)) | -is_a_theorem(X).
% 252604 [binary:252541.2,252591,factor:factor:factor:binarycut:252596] is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | -is_a_theorem(Y).
% 252617 [binary:252604,252571] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | -is_a_theorem(equivalent(Z,Y)) | is_a_theorem(X).
% 252619 [binary:252533,252572] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,U),Y),X)),U)) | -is_a_theorem(Z).
% 252620 [binary:252580,252572] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)) | -is_a_theorem(X).
% 252633 [binary:252585,252620.2] -is_a_theorem(equivalent(X,equivalent(X,Y))) | -is_a_theorem(X) | is_a_theorem(Y).
% 252640 [binary:252538,252548,factor] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),U)) | is_a_theorem(equivalent(equivalent(Z,Y),U)) | -is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(X).
% 252810 [binary:252538,252552.3,factor:factor:slowcut:252533] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(equivalent(Y,Z)) | -is_a_theorem(Z) | is_a_theorem(X).
% 253217 [binary:252536,252617] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),Y)) | -is_a_theorem(X) | is_a_theorem(Z).
% 253218 [binary:252580,252617] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)) | -is_a_theorem(Y).
% 254648 [binary:253217,252619] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),Z)) | -is_a_theorem(Z) | -is_a_theorem(X).
% 254649 [binary:253217,252619,factor] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),X)) | -is_a_theorem(X).
% 254685 [binary:252541.2,254649,factor:binarycut:252596] is_a_theorem(equivalent(equivalent(X,Y),Y)) | -is_a_theorem(X).
% 254689 [binary:253218,254649] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Y))) | -is_a_theorem(X).
% 254694 [binary:252572,254685,slowcut:252533] is_a_theorem(equivalent(X,X)).
% 255643 [binary:254649,252640,cut:254694] is_a_theorem(equivalent(equivalent(X,X),Y)) | -is_a_theorem(Y).
% 255646 [binary:252633,255643,cut:254694] -is_a_theorem(equivalent(equivalent(X,X),Y)) | is_a_theorem(Y).
% 255647 [binary:252551,255643,cut:254694] -is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Z)) | is_a_theorem(equivalent(Z,Y)).
% 255677 [binary:254689,255646,cut:254694] is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Y)).
% 255710 [binary:252810,255677] is_a_theorem(equivalent(equivalent(X,X),Y)) | -is_a_theorem(equivalent(Y,Z)) | -is_a_theorem(Z).
% 256976 [binary:252571,254648] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Y))) | -is_a_theorem(Z) | is_a_theorem(X).
% 257384 [binary:252619,255647] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,X),Z),Z))) | -is_a_theorem(Y).
% 258549 [binary:252571,255710] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),Z)) | -is_a_theorem(Z) | is_a_theorem(X).
% 259437 [binary:256976,257384] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),Z)) | -is_a_theorem(X) | is_a_theorem(Y).
% 261176 [binary:252536,258549] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Y))) | -is_a_theorem(X) | is_a_theorem(Z).
% 261468 [binary:252619,259437] is_a_theorem(equivalent(equivalent(X,Y),Z)) | -is_a_theorem(equivalent(Y,Z)) | -is_a_theorem(X).
% 262219 [binary:257384,261176,factor] is_a_theorem(equivalent(equivalent(X,equivalent(X,Y)),Y)) | -is_a_theorem(X).
% 262292 [binary:255647,262219,cut:254694] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Y),X))).
% 262330 [binary:255647,262292] is_a_theorem(equivalent(equivalent(equivalent(X,X),equivalent(equivalent(Y,Y),Z)),Z)).
% 262348 [binary:252572,261468,slowcut:262330] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)).
% 262817 [binary:252533,262348] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),X)),Z)).
% 262818 [binary:252536,262348] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Z,Y))) | -is_a_theorem(X).
% 262821 [binary:252534,262348.2] -is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(c,b),a)),equivalent(a,b))).
% 262824 [binary:252572,262348.2] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(X,Z)) | -is_a_theorem(Y).
% 264328 [binary:252572,262817] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Z))) | -is_a_theorem(equivalent(Z,Y)).
% 273090 [binary:255647,262818] is_a_theorem(equivalent(equivalent(X,Y),X)) | -is_a_theorem(Y).
% 273208 [binary:262348,273090] is_a_theorem(equivalent(X,equivalent(X,Y))) | -is_a_theorem(Y).
% 280299 [binary:262824,264328] -is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Z,X)).
% 293949 [binary:273208,280299] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(Y,X)) | -is_a_theorem(Z).
% 299036 [binary:252533,293949] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(equivalent(Z,Y),X)).
% 301374 [binary:262817,299036,slowcut:262821] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 29
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8498
% derived clauses: 998520
% kept clauses: 228330
% kept size sum: 0
% kept mid-nuclei: 22403
% kept new demods: 0
% forw unit-subs: 251060
% forw double-subs: 71456
% forw overdouble-subs: 149963
% backward subs: 1297
% fast unit cutoff: 25033
% full unit cutoff: 1233
% dbl unit cutoff: 1029
% real runtime : 195.81
% process. runtime: 194.13
% specific non-discr-tree subsumption statistics:
% tried: 25134471
% length fails: 2020784
% strength fails: 4236500
% predlist fails: 1065726
% aux str. fails: 2734210
% by-lit fails: 2035200
% full subs tried: 12340916
% full subs fail: 12181770
%
% ; 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/LCL167-1+noeq.in")
%
%------------------------------------------------------------------------------