TSTP Solution File: LCL234-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL234-1 : TPTP v3.4.2. Bugfixed v2.3.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 49.6s
% Output : Assurance 49.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/LCL234-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,21738,4,2177,25969,5,2902,25970,1,2902,25970,50,2903,25970,40,2903,25979,0,2903,37845,3,3454,39259,4,3729,43525,5,4004,43525,1,4004,43525,50,4005,43525,40,4005,43534,0,4005,73375,3,4856,83084,4,5291)
%
%
% START OF PROOF
% 43526 [] axiom(or(not(or(X,X)),X)).
% 43527 [] axiom(or(not(X),or(Y,X))).
% 43528 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 43529 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 43530 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 43531 [] -axiom(X) | theorem(X).
% 43532 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 43533 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 43534 [] -theorem(or(not(p),or(not(q),not(or(not(p),not(q)))))).
% 43539 [binary:43531,43528] theorem(or(not(or(X,Y)),or(Y,X))).
% 43542 [binary:43526,43532] -theorem(or(X,X)) | theorem(X).
% 43543 [binary:43527,43532] theorem(or(X,Y)) | -theorem(Y).
% 43546 [binary:43528,43532] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 43559 [binary:43532.2,43543] -axiom(or(not(or(X,Y)),Z)) | -theorem(Y) | theorem(Z).
% 43568 [binary:43532,43529] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 43588 [binary:43532,43530] theorem(or(not(or(X,Y)),or(X,Z))) | -theorem(or(not(Y),Z)).
% 43623 [binary:43527,43533.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(Y),Z)).
% 43628 [binary:43528,43533.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(or(Y,X)),Z)).
% 44122 [binary:43529,43559] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 44362 [binary:43534,43568.2] -theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))).
% 45709 [binary:44122.2,44122] theorem(or(X,or(Y,or(Z,U)))) | -theorem(or(X,U)).
% 48194 [binary:43539,43623] theorem(or(not(X),or(X,Y))).
% 48345 [binary:43588.2,48194] theorem(or(not(or(X,Y)),or(X,or(Y,Z)))).
% 60774 [binary:43628,48345] theorem(or(not(or(X,Y)),or(Y,or(X,Z)))).
% 64878 [binary:43546,60774] theorem(or(or(X,or(Y,Z)),not(or(Y,X)))).
% 83005 [binary:64878,45709.2] theorem(or(or(X,or(Y,Z)),or(U,or(V,not(or(Y,X)))))).
% 83094 [binary:83005,43542,slowcut:44362] 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 double 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: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 12046
% derived clauses: 384481
% kept clauses: 61158
% kept size sum: 0
% kept mid-nuclei: 19945
% kept new demods: 0
% forw unit-subs: 86465
% forw double-subs: 28604
% forw overdouble-subs: 7988
% backward subs: 87
% fast unit cutoff: 0
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 53.60
% process. runtime: 53.4
% specific non-discr-tree subsumption statistics:
% tried: 164339
% length fails: 7620
% strength fails: 3345
% predlist fails: 62007
% aux str. fails: 249
% by-lit fails: 198
% full subs tried: 84393
% full subs fail: 76405
%
% ; 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/LCL234-1+noeq.in")
%
%------------------------------------------------------------------------------