TSTP Solution File: LCL218-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL218-3 : TPTP v3.4.2. Released v2.3.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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 30.0s
% Output : Assurance 30.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/LCL218-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 4 5)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(10,40,0,20,0,0,11770,3,1501,15052,4,2251,17904,5,3001,17905,5,3001,17905,1,3001,17905,50,3003,17905,40,3003,17915,0,3003)
%
%
% START OF PROOF
% 17907 [] axiom(implies(or(X,X),X)).
% 17908 [] axiom(implies(X,or(Y,X))).
% 17909 [] axiom(implies(or(X,Y),or(Y,X))).
% 17910 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17911 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17912 [] equal(implies(X,Y),or(not(X),Y)).
% 17913 [] -axiom(X) | theorem(X).
% 17914 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17915 [] -theorem(implies(implies(or(p,q),q),implies(p,q))).
% 17917 [binary:17913,17907] theorem(implies(or(X,X),X)).
% 17918 [binary:17913,17908] theorem(implies(X,or(Y,X))).
% 17919 [binary:17913,17909] theorem(implies(or(X,Y),or(Y,X))).
% 17926 [binary:17913,17910] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17931 [binary:17918,17914] theorem(or(X,Y)) | -theorem(Y).
% 17945 [binary:17914,17919] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17949 [binary:17913,17911] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17959 [para:17912.1.2,17945.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17961 [para:17912.1.2,17926.1.1.1,demod:17912] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 17962 [para:17912.1.2,17926.1.1.1.2,demod:17912] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 17963 [binary:17914,17926] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 17969 [binary:17918,17959.2] theorem(or(or(X,Y),not(Y))).
% 17974 [binary:17931.2,17969] theorem(or(X,or(or(Y,Z),not(Z)))).
% 17984 [para:17912.1.2,17949.1.1.2.1,demod:17912] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 17985 [binary:17914,17949] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17990 [para:17912.1.2,17961.1.1.1.2,demod:17912] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 17992 [binary:17914,17962] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 17995 [binary:17974,17963] theorem(or(or(X,Y),or(Z,not(Y)))).
% 17999 [binary:17945,17995] theorem(or(or(X,not(Y)),or(Z,Y))).
% 18008 [binary:17917,17985.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 18011 [binary:17919,17985.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 18014 [binary:17914,18008] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 18021 [binary:17914,17990] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 18027 [binary:17999,18014] theorem(or(or(X,not(Y)),Y)).
% 18029 [binary:17945,18027] theorem(or(X,or(Y,not(X)))).
% 18069 [binary:17914,18011] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 18141 [binary:17984,18021] theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 18183 [binary:18029,18069,demod:17912] theorem(or(X,implies(X,Y))).
% 18190 [binary:17992,18183] theorem(implies(X,or(X,Y))).
% 18456 [binary:17914,18141] theorem(implies(implies(X,Y),implies(Z,Y))) | -theorem(implies(Z,X)).
% 19153 [binary:18190,18456.2,slowcut:17915] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred 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
% clause length limited to 5
% clause depth limited to 4
% seconds given: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1454
% derived clauses: 73804
% kept clauses: 16042
% kept size sum: 236936
% kept mid-nuclei: 2836
% kept new demods: 2
% forw unit-subs: 36454
% forw double-subs: 500
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 20
% dbl unit cutoff: 0
% real runtime : 30.23
% process. runtime: 30.23
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/LCL218-3+eq_r.in")
%
%------------------------------------------------------------------------------