TSTP Solution File: LCL311-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL311-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 : art10.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 109.6s
% Output : Assurance 109.6s
% 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/LCL311-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 5)
% (binary-unit 28 #f 4 5)
% (binary-double 28 #f 4 5)
% (binary 45 #t 4 5)
% (hyper 11 #t 4 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(12,40,0,24,0,0,15975,3,2851,19106,4,4276,22032,5,5701,22033,5,5702,22034,1,5702,22034,50,5704,22034,40,5704,22046,0,5704,31535,3,7105,33427,4,7807,34960,5,8505,34960,5,8505,34960,1,8505,34960,50,8506,34960,40,8506,34972,0,8506,102134,3,9918,124172,4,10610)
%
%
% START OF PROOF
% 34962 [] axiom(implies(or(X,X),X)).
% 34963 [] axiom(implies(X,or(Y,X))).
% 34964 [] axiom(implies(or(X,Y),or(Y,X))).
% 34965 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 34967 [] equal(implies(X,Y),or(not(X),Y)).
% 34968 [] -axiom(X) | theorem(X).
% 34969 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 34970 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 34971 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 34972 [] -theorem(equivalent(implies(p,not(p)),not(p))).
% 34974 [binary:34968,34962] theorem(implies(or(X,X),X)).
% 34975 [binary:34968,34963] theorem(implies(X,or(Y,X))).
% 34980 [para:34967.1.2,34974.1.1.1] theorem(implies(implies(X,not(X)),not(X))).
% 34981 [para:34967.1.2,34975.1.1.2] theorem(implies(X,implies(Y,X))).
% 34983 [para:34967.1.2,34964.1.1.2] axiom(implies(or(X,not(Y)),implies(Y,X))).
% 34985 [para:34967.1.2,34965.1.1.1,demod:34967] axiom(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 34988 [binary:34968.2,34969] -axiom(implies(X,Y)) | -theorem(X) | theorem(Y).
% 34990 [binary:34974,34969] -theorem(or(X,X)) | theorem(X).
% 35056 [para:34970.1.2,34967.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 35139 [binary:34975,34988.2] -axiom(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 35162 [binary:34988,34983] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 39094 [binary:34969,35162.2] -theorem(or(X,not(Y))) | -theorem(Y) | theorem(X).
% 40683 [binary:34985,35139] theorem(or(X,implies(Y,Y))).
% 40821 [binary:34990,40683] theorem(implies(X,X)).
% 40850 [binary:34988.2,40821] -axiom(implies(implies(X,X),Y)) | theorem(Y).
% 44071 [binary:34985,40850] theorem(or(X,implies(or(X,Y),Y))).
% 45461 [para:34967.1.2,44071.1.1,demod:34967] theorem(implies(X,implies(implies(X,Y),Y))).
% 45690 [binary:34969,45461] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 45760 [para:35056.1.1,45690.1.1] theorem(or(and(X,Y),not(Y))) | -theorem(X).
% 67312 [binary:39094,45760] theorem(and(X,Y)) | -theorem(Y) | -theorem(X).
% 67645 [para:34971.1.2,67312.1.1] -theorem(implies(X,Y)) | -theorem(implies(Y,X)) | theorem(equivalent(Y,X)).
% 131802 [binary:34980,67645.2,cut:34981,slowcut:34972] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double 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: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13455
% derived clauses: 2389248
% kept clauses: 104845
% kept size sum: 0
% kept mid-nuclei: 12088
% kept new demods: 18
% forw unit-subs: 301181
% forw double-subs: 137127
% forw overdouble-subs: 11840
% backward subs: 204
% fast unit cutoff: 64
% full unit cutoff: 38
% dbl unit cutoff: 0
% real runtime : 110.72
% process. runtime: 110.19
% specific non-discr-tree subsumption statistics:
% tried: 397536
% length fails: 9062
% strength fails: 997
% predlist fails: 180703
% aux str. fails: 352
% by-lit fails: 1136
% full subs tried: 196724
% full subs fail: 184884
%
% ; 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/LCL311-3+eq_r.in")
%
%------------------------------------------------------------------------------