TSTP Solution File: LCL219-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL219-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 : art07.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/LCL219-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,12113,3,1512,15631,4,2282,18925,5,3001,18926,5,3002,18926,1,3002,18926,50,3003,18926,40,3003,18936,0,3003)
%
%
% START OF PROOF
% 18928 [] axiom(implies(or(X,X),X)).
% 18929 [] axiom(implies(X,or(Y,X))).
% 18930 [] axiom(implies(or(X,Y),or(Y,X))).
% 18931 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18932 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18933 [] equal(implies(X,Y),or(not(X),Y)).
% 18934 [] -axiom(X) | theorem(X).
% 18935 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 18936 [] -theorem(implies(implies(implies(p,q),q),or(p,q))).
% 18938 [binary:18934,18928] theorem(implies(or(X,X),X)).
% 18939 [binary:18934,18929] theorem(implies(X,or(Y,X))).
% 18940 [binary:18934,18930] theorem(implies(or(X,Y),or(Y,X))).
% 18947 [binary:18934,18931] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 18952 [binary:18939,18935] theorem(or(X,Y)) | -theorem(Y).
% 18966 [binary:18935,18940] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 18970 [binary:18934,18932] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 18980 [para:18933.1.2,18966.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 18982 [para:18933.1.2,18947.1.1.1,demod:18933] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 18984 [binary:18935,18947] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 18990 [binary:18939,18980.2] theorem(or(or(X,Y),not(Y))).
% 18995 [binary:18952.2,18990] theorem(or(X,or(or(Y,Z),not(Z)))).
% 19006 [binary:18935,18970] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 19011 [para:18933.1.2,18982.1.1.1.2,demod:18933] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 19016 [binary:18995,18984] theorem(or(or(X,Y),or(Z,not(Y)))).
% 19020 [binary:18966,19016] theorem(or(or(X,not(Y)),or(Z,Y))).
% 19029 [binary:18938,19006.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 19032 [binary:18940,19006.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 19035 [binary:18935,19029] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 19042 [binary:18935,19011] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 19048 [binary:19020,19035] theorem(or(or(X,not(Y)),Y)).
% 19050 [binary:18966,19048] theorem(or(X,or(Y,not(X)))).
% 19090 [binary:18935,19032] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 19161 [binary:18970,19042] theorem(implies(or(X,Y),implies(implies(Y,Z),or(X,Z)))).
% 19204 [binary:19050,19090,demod:18933] theorem(or(X,implies(X,Y))).
% 19472 [binary:18935,19161] theorem(implies(implies(X,Y),or(Z,Y))) | -theorem(or(Z,X)).
% 20119 [binary:19204,19472.2,slowcut:18936] 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: 1450
% derived clauses: 75863
% kept clauses: 16563
% kept size sum: 247168
% kept mid-nuclei: 3283
% kept new demods: 2
% forw unit-subs: 38248
% forw double-subs: 484
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 20
% dbl unit cutoff: 0
% real runtime : 30.25
% 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/LCL219-3+eq_r.in")
%
%------------------------------------------------------------------------------