TSTP Solution File: LCL199-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL199-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 29.6s
% Output : Assurance 29.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/LCL199-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,11732,3,1518,15088,4,2282,17457,5,3001,17458,5,3002,17458,1,3002,17458,50,3003,17458,40,3003,17468,0,3003)
%
%
% START OF PROOF
% 17460 [] axiom(implies(or(X,X),X)).
% 17461 [] axiom(implies(X,or(Y,X))).
% 17462 [] axiom(implies(or(X,Y),or(Y,X))).
% 17463 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17464 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17465 [] equal(implies(X,Y),or(not(X),Y)).
% 17466 [] -axiom(X) | theorem(X).
% 17467 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17468 [] -theorem(implies(not(or(p,q)),not(p))).
% 17470 [binary:17466,17460] theorem(implies(or(X,X),X)).
% 17471 [binary:17466,17461] theorem(implies(X,or(Y,X))).
% 17472 [binary:17466,17462] theorem(implies(or(X,Y),or(Y,X))).
% 17479 [binary:17466,17463] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17484 [binary:17471,17467] theorem(or(X,Y)) | -theorem(Y).
% 17498 [binary:17467,17472] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17502 [binary:17466,17464] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17512 [para:17465.1.2,17498.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17514 [para:17465.1.2,17479.1.1.1,demod:17465] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 17515 [para:17465.1.2,17479.1.1.1.2,demod:17465] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 17516 [binary:17467,17479] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 17522 [binary:17471,17512.2] theorem(or(or(X,Y),not(Y))).
% 17527 [binary:17484.2,17522] theorem(or(X,or(or(Y,Z),not(Z)))).
% 17537 [para:17465.1.2,17502.1.1.2.1,demod:17465] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 17538 [binary:17467,17502] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17543 [para:17465.1.2,17514.1.1.1.2,demod:17465] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 17545 [binary:17467,17515] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 17548 [binary:17527,17516] theorem(or(or(X,Y),or(Z,not(Y)))).
% 17552 [binary:17498,17548] theorem(or(or(X,not(Y)),or(Z,Y))).
% 17561 [binary:17470,17538.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17564 [binary:17472,17538.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17566 [para:17465.1.2,17561.1.1.1,demod:17465] theorem(implies(implies(X,or(Y,Y)),implies(X,Y))).
% 17567 [binary:17467,17561] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 17574 [binary:17467,17543] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 17577 [binary:17467,17566] -theorem(implies(X,or(Y,Y))) | theorem(implies(X,Y)).
% 17580 [binary:17552,17567] theorem(or(or(X,not(Y)),Y)).
% 17582 [binary:17498,17580] theorem(or(X,or(Y,not(X)))).
% 17622 [binary:17467,17564] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 17694 [binary:17537,17574] theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 17703 [para:17465.1.2,17577.1.1.2] -theorem(implies(X,implies(Y,not(Y)))) | theorem(implies(X,not(Y))).
% 17736 [binary:17582,17622,demod:17465] theorem(or(X,implies(X,Y))).
% 17743 [binary:17545,17736] theorem(implies(X,or(X,Y))).
% 18009 [binary:17467,17694] theorem(implies(implies(X,Y),implies(Z,Y))) | -theorem(implies(Z,X)).
% 18705 [binary:17743,18009.2] theorem(implies(implies(or(X,Y),Z),implies(X,Z))).
% 18755 [binary:17467,18705] -theorem(implies(or(X,Y),Z)) | theorem(implies(X,Z)).
% 18758 [binary:17703,18705] theorem(implies(implies(or(X,Y),not(X)),not(X))).
% 18867 [para:17465.1.2,18755.1.1.1] -theorem(implies(implies(X,Y),Z)) | theorem(implies(not(X),Z)).
% 18978 [binary:18758,18867,slowcut:17468] 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: 1604
% derived clauses: 78868
% kept clauses: 16300
% kept size sum: 254406
% kept mid-nuclei: 2359
% kept new demods: 2
% forw unit-subs: 37792
% forw double-subs: 562
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 17
% dbl unit cutoff: 0
% real runtime : 30.97
% process. runtime: 30.36
% 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/LCL199-3+eq_r.in")
%
%------------------------------------------------------------------------------