TSTP Solution File: LCL253-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL253-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 : 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 119.7s
% Output : Assurance 119.7s
% 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/LCL253-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 7 5)
% (binary-unit 11 #f 7 5)
% (binary-double 17 #f 7 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 7 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(9,40,1,18,0,1,23180,4,2178,29362,1,2902,29362,50,2903,29362,40,2903,29371,0,2903,51986,3,3454,57701,4,3729,63007,5,4004,63008,1,4005,63008,50,4008,63008,40,4008,63017,0,4008,103144,3,4863,119040,4,5288,128477,5,5713,128477,5,5715,128477,1,5715,128477,50,5719,128477,40,5719,128486,0,5719,158356,4,7895,301023,5,8620,301024,1,8620,301024,50,8626,301024,40,8626,301033,0,8626,366394,3,10327,392990,4,11178,406871,5,12027,406872,5,12029,406873,1,12029,406873,50,12037,406873,40,12037,406882,0,12037)
%
%
% START OF PROOF
% 406874 [] axiom(or(not(or(X,X)),X)).
% 406875 [] axiom(or(not(X),or(Y,X))).
% 406876 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 406877 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 406878 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 406879 [] -axiom(X) | theorem(X).
% 406880 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 406881 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 406882 [] -theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))).
% 406886 [binary:406879,406876] theorem(or(not(or(X,Y)),or(Y,X))).
% 406890 [binary:406874,406880] -theorem(or(X,X)) | theorem(X).
% 406891 [binary:406875,406880] theorem(or(X,Y)) | -theorem(Y).
% 406892 [binary:406876,406880] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 406894 [binary:406877,406880] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 406896 [binary:406878,406880] theorem(or(not(or(X,Y)),or(X,Z))) | -theorem(or(not(Y),Z)).
% 406902 [binary:406881,406886] -axiom(or(not(X),or(Y,Z))) | theorem(or(not(X),or(Z,Y))).
% 406921 [binary:406891,406894] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 406929 [binary:406881,406896] -axiom(or(not(X),or(Y,Z))) | theorem(or(not(X),or(Y,U))) | -theorem(or(not(Z),U)).
% 406951 [binary:406875,406902] theorem(or(not(X),or(X,Y))).
% 406968 [binary:406894,406951] theorem(or(X,or(not(X),Y))).
% 406987 [binary:406890,406921] -theorem(or(or(X,Y),Y)) | theorem(or(X,Y)).
% 407006 [binary:406878,406929] theorem(or(not(or(not(X),Y)),or(not(or(Z,X)),U))) | -theorem(or(not(or(Z,Y)),U)).
% 407056 [binary:406921,406987] -theorem(or(or(X,or(Y,Z)),Z)) | theorem(or(X,or(Y,Z))).
% 407228 [binary:406892,407006] theorem(or(or(not(or(X,Y)),Z),not(or(not(Y),U)))) | -theorem(or(not(or(X,U)),Z)).
% 407913 [binary:407056,407228] -theorem(or(not(or(X,Y)),or(Z,not(or(not(U),Y))))) | theorem(or(not(or(X,U)),or(Z,not(or(not(U),Y))))).
% 412525 [binary:406968,407913,slowcut:406882] 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: 19558
% derived clauses: 961594
% kept clauses: 247217
% kept size sum: 98319
% kept mid-nuclei: 114341
% kept new demods: 0
% forw unit-subs: 350877
% forw double-subs: 66493
% forw overdouble-subs: 12538
% backward subs: 53
% fast unit cutoff: 7
% full unit cutoff: 5
% dbl unit cutoff: 0
% real runtime : 121.72
% process. runtime: 121.27
% specific non-discr-tree subsumption statistics:
% tried: 253370
% length fails: 11277
% strength fails: 1687
% predlist fails: 91189
% aux str. fails: 1238
% by-lit fails: 149
% full subs tried: 139278
% full subs fail: 126735
%
% ; 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/LCL253-1+noeq.in")
%
%------------------------------------------------------------------------------