TSTP Solution File: LCL036-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL036-1 : TPTP v3.4.2. Released v1.0.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 0.0s
% Output : Assurance 0.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/LCL036-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,1,110,50,2,113,0,2,292,50,4,295,0,4)
%
%
% START OF PROOF
% 293 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 294 [] is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))).
% 295 [] -is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)).
% 298 [hyper:293,294,294] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),implies(Y,U)),implies(V,implies(Y,U)))).
% 305 [hyper:293,298,294] is_a_theorem(implies(implies(implies(X,implies(falsehood,Y)),Z),implies(U,Z))).
% 315 [hyper:293,305,298] is_a_theorem(implies(X,implies(Y,implies(falsehood,Z)))).
% 318 [?] ?
% 322 [hyper:293,315,slowcut:318] is_a_theorem(implies(X,implies(falsehood,Y))).
% 328 [hyper:293,322,294] is_a_theorem(implies(implies(implies(falsehood,X),Y),implies(Z,Y))).
% 357 [hyper:293,328,298] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 358 [?] ?
% 362 [hyper:293,357,slowcut:358] is_a_theorem(implies(X,implies(Y,X))).
% 374 [hyper:293,362,294] is_a_theorem(implies(implies(implies(X,implies(implies(implies(Y,Z),implies(U,falsehood)),V)),Y),implies(U,Y))).
% 532 [hyper:293,374,294] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(implies(Y,U),implies(X,falsehood)),Z))).
% 541 [hyper:293,532,362] is_a_theorem(implies(implies(implies(X,Y),implies(Z,falsehood)),implies(U,implies(Z,X)))).
% 566 [hyper:293,541,532] is_a_theorem(implies(X,implies(implies(implies(Y,Z),implies(U,falsehood)),implies(U,Y)))).
% 568 [hyper:293,541,294] is_a_theorem(implies(implies(implies(X,implies(Y,implies(Z,U))),Z),implies(V,Z))).
% 577 [hyper:293,568,532] is_a_theorem(implies(implies(implies(X,Y),implies(implies(Z,implies(U,implies(X,V))),falsehood)),implies(W,X))).
% 581 [hyper:293,566,slowcut:577] is_a_theorem(implies(implies(implies(X,Y),implies(Z,falsehood)),implies(Z,X))).
% 590 [hyper:293,581,294] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),Y),implies(U,Y))).
% 600 [hyper:293,590,294] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 610 [hyper:293,600,581] is_a_theorem(implies(implies(X,falsehood),implies(X,Y))).
% 612 [hyper:293,600,294] is_a_theorem(implies(implies(implies(implies(X,falsehood),Y),Z),implies(X,Z))).
% 803 [hyper:293,612,610] is_a_theorem(implies(X,implies(implies(X,falsehood),Y))).
% 895 [hyper:293,803,581,slowcut:295] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 8
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 166
% derived clauses: 10119
% kept clauses: 474
% kept size sum: 7924
% kept mid-nuclei: 382
% kept new demods: 0
% forw unit-subs: 8551
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 55
% fast unit cutoff: 0
% full unit cutoff: 22
% dbl unit cutoff: 0
% real runtime : 0.9
% process. runtime: 0.8
% 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/LCL036-1+noeq.in")
%
%------------------------------------------------------------------------------