TSTP Solution File: LCL259-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL259-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 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/LCL259-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,11801,3,1503,14595,4,2252,17497,5,3001,17498,5,3001,17499,1,3001,17499,50,3003,17499,40,3003,17509,0,3003)
%
%
% START OF PROOF
% 17501 [] axiom(implies(or(X,X),X)).
% 17502 [] axiom(implies(X,or(Y,X))).
% 17503 [] axiom(implies(or(X,Y),or(Y,X))).
% 17504 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17505 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17506 [] equal(implies(X,Y),or(not(X),Y)).
% 17507 [] -axiom(X) | theorem(X).
% 17508 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 17509 [] -theorem(implies(implies(p,implies(p,q)),implies(p,q))).
% 17511 [binary:17507,17501] theorem(implies(or(X,X),X)).
% 17512 [binary:17507,17502] theorem(implies(X,or(Y,X))).
% 17513 [binary:17507,17503] theorem(implies(or(X,Y),or(Y,X))).
% 17517 [para:17506.1.2,17512.1.1.2] theorem(implies(X,implies(Y,X))).
% 17520 [binary:17507,17504] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 17524 [binary:17511,17508] -theorem(or(X,X)) | theorem(X).
% 17539 [binary:17508,17513] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 17543 [binary:17507,17505] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 17553 [para:17506.1.2,17539.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 17555 [para:17506.1.2,17520.1.1.1,demod:17506] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 17579 [binary:17508,17543] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 17585 [binary:17508,17555] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 17602 [binary:17511,17579.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 17603 [binary:17512,17579.2] theorem(implies(or(X,Y),or(X,or(Z,Y)))).
% 17604 [binary:17517,17579.2] theorem(implies(or(X,Y),or(X,implies(Z,Y)))).
% 17605 [binary:17513,17579.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 17607 [para:17506.1.2,17602.1.1.1,demod:17506] theorem(implies(implies(X,or(Y,Y)),implies(X,Y))).
% 17610 [binary:17508,17603] theorem(or(X,or(Y,Z))) | -theorem(or(X,Z)).
% 17618 [binary:17508,17607] -theorem(implies(X,or(Y,Y))) | theorem(implies(X,Y)).
% 17626 [binary:17512,17585] theorem(or(X,implies(Y,Y))).
% 17632 [binary:17524,17626] theorem(implies(X,X)).
% 17642 [binary:17585,17632] theorem(or(X,implies(or(X,Y),Y))).
% 17663 [binary:17508,17605] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 17665 [para:17506.1.2,17642.1.1,demod:17506] theorem(implies(X,implies(implies(X,Y),Y))).
% 17693 [binary:17553.2,17665] theorem(or(implies(implies(X,Y),Y),not(X))).
% 17730 [binary:17610.2,17693] theorem(or(implies(implies(X,Y),Y),or(Z,not(X)))).
% 17747 [binary:17604,17618] theorem(implies(or(implies(X,Y),Y),implies(X,Y))).
% 17970 [binary:17508,17747] -theorem(or(implies(X,Y),Y)) | theorem(implies(X,Y)).
% 18033 [binary:17663,17730,demod:17506] theorem(or(implies(implies(X,Y),Y),implies(X,Z))).
% 18218 [binary:17970,18033,slowcut:17509] 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: 1134
% derived clauses: 56675
% kept clauses: 15137
% kept size sum: 228094
% kept mid-nuclei: 2884
% kept new demods: 2
% forw unit-subs: 30978
% forw double-subs: 389
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 22
% dbl unit cutoff: 0
% real runtime : 30.13
% process. runtime: 30.13
% 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/LCL259-3+eq_r.in")
%
%------------------------------------------------------------------------------