TSTP Solution File: LCL019-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL019-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 : art08.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.1s
% Output : Assurance 188.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/LCL019-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,1,6,0,1,9,50,1,12,0,1,17,50,1,20,0,2,25,50,2,28,0,2,41156,4,2110,41361,5,2803,41362,1,2809,41362,50,2813,41362,40,2813,41365,0,2813,41368,50,2813,41371,0,2818,41379,50,2818,41382,0,2818,41394,50,2818,41397,0,2818,45815,3,3331,46761,4,3586,47612,5,3819,47614,5,3819,47614,1,3819,47614,50,3820,47614,40,3820,47617,0,3825,95142,3,4681,108541,4,5101,112804,5,5526,112805,5,5527,112805,1,5527,112805,50,5530,112805,40,5530,112808,0,5530,168402,4,7714,168597,5,8435,168598,1,8438,168598,50,8443,168598,40,8443,168601,0,8443,176328,3,10160,177935,4,10999,179839,5,11844,179841,5,11845,179841,1,11845,179841,50,11846,179841,40,11846,179844,0,11846,213694,3,13848,224472,4,14849,236957,5,15847,236958,1,15847,236958,50,15849,236958,40,15849,236961,0,15849,265342,3,16700,267045,4,17125,269446,5,17550,269447,5,17550,269448,1,17550,269448,50,17551,269448,40,17551,269451,0,17551,311130,3,19003)
%
%
% START OF PROOF
% 269449 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 269450 [] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,X)),equivalent(Z,Y)))).
% 269451 [] -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),b),equivalent(c,a))).
% 269453 [binary:269449,269450] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Y,X))) | -is_a_theorem(Z).
% 269455 [binary:269449,269453] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(Y,X)) | -is_a_theorem(Z).
% 269457 [binary:269450,269455] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),Z)) | -is_a_theorem(equivalent(Y,X)).
% 269459 [binary:269453,269455,factor] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Y)))) | -is_a_theorem(Y).
% 269463 [binary:269455,269459] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)) | -is_a_theorem(Y).
% 269477 [binary:269449,269457] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | -is_a_theorem(equivalent(Y,X)) | is_a_theorem(Z).
% 269478 [binary:269455,269457] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Z,equivalent(X,U))))) | -is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(U).
% 269481 [binary:269449,269463.2] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(Y) | is_a_theorem(X).
% 269483 [binary:269450,269463,binarydemod:269453] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Y,X)),Z)) | -is_a_theorem(Z).
% 269494 [binary:269450,269481] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Y,X))) | is_a_theorem(Z).
% 269497 [binary:269459,269481] -is_a_theorem(equivalent(X,equivalent(Y,X))) | -is_a_theorem(X) | is_a_theorem(Y).
% 269499 [binary:269463.2,269497] -is_a_theorem(equivalent(equivalent(X,Y),Y)) | -is_a_theorem(Y) | is_a_theorem(X).
% 269547 [binary:269450,269477] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),Z)) | is_a_theorem(equivalent(Y,X)).
% 269548 [binary:269453,269477] -is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Z)))) | -is_a_theorem(Z) | is_a_theorem(Y).
% 269608 [binary:269455,269478] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | -is_a_theorem(equivalent(X,U)) | is_a_theorem(equivalent(U,Y)) | -is_a_theorem(Z).
% 269902 [binary:269450,269548] is_a_theorem(equivalent(X,equivalent(Y,Y))) | -is_a_theorem(X).
% 269922 [binary:269449,269902,slowcut:269450] is_a_theorem(equivalent(X,X)).
% 269924 [binary:269499,269902,cut:269922] -is_a_theorem(equivalent(X,equivalent(Y,Y))) | is_a_theorem(X).
% 269926 [binary:269494,269902] -is_a_theorem(equivalent(X,equivalent(X,Y))) | is_a_theorem(Y).
% 269928 [binary:269547,269902] -is_a_theorem(equivalent(X,equivalent(Y,equivalent(Z,Z)))) | is_a_theorem(equivalent(Y,X)).
% 269939 [binary:269483,269924,cut:269922] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,Z))),equivalent(Y,X))).
% 269956 [binary:269478,269926] is_a_theorem(equivalent(X,equivalent(Y,Z))) | -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(Z).
% 271520 [binary:269478,269928] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(Z,X)) | -is_a_theorem(Y).
% 271736 [binary:269928,269939] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Y),equivalent(X,equivalent(Z,Z))))).
% 271791 [binary:269455,269956,slowcut:271736] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)).
% 271896 [binary:269450,271791] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Y,X)),Z)).
% 271910 [binary:269547,271791.2] -is_a_theorem(equivalent(X,equivalent(Y,equivalent(Z,X)))) | is_a_theorem(equivalent(Z,Y)).
% 271937 [binary:269939,271791] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,equivalent(X,equivalent(Z,Z))))).
% 273416 [binary:269457,271520] -is_a_theorem(equivalent(X,Z)) | -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Z,Y)).
% 280061 [binary:269547,271896] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Y)))).
% 280651 [binary:269608,271937,binarydemod:269902] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(X).
% 296090 [binary:271896,280651] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(Z,equivalent(Y,X))).
% 312079 [binary:269450,296090] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Y,equivalent(X,Z)),Z))).
% 312087 [binary:280061,296090] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))).
% 312125 [binary:273416,312087] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(equivalent(Y,X),Z)).
% 315023 [binary:271910,312079] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Z,equivalent(X,equivalent(Z,Y)))))).
% 315820 [binary:269451,312125.2] -is_a_theorem(equivalent(equivalent(b,equivalent(a,equivalent(b,c))),equivalent(c,a))).
% 315972 [binary:296090.2,315820,cut:315023] 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: 6662
% derived clauses: 1199984
% kept clauses: 253708
% kept size sum: 0
% kept mid-nuclei: 23480
% kept new demods: 0
% forw unit-subs: 370597
% forw double-subs: 145846
% forw overdouble-subs: 131591
% backward subs: 1347
% fast unit cutoff: 16190
% full unit cutoff: 1928
% dbl unit cutoff: 1267
% real runtime : 196.55
% process. runtime: 194.46
% specific non-discr-tree subsumption statistics:
% tried: 31760584
% length fails: 3412797
% strength fails: 5647922
% predlist fails: 1468533
% aux str. fails: 5950794
% by-lit fails: 1541707
% full subs tried: 12846586
% full subs fail: 12706192
%
% ; 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/LCL019-1+noeq.in")
%
%------------------------------------------------------------------------------