TSTP Solution File: LCL227-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL227-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 : art04.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 119.5s
% Output : Assurance 119.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/LCL227-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,20924,4,2176,28318,5,2901,28318,1,2901,28318,50,2901,28318,40,2901,28327,0,2901,46038,3,3452,50110,4,3727,53703,5,4002,53703,1,4002,53703,50,4004,53703,40,4004,53712,0,4004,90473,3,4855,99435,4,5305,106008,5,5705,106008,5,5705,106008,1,5705,106008,50,5709,106008,40,5709,106017,0,5709,136547,4,7885,211783,1,8610,211783,50,8616,211783,40,8616,211792,0,8616,273849,3,10317,297739,4,11167,309452,5,12017,309452,1,12017,309452,50,12024,309452,40,12024,309461,0,12024)
%
%
% START OF PROOF
% 309453 [] axiom(or(not(or(X,X)),X)).
% 309454 [] axiom(or(not(X),or(Y,X))).
% 309455 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 309456 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 309457 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 309458 [] -axiom(X) | theorem(X).
% 309459 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 309460 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 309461 [] -theorem(or(not(or(not(q),or(not(r),s))),or(not(or(p,q)),or(not(or(p,r)),or(p,s))))).
% 309465 [binary:309458,309455] theorem(or(not(or(X,Y)),or(Y,X))).
% 309469 [binary:309453,309459] -theorem(or(X,X)) | theorem(X).
% 309470 [binary:309454,309459] theorem(or(X,Y)) | -theorem(Y).
% 309471 [binary:309455,309459] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 309473 [binary:309456,309459] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 309475 [binary:309457,309459] theorem(or(not(or(X,Y)),or(X,Z))) | -theorem(or(not(Y),Z)).
% 309481 [binary:309460,309465] -axiom(or(not(X),or(Y,Z))) | theorem(or(not(X),or(Z,Y))).
% 309500 [binary:309470,309473] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 309508 [binary:309460,309475] -axiom(or(not(X),or(Y,Z))) | theorem(or(not(X),or(Y,U))) | -theorem(or(not(Z),U)).
% 309529 [binary:309454,309481] theorem(or(not(X),or(X,Y))).
% 309570 [binary:309471,309500] theorem(or(or(X,Y),Z)) | -theorem(or(Z,Y)).
% 309588 [binary:309455,309508] theorem(or(not(or(X,Y)),or(Y,Z))) | -theorem(or(not(X),Z)).
% 309592 [binary:309457,309508] theorem(or(not(or(not(X),Y)),or(not(or(Z,X)),U))) | -theorem(or(not(or(Z,Y)),U)).
% 309714 [binary:309473,309570] theorem(or(X,or(or(Y,Z),U))) | -theorem(or(or(X,U),Z)).
% 309793 [binary:309473,309588] theorem(or(X,or(not(or(Y,X)),Z))) | -theorem(or(not(Y),Z)).
% 309808 [binary:309461,309592] -theorem(or(not(or(p,or(not(r),s))),or(not(or(p,r)),or(p,s)))).
% 309810 [binary:309460,309592] theorem(or(not(X),or(not(or(Y,Z)),U))) | -axiom(or(not(X),or(not(Z),V))) | -theorem(or(not(or(Y,V)),U)).
% 310156 [binary:309469,309714] -theorem(or(or(or(or(X,Y),Z),Z),Y)) | theorem(or(or(X,Y),Z)).
% 310494 [binary:309808,309810] -axiom(or(not(or(p,or(not(r),s))),or(not(r),X))) | -theorem(or(not(or(p,X)),or(p,s))).
% 311732 [binary:309570,310156] theorem(or(or(X,Y),Z)) | -theorem(or(Y,Z)).
% 312174 [binary:309469,311732] -theorem(or(X,or(Y,X))) | theorem(or(Y,X)).
% 312207 [binary:309793,312174] theorem(or(not(or(X,Y)),Y)) | -theorem(or(not(X),Y)).
% 314731 [binary:309456,310494] -theorem(or(not(or(p,or(p,s))),or(p,s))).
% 315921 [binary:314731,312207,cut:309529] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 40
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 21937
% derived clauses: 858680
% kept clauses: 215623
% kept size sum: 115028
% kept mid-nuclei: 54221
% kept new demods: 0
% forw unit-subs: 327439
% forw double-subs: 85615
% forw overdouble-subs: 6507
% backward subs: 254
% fast unit cutoff: 9
% full unit cutoff: 20
% dbl unit cutoff: 0
% real runtime : 122.10
% process. runtime: 121.54
% specific non-discr-tree subsumption statistics:
% tried: 148856
% length fails: 6021
% strength fails: 2321
% predlist fails: 60332
% aux str. fails: 1456
% by-lit fails: 202
% full subs tried: 71518
% full subs fail: 65006
%
% ; 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/LCL227-1+noeq.in")
%
%------------------------------------------------------------------------------