TSTP Solution File: LCL182-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL182-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 : art04.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/LCL182-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,11623,3,1528,14014,4,2260,16969,5,3001,16970,5,3001,16971,1,3002,16971,50,3003,16971,40,3003,16981,0,3003,20789,50,3412,20799,0,3412)
%
%
% START OF PROOF
% 20791 [] axiom(implies(or(X,X),X)).
% 20792 [] axiom(implies(X,or(Y,X))).
% 20793 [] axiom(implies(or(X,Y),or(Y,X))).
% 20794 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 20795 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 20796 [] equal(implies(X,Y),or(not(X),Y)).
% 20797 [] -axiom(X) | theorem(X).
% 20798 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 20799 [] -theorem(implies(implies(p,q),implies(not(q),not(p)))).
% 20801 [binary:20797,20791] theorem(implies(or(X,X),X)).
% 20802 [binary:20797,20792] theorem(implies(X,or(Y,X))).
% 20803 [binary:20797,20793] theorem(implies(or(X,Y),or(Y,X))).
% 20810 [binary:20797,20794] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 20814 [binary:20801,20798] -theorem(or(X,X)) | theorem(X).
% 20815 [binary:20802,20798] theorem(or(X,Y)) | -theorem(Y).
% 20829 [binary:20798,20803] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 20833 [binary:20797,20795] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 20864 [para:20796.1.2,20829.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 20878 [para:20796.1.2,20810.1.1.1,demod:20796] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 20880 [binary:20798,20810] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 20893 [binary:20802,20864.2] theorem(or(or(X,Y),not(Y))).
% 20904 [binary:20815.2,20893] theorem(or(X,or(or(Y,Z),not(Z)))).
% 20942 [binary:20798,20833] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 20961 [para:20796.1.2,20878.1.1.1.2,demod:20796] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 20962 [binary:20798,20878] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 20976 [binary:20904,20880] theorem(or(or(X,Y),or(Z,not(Y)))).
% 20985 [binary:20829,20976] theorem(or(or(X,not(Y)),or(Z,Y))).
% 20999 [binary:20880,20985] theorem(or(X,or(or(Y,not(Z)),Z))).
% 21012 [binary:20814,20999] theorem(or(or(X,not(Y)),Y)).
% 21015 [binary:20829,21012] theorem(or(X,or(Y,not(X)))).
% 21024 [binary:20880,21015] theorem(or(X,or(Y,not(Y)))).
% 21030 [binary:20814,21024] theorem(or(X,not(X))).
% 21035 [para:20796.1.2,21030.1.1] theorem(implies(X,not(not(X)))).
% 21163 [binary:21035,20942.2] theorem(implies(or(X,Y),or(X,not(not(Y))))).
% 21201 [binary:20798,21163] theorem(or(X,not(not(Y)))) | -theorem(or(X,Y)).
% 21287 [binary:20798,20961] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 21308 [binary:20803,20962] theorem(or(X,implies(or(Y,X),Y))).
% 21321 [binary:20829,21308] theorem(or(implies(or(X,Y),X),Y)).
% 21338 [binary:21201.2,21321] theorem(or(implies(or(X,Y),X),not(not(Y)))).
% 21719 [binary:20829,21338,demod:20796] theorem(implies(not(X),implies(or(Y,X),Y))).
% 21722 [para:20796.1.2,21719.1.1.2.1] theorem(implies(not(X),implies(implies(Y,X),not(Y)))).
% 23103 [binary:21722,21287,slowcut:20799] 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 5
% seconds given: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4272
% derived clauses: 291422
% kept clauses: 18718
% kept size sum: 273555
% kept mid-nuclei: 2933
% kept new demods: 3
% forw unit-subs: 87657
% forw double-subs: 1777
% forw overdouble-subs: 0
% backward subs: 17
% fast unit cutoff: 0
% full unit cutoff: 37
% dbl unit cutoff: 0
% real runtime : 34.61
% process. runtime: 34.60
% 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/LCL182-3+eq_r.in")
%
%------------------------------------------------------------------------------