TSTP Solution File: LCL074-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL074-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 : 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 318.8s
% Output : Assurance 318.8s
% 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/LCL074-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 7 5)
% (binary-unit 11 #f 7 5)
% (binary-double 17 #f 7 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 7 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,0,6,0,0,1040,50,21,1043,0,21,7295,50,1031,7298,0,1031,16030,4,2384,17619,5,2832,17619,1,2832,17619,50,2832,17619,40,2832,17622,0,2832,39163,3,3383,49870,4,3658,50754,5,3933,50754,5,3934,50754,1,3934,50754,50,3937,50754,40,3937,50757,0,3937,81710,3,4788,92674,4,5224,100283,5,5638,100283,5,5639,100284,1,5639,100284,50,5642,100284,40,5642,100287,0,5642,133362,4,7825,133751,5,8543,133752,1,8545,133752,50,8548,133752,40,8548,133755,0,8548,146381,3,10252,149324,4,11134,151996,5,11949,151998,5,11950,151998,1,11950,151998,50,11952,151998,40,11952,152001,0,11968,170220,3,14403,171927,4,14969,176849,5,15969,176851,5,15970,176851,1,15970,176851,50,15972,176851,40,15972,176854,0,15972,203761,3,16841,206665,4,17248,222075,5,17673,222077,5,17673,222078,1,17673,222078,50,17674,222078,40,17674,222081,0,17674,244373,3,19195,248249,4,19851,252756,5,20575,252757,5,20575,252758,1,20575,252758,50,20577,252758,40,20577,252761,0,20577,254084,50,20615,254087,0,20615,268611,3,26117,271459,4,28868,275683,5,31616,275685,5,31617,275685,1,31617,275685,50,31619,275685,40,31619,275688,0,31622)
%
%
% START OF PROOF
% 222157 [?] ?
% 222187 [?] ?
% 223942 [?] ?
% 223971 [binary:222157,223942] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),Y),implies(U,Y))).
% 247098 [?] ?
% 247207 [binary:222187,247098] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(implies(Y,U)),Z))).
% 252879 [?] ?
% 253106 [?] ?
% 253113 [binary:252879,253106] is_a_theorem(implies(X,implies(not(implies(Y,X)),Z))).
% 254085 [?] ?
% 254089 [?] ?
% 254134 [?] ?
% 254233 [binary:254089,254134] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 258448 [?] ?
% 258459 [?] ?
% 258462 [binary:254085,258459,slowcut:258448] is_a_theorem(implies(X,not(not(X)))).
% 258872 [?] ?
% 258874 [binary:254089,258872] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 264865 [?] ?
% 267849 [?] ?
% 269883 [?] ?
% 271252 [?] ?
% 271396 [?] ?
% 271399 [binary:267849,271252] is_a_theorem(implies(X,implies(implies(not(not(Y)),Z),implies(Y,Z)))).
% 271401 [binary:269883,271252] is_a_theorem(implies(X,implies(implies(Y,Z),implies(not(implies(Y,U)),Z)))).
% 271402 [binary:264865.2,271252] is_a_theorem(implies(implies(not(implies(X,Y)),not(not(not(not(Z))))),implies(implies(Z,Y),implies(X,Y)))).
% 271404 [binary:254085,271396,slowcut:271402] is_a_theorem(implies(implies(not(X),X),implies(Y,X))).
% 275686 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 275688 [] -is_a_theorem(implies(implies(not(a),a),a)).
% 275971 [binary:275686,271404] -is_a_theorem(implies(not(X),X)) | is_a_theorem(implies(Y,X)).
% 276291 [binary:275686,254233] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(Y,Z)).
% 276924 [binary:253113,276291] is_a_theorem(implies(X,implies(not(implies(Y,implies(Z,X))),U))).
% 277375 [binary:275686,258874] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(not(X),Z)).
% 278122 [binary:275686,276924] is_a_theorem(implies(not(implies(X,implies(Y,Z))),U)) | -is_a_theorem(Z).
% 278327 [binary:258462,277375] is_a_theorem(implies(not(X),not(not(implies(X,Y))))).
% 279250 [binary:277375,223971] is_a_theorem(implies(not(implies(X,implies(Y,Z))),implies(U,Y))).
% 279269 [binary:278122.2,279250] is_a_theorem(implies(not(implies(X,implies(Y,implies(not(implies(Z,implies(U,V))),implies(W,U))))),X1)).
% 279272 [binary:275686,271399,slowcut:279269] is_a_theorem(implies(implies(not(not(X)),Y),implies(X,Y))).
% 279290 [binary:275686,279272] -is_a_theorem(implies(not(not(X)),Y)) | is_a_theorem(implies(X,Y)).
% 279335 [binary:278327,279290] is_a_theorem(implies(X,not(not(implies(not(X),Y))))).
% 279583 [binary:277375,279335] is_a_theorem(implies(not(X),not(not(implies(not(implies(X,Y)),Z))))).
% 289017 [binary:279290,279583] is_a_theorem(implies(X,not(not(implies(not(implies(not(X),Y)),Z))))).
% 294248 [binary:275686,289017] is_a_theorem(not(not(implies(not(implies(not(X),Y)),Z)))) | -is_a_theorem(X).
% 302018 [binary:277375,247207] is_a_theorem(implies(not(implies(X,Y)),implies(not(implies(Y,Z)),U))).
% 302130 [binary:294248.2,302018] is_a_theorem(not(not(implies(not(implies(not(implies(not(implies(X,Y)),implies(not(implies(Y,Z)),U))),V)),W)))).
% 302133 [binary:275686,271401,slowcut:302130] is_a_theorem(implies(implies(X,Y),implies(not(implies(X,Z)),Y))).
% 302197 [binary:275686,302133] is_a_theorem(implies(not(implies(X,Y)),Z)) | -is_a_theorem(implies(X,Z)).
% 302255 [binary:271404,302197.2] is_a_theorem(implies(not(implies(implies(not(X),X),Y)),implies(Z,X))).
% 303526 [binary:275971,302255] is_a_theorem(implies(X,implies(implies(not(Y),Y),Y))).
% 303581 [binary:302197.2,302255] is_a_theorem(implies(not(implies(not(implies(implies(not(X),X),Y)),Z)),implies(U,X))).
% 303583 [binary:275686,303526,slowcut:275688,slowcut:303581] 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
% seconds given: 283
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 23929
% derived clauses: 7080883
% kept clauses: 227909
% kept size sum: 0
% kept mid-nuclei: 47828
% kept new demods: 0
% forw unit-subs: 3551929
% forw double-subs: 134923
% forw overdouble-subs: 20630
% backward subs: 915
% fast unit cutoff: 4532
% full unit cutoff: 9149
% dbl unit cutoff: 384
% real runtime : 322.19
% process. runtime: 320.68
% specific non-discr-tree subsumption statistics:
% tried: 8195290
% length fails: 1192411
% strength fails: 1442357
% predlist fails: 194304
% aux str. fails: 348726
% by-lit fails: 134636
% full subs tried: 4815349
% full subs fail: 4783385
%
% ; 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/LCL074-1+noeq.in")
%
%------------------------------------------------------------------------------