TSTP Solution File: LCL198-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL198-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 : 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 29.5s
% Output : Assurance 29.5s
% 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/LCL198-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 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(9,40,1,18,0,1,21680,4,2177,24940,5,2902,24940,1,2902,24940,50,2903,24940,40,2903,24949,0,2903,39513,3,3454)
%
%
% START OF PROOF
% 24941 [] axiom(or(not(or(X,X)),X)).
% 24942 [] axiom(or(not(X),or(Y,X))).
% 24943 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 24944 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 24945 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 24946 [] -axiom(X) | theorem(X).
% 24947 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 24948 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 24949 [] -theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))).
% 24954 [binary:24946,24943] theorem(or(not(or(X,Y)),or(Y,X))).
% 24956 [binary:24941,24947] -theorem(or(X,X)) | theorem(X).
% 24957 [binary:24942,24947] theorem(or(X,Y)) | -theorem(Y).
% 24960 [binary:24943,24947] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 24973 [binary:24947,24944] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 24985 [binary:24947,24945] theorem(or(not(or(X,Y)),or(X,Z))) | -theorem(or(not(Y),Z)).
% 25000 [binary:24942,24948.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(Y),Z)).
% 25004 [binary:24949,24948.3] -axiom(or(not(or(not(p),or(not(p),q))),X)) | -theorem(or(not(X),or(not(p),q))).
% 25442 [binary:24954,25000] theorem(or(not(X),or(X,Y))).
% 25461 [binary:24985.2,25442] theorem(or(not(or(X,Y)),or(X,or(Y,Z)))).
% 25588 [binary:24943,25004] -theorem(or(not(or(or(not(p),q),not(p))),or(not(p),q))).
% 27812 [binary:24973,25461] theorem(or(X,or(not(or(X,Y)),or(Y,Z)))).
% 28889 [binary:24960,27812] theorem(or(or(not(or(X,Y)),or(Y,Z)),X)).
% 29478 [binary:24957.2,28889] theorem(or(X,or(or(not(or(Y,Z)),or(Z,U)),Y))).
% 37274 [binary:24973,29478] theorem(or(or(not(or(X,Y)),or(Y,Z)),or(U,X))).
% 39780 [binary:24956,37274,slowcut:25588] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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
% clause length limited to 5
% clause depth limited to 6
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9746
% derived clauses: 814368
% kept clauses: 25372
% kept size sum: 478134
% kept mid-nuclei: 14055
% kept new demods: 0
% forw unit-subs: 42116
% forw double-subs: 410
% forw overdouble-subs: 165
% backward subs: 17
% fast unit cutoff: 3
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 35.61
% process. runtime: 35.5
% specific non-discr-tree subsumption statistics:
% tried: 1092
% length fails: 45
% strength fails: 241
% predlist fails: 203
% aux str. fails: 17
% by-lit fails: 8
% full subs tried: 564
% full subs fail: 399
%
% ; 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/LCL198-1+noeq.in")
%
%------------------------------------------------------------------------------