TSTP Solution File: LCL201-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL201-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 : art03.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 29.5s
% Output : Assurance 29.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/LCL201-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,11626,3,1506,15086,4,2257,17842,5,3001,17842,5,3001,17843,1,3001,17843,50,3003,17843,40,3003,17853,0,3003)
%
%
% START OF PROOF
% 17845 [] axiom(implies(or(X,X),X)).
% 17846 [] axiom(implies(X,or(Y,X))).
% 17847 [] axiom(implies(or(X,Y),or(Y,X))).
% 17848 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17849 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17850 [] equal(implies(X,Y),or(not(X),Y)).
% 17851 [] -axiom(X) | theorem(X).
% 17852 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17853 [] -theorem(implies(not(or(p,q)),implies(p,q))).
% 17855 [binary:17851,17845] theorem(implies(or(X,X),X)).
% 17856 [binary:17851,17846] theorem(implies(X,or(Y,X))).
% 17857 [binary:17851,17847] theorem(implies(or(X,Y),or(Y,X))).
% 17864 [binary:17851,17848] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17869 [binary:17856,17852] theorem(or(X,Y)) | -theorem(Y).
% 17883 [binary:17852,17857] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17887 [binary:17851,17849] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17897 [para:17850.1.2,17883.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17899 [para:17850.1.2,17864.1.1.1,demod:17850] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 17900 [para:17850.1.2,17864.1.1.1.2,demod:17850] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 17901 [binary:17852,17864] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 17907 [binary:17856,17897.2] theorem(or(or(X,Y),not(Y))).
% 17912 [binary:17869.2,17907] theorem(or(X,or(or(Y,Z),not(Z)))).
% 17922 [para:17850.1.2,17887.1.1.2.1,demod:17850] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 17923 [binary:17852,17887] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17928 [para:17850.1.2,17899.1.1.1.2,demod:17850] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 17930 [binary:17852,17900] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 17933 [binary:17912,17901] theorem(or(or(X,Y),or(Z,not(Y)))).
% 17937 [binary:17883,17933] theorem(or(or(X,not(Y)),or(Z,Y))).
% 17946 [binary:17855,17923.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17949 [binary:17857,17923.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17952 [binary:17852,17946] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 17959 [binary:17852,17928] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 17965 [binary:17937,17952] theorem(or(or(X,not(Y)),Y)).
% 17967 [binary:17883,17965] theorem(or(X,or(Y,not(X)))).
% 18007 [binary:17852,17949] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 18079 [binary:17922,17959] theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 18121 [binary:17967,18007,demod:17850] theorem(or(X,implies(X,Y))).
% 18128 [binary:17930,18121] theorem(implies(X,or(X,Y))).
% 18394 [binary:17852,18079] theorem(implies(implies(X,Y),implies(Z,Y))) | -theorem(implies(Z,X)).
% 19090 [binary:18128,18394.2] theorem(implies(implies(or(X,Y),Z),implies(X,Z))).
% 19140 [binary:17852,19090] -theorem(implies(or(X,Y),Z)) | theorem(implies(X,Z)).
% 19252 [para:17850.1.2,19140.1.1.1] -theorem(implies(implies(X,Y),Z)) | theorem(implies(not(X),Z)).
% 19360 [binary:19090,19252,slowcut:17853] 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: 1579
% derived clauses: 79633
% kept clauses: 16298
% kept size sum: 240087
% kept mid-nuclei: 2746
% kept new demods: 2
% forw unit-subs: 38181
% forw double-subs: 556
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 12
% dbl unit cutoff: 0
% real runtime : 30.83
% process. runtime: 30.32
% 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/LCL201-3+eq_r.in")
%
%------------------------------------------------------------------------------