TSTP Solution File: LCL204-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL204-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 : art07.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 20.0s
% Output : Assurance 20.0s
% 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/LCL204-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,0,18,0,0,21766,4,2176,24958,5,2901,24958,1,2901,24958,50,2901,24958,40,2901,24967,0,2901)
%
%
% START OF PROOF
% 24960 [] axiom(or(not(X),or(Y,X))).
% 24961 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 24962 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 24964 [] -axiom(X) | theorem(X).
% 24965 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 24966 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 24967 [] -theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))).
% 24972 [binary:24964,24961] theorem(or(not(or(X,Y)),or(Y,X))).
% 24991 [binary:24965,24962] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 25018 [binary:24960,24966.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(Y),Z)).
% 25023 [binary:24961,24966.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(or(Y,X)),Z)).
% 25437 [binary:24972,25018] theorem(or(not(X),or(X,Y))).
% 25464 [binary:24991,25437] theorem(or(X,or(not(X),Y))).
% 25618 [binary:25464,25023] theorem(or(not(or(X,Y)),or(not(not(or(Y,X))),Z))).
% 29865 [binary:25018,25618] theorem(or(not(X),or(not(not(or(X,Y))),Z))).
% 29869 [binary:24991,29865,slowcut:24967] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 8504
% derived clauses: 777625
% kept clauses: 15432
% kept size sum: 291230
% kept mid-nuclei: 14082
% kept new demods: 0
% forw unit-subs: 36556
% forw double-subs: 315
% forw overdouble-subs: 143
% backward subs: 2
% fast unit cutoff: 3
% full unit cutoff: 8
% dbl unit cutoff: 0
% real runtime : 29.71
% process. runtime: 29.69
% specific non-discr-tree subsumption statistics:
% tried: 827
% length fails: 24
% strength fails: 171
% predlist fails: 189
% aux str. fails: 38
% by-lit fails: 6
% full subs tried: 399
% full subs fail: 256
%
% ; 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/LCL204-1+noeq.in")
%
%------------------------------------------------------------------------------