TSTP Solution File: LCL194-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL194-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 : art06.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 59.5s
% Output : Assurance 59.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/LCL194-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(9,40,1,18,0,1,836,50,6,845,0,6,22173,4,2107,26171,5,2807,26172,1,2807,26172,50,2808,26172,40,2808,26181,0,2808,31591,3,3359,32320,4,3634,32977,5,3909,32977,1,3909,32977,50,3909,32977,40,3909,32986,0,3909,61728,3,4762,70299,4,5185,77229,5,5610,77229,1,5610,77229,50,5613,77229,40,5613,77238,0,5613)
%
%
% START OF PROOF
% 77230 [] axiom(or(not(or(X,X)),X)).
% 77231 [] axiom(or(not(X),or(Y,X))).
% 77232 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 77233 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 77234 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 77235 [] -axiom(X) | theorem(X).
% 77236 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 77237 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 77238 [] -theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))).
% 77240 [hyper:77235,77230] theorem(or(not(or(X,X)),X)).
% 77250 [hyper:77237,77240,77231] theorem(or(not(X),X)).
% 77283 [hyper:77236,77233,77250] theorem(or(X,or(not(or(X,Y)),Y))).
% 77477 [hyper:77237,77283,77232] theorem(or(not(or(X,Y)),or(not(or(not(or(Y,X)),Z)),Z))).
% 79499 [hyper:77236,77477,77233] theorem(or(not(or(not(or(X,Y)),Z)),or(not(or(Y,X)),Z))).
% 96076 [hyper:77237,79499,77234,slowcut:77238] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% seconds given: 29
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 17392
% derived clauses: 1754512
% kept clauses: 63752
% kept size sum: 0
% kept mid-nuclei: 30315
% kept new demods: 0
% forw unit-subs: 237159
% forw double-subs: 121740
% forw overdouble-subs: 12738
% backward subs: 182
% fast unit cutoff: 2
% full unit cutoff: 5
% dbl unit cutoff: 0
% real runtime : 64.92
% process. runtime: 64.40
% specific non-discr-tree subsumption statistics:
% tried: 241319
% length fails: 14669
% strength fails: 341
% predlist fails: 98956
% aux str. fails: 370
% by-lit fails: 96
% full subs tried: 114884
% full subs fail: 102146
%
% ; 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/LCL194-1+noeq.in")
%
%------------------------------------------------------------------------------