TSTP Solution File: NLP257-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP257-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art02.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 50.0s
% Output : Assurance 50.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/NLP/NLP257-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 2 73)
% (binary-posweight-order 29 #f 2 73)
% (binary-unit 29 #f 2 73)
% (binary-double 29 #f 2 73)
% (binary 29 #t 2 73)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(96,40,0,195,0,1,971115,5,5802,971116,1,5802,971116,50,5802,971116,40,5802,971215,0,5802,971667,50,5809,971766,0,5809)
%
%
% START OF PROOF
% 971667 [?] ?
% 971720 [] -accessible_world(X,Y) | -man(X,Z) | man(Y,Z).
% 971741 [] man(X,skf4(X)) | -be(Y,Z,U,U) | -of(Y,W,X1) | -of(Y,X2,X3) | -of(Y,V,U) | -theme(Y,X5,X6) | -theme(Y,X4,X) | -agent(Y,X4,X1) | -agent(Y,X5,X1) | -agent(X6,X7,X3) | -think_believe_consider(Y,X5) | -think_believe_consider(Y,X4) | -present(Y,X5) | -present(Y,X4) | -present(X6,X7) | -accessible_world(Y,X6) | -accessible_world(Y,X) | -jules_forename(Y,X2) | -jules_forename(Y,V) | -vincent_forename(Y,W) | -forename(Y,W) | -forename(Y,X2) | -forename(Y,V) | -man(Y,X1) | -man(Y,X3) | -man(Y,U) | -state(Y,Z) | -proposition(Y,X) | -proposition(Y,X6) | -event(Y,X5) | -event(Y,X4) | -event(X6,X7) | -smoke(X6,X7) | -actual_world(Y).
% 971742 [] agent(skc12,skf2(X),X) | -man(skc12,X).
% 971743 [] event(skc12,skf2(X)) | -man(skc12,Y).
% 971744 [] present(skc12,skf2(X)) | -man(skc12,Y).
% 971745 [] smoke(skc12,skf2(X)) | -man(skc12,Y).
% 971746 [] be(skc8,skc9,skc10,skc10).
% 971747 [] of(skc8,skc11,skc10).
% 971748 [] theme(skc8,skc13,skc12).
% 971749 [] agent(skc8,skc13,skc15).
% 971750 [] of(skc8,skc14,skc15).
% 971751 [] proposition(skc8,skc12).
% 971752 [] accessible_world(skc8,skc12).
% 971753 [] state(skc8,skc9).
% 971754 [] man(skc8,skc10).
% 971755 [] forename(skc8,skc11).
% 971756 [] jules_forename(skc8,skc11).
% 971757 [] think_believe_consider(skc8,skc13).
% 971758 [] present(skc8,skc13).
% 971759 [] event(skc8,skc13).
% 971760 [] vincent_forename(skc8,skc14).
% 971761 [] forename(skc8,skc14).
% 971762 [] man(skc8,skc15).
% 971763 [] actual_world(skc8).
% 971764 [] -agent(X,Y,skf4(X)) | $spltprd1($spltcnst21,X) | -present(X,Y) | -event(X,Y) | -smoke(X,Y).
% 971790 [binary:971741.2,971746,cut:971754,cut:971753,cut:971763] man(X,skf4(X)) | -of(skc8,Y,skc10) | -of(skc8,V,W) | -of(skc8,Z,U) | -theme(skc8,X3,X) | -theme(skc8,X1,X2) | -agent(skc8,X1,W) | -agent(skc8,X3,W) | -agent(X2,X4,U) | -think_believe_consider(skc8,X1) | -think_believe_consider(skc8,X3) | -present(skc8,X1) | -present(skc8,X3) | -accessible_world(skc8,X) | -accessible_world(skc8,X2) | -jules_forename(skc8,Z) | -jules_forename(skc8,Y) | -vincent_forename(skc8,V) | -forename(skc8,Z) | -forename(skc8,Y) | -forename(skc8,V) | -man(skc8,W) | -man(skc8,U) | -proposition(skc8,X) | -proposition(skc8,X2) | -event(skc8,X1) | -event(skc8,X3) | -present(X2,X4) | -event(X2,X4) | -smoke(X2,X4).
% 971857 [binary:971747,971790.2,cut:971756,cut:971755] man(X,skf4(X)) | -of(skc8,Y,Z) | -of(skc8,U,V) | -theme(skc8,X1,X2) | -theme(skc8,W,X) | -agent(skc8,W,Z) | -agent(skc8,X1,Z) | -agent(X2,X3,V) | -think_believe_consider(skc8,W) | -think_believe_consider(skc8,X1) | -present(skc8,W) | -present(skc8,X1) | -accessible_world(skc8,X2) | -accessible_world(skc8,X) | -jules_forename(skc8,U) | -vincent_forename(skc8,Y) | -forename(skc8,U) | -forename(skc8,Y) | -man(skc8,Z) | -man(skc8,V) | -proposition(skc8,X2) | -proposition(skc8,X) | -event(skc8,W) | -event(skc8,X1) | -present(X2,X3) | -event(X2,X3) | -smoke(X2,X3).
% 971902 [binary:971750,971857.2,cut:971760,cut:971761,cut:971762] man(X,skf4(X)) | -agent(skc8,Z,skc15) | -agent(skc8,Y,skc15) | -of(skc8,U,V) | -theme(skc8,Y,X) | -theme(skc8,Z,W) | -agent(W,X1,V) | -think_believe_consider(skc8,Z) | -think_believe_consider(skc8,Y) | -present(skc8,Y) | -present(skc8,Z) | -accessible_world(skc8,X) | -accessible_world(skc8,W) | -jules_forename(skc8,U) | -forename(skc8,U) | -man(skc8,V) | -proposition(skc8,X) | -proposition(skc8,W) | -event(skc8,Y) | -event(skc8,Z) | -present(W,X1) | -event(W,X1) | -smoke(W,X1).
% 972002 [binary:971752,971720] -man(skc8,X) | man(skc12,X).
% 972012 [binary:971754,972002] man(skc12,skc10).
% 972014 [binary:971742.2,972012] agent(skc12,skf2(skc10),skc10).
% 972015 [binary:971743.2,972012] event(skc12,skf2(X)).
% 972016 [binary:971744.2,972012] present(skc12,skf2(X)).
% 972017 [binary:971745.2,972012] smoke(skc12,skf2(X)).
% 972166 [binary:971749,971902.2,cut:971757,cut:971758,cut:971759] man(X,skf4(X)) | -theme(skc8,skc13,Y) | -agent(skc8,Z,skc15) | -of(skc8,U,V) | -theme(skc8,Z,X) | -agent(Y,W,V) | -think_believe_consider(skc8,Z) | -present(skc8,Z) | -accessible_world(skc8,Y) | -accessible_world(skc8,X) | -jules_forename(skc8,U) | -forename(skc8,U) | -man(skc8,V) | -proposition(skc8,Y) | -proposition(skc8,X) | -event(skc8,Z) | -present(Y,W) | -event(Y,W) | -smoke(Y,W).
% 972171 [binary:971748,972166.2,cut:971752,cut:971751] man(X,skf4(X)) | -agent(skc8,Y,skc15) | -of(skc8,Z,U) | -theme(skc8,Y,X) | -agent(skc12,V,U) | -think_believe_consider(skc8,Y) | -present(skc12,V) | -present(skc8,Y) | -accessible_world(skc8,X) | -jules_forename(skc8,Z) | -forename(skc8,Z) | -man(skc8,U) | -proposition(skc8,X) | -event(skc12,V) | -event(skc8,Y) | -smoke(skc12,V).
% 972173 [binary:971749,972171.2,cut:971757,cut:971758,cut:971759] man(X,skf4(X)) | -theme(skc8,skc13,X) | -of(skc8,Y,Z) | -agent(skc12,U,Z) | -present(skc12,U) | -accessible_world(skc8,X) | -jules_forename(skc8,Y) | -forename(skc8,Y) | -man(skc8,Z) | -proposition(skc8,X) | -event(skc12,U) | -smoke(skc12,U).
% 972177 [binary:971748,972173.2,cut:971752,cut:971751] man(skc12,skf4(skc12)) | -of(skc8,X,Y) | -agent(skc12,Z,Y) | -present(skc12,Z) | -jules_forename(skc8,X) | -forename(skc8,X) | -man(skc8,Y) | -event(skc12,Z) | -smoke(skc12,Z).
% 972179 [binary:971747,972177.2,cut:971756,cut:971755,cut:971754] man(skc12,skf4(skc12)) | -agent(skc12,X,skc10) | -present(skc12,X) | -event(skc12,X) | -smoke(skc12,X).
% 972182 [binary:972014,972179.2,cut:972016,cut:972015,cut:972017] man(skc12,skf4(skc12)).
% 972183 [binary:971742.2,972182] agent(skc12,skf2(skf4(skc12)),skf4(skc12)).
% 972206 [binary:971764,972183,cut:971667,cut:972016,cut:972015,cut:972017] 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 73
% clause depth limited to 3
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 784
% derived clauses: 971992
% kept clauses: 611
% kept size sum: 7922
% kept mid-nuclei: 970843
% kept new demods: 0
% forw unit-subs: 177
% forw double-subs: 0
% forw overdouble-subs: 10
% backward subs: 30
% fast unit cutoff: 965987
% full unit cutoff: 1
% dbl unit cutoff: 10
% real runtime : 58.17
% process. runtime: 58.16
% specific non-discr-tree subsumption statistics:
% tried: 962547
% length fails: 0
% strength fails: 83618
% predlist fails: 210326
% aux str. fails: 82
% by-lit fails: 512511
% full subs tried: 155988
% full subs fail: 155966
%
% ; 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/NLP/NLP257-1+eq_r.in")
%
%------------------------------------------------------------------------------