TSTP Solution File: NLP258-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP258-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 : art03.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/NLP258-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 65)
% (binary-posweight-order 29 #f 2 65)
% (binary-unit 29 #f 2 65)
% (binary-double 29 #f 2 65)
% (binary 29 #t 2 65)
% (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,1048182,5,5802,1048183,1,5802,1048183,50,5802,1048183,40,5802,1048282,0,5802,1048705,50,5806,1048804,0,5806)
%
%
% START OF PROOF
% 1048705 [?] ?
% 1048758 [] -accessible_world(X,Y) | -man(X,Z) | man(Y,Z).
% 1048779 [] man(X,skf4(X)) | -be(Y,Z,U,U) | -of(Y,W,X1) | -of(Y,V,U) | -theme(Y,X3,X4) | -theme(Y,X2,X) | -agent(Y,X3,X1) | -agent(Y,X2,X1) | -agent(X4,X5,U) | -think_believe_consider(Y,X3) | -think_believe_consider(Y,X2) | -present(Y,X3) | -present(Y,X2) | -present(X4,X5) | -accessible_world(Y,X) | -accessible_world(Y,X4) | -jules_forename(Y,V) | -vincent_forename(Y,W) | -forename(Y,W) | -forename(Y,V) | -man(Y,X1) | -man(Y,U) | -state(Y,Z) | -proposition(Y,X4) | -proposition(Y,X) | -event(Y,X3) | -event(Y,X2) | -event(X4,X5) | -smoke(X4,X5) | -actual_world(Y).
% 1048780 [] agent(skc12,skf2(X),X) | -man(skc12,X).
% 1048781 [] event(skc12,skf2(X)) | -man(skc12,Y).
% 1048782 [] present(skc12,skf2(X)) | -man(skc12,Y).
% 1048783 [] smoke(skc12,skf2(X)) | -man(skc12,Y).
% 1048784 [] be(skc8,skc9,skc10,skc10).
% 1048785 [] of(skc8,skc11,skc10).
% 1048786 [] theme(skc8,skc13,skc12).
% 1048787 [] agent(skc8,skc13,skc15).
% 1048788 [] of(skc8,skc14,skc15).
% 1048789 [] proposition(skc8,skc12).
% 1048790 [] accessible_world(skc8,skc12).
% 1048791 [] state(skc8,skc9).
% 1048792 [] man(skc8,skc10).
% 1048793 [] forename(skc8,skc11).
% 1048794 [] jules_forename(skc8,skc11).
% 1048795 [] think_believe_consider(skc8,skc13).
% 1048796 [] present(skc8,skc13).
% 1048797 [] event(skc8,skc13).
% 1048798 [] vincent_forename(skc8,skc14).
% 1048799 [] forename(skc8,skc14).
% 1048800 [] man(skc8,skc15).
% 1048801 [] actual_world(skc8).
% 1048802 [] -agent(X,Y,skf4(X)) | $spltprd1($spltcnst15,X) | -present(X,Y) | -event(X,Y) | -smoke(X,Y).
% 1048814 [binary:1048779.2,1048784,cut:1048792,cut:1048791,cut:1048801] man(X,skf4(X)) | -of(skc8,Y,skc10) | -of(skc8,Z,U) | -theme(skc8,X1,X) | -theme(skc8,V,W) | -agent(W,X2,skc10) | -agent(skc8,X1,U) | -agent(skc8,V,U) | -think_believe_consider(skc8,X1) | -think_believe_consider(skc8,V) | -present(skc8,X1) | -present(skc8,V) | -accessible_world(skc8,W) | -accessible_world(skc8,X) | -jules_forename(skc8,Y) | -vincent_forename(skc8,Z) | -forename(skc8,Z) | -forename(skc8,Y) | -man(skc8,U) | -proposition(skc8,W) | -proposition(skc8,X) | -event(skc8,V) | -event(skc8,X1) | -present(W,X2) | -event(W,X2) | -smoke(W,X2).
% 1048881 [binary:1048785,1048814.2,cut:1048794,cut:1048793] man(X,skf4(X)) | -of(skc8,Y,Z) | -theme(skc8,V,W) | -theme(skc8,U,X) | -agent(skc8,V,Z) | -agent(skc8,U,Z) | -agent(W,X1,skc10) | -think_believe_consider(skc8,V) | -think_believe_consider(skc8,U) | -present(skc8,U) | -present(skc8,V) | -accessible_world(skc8,X) | -accessible_world(skc8,W) | -vincent_forename(skc8,Y) | -forename(skc8,Y) | -man(skc8,Z) | -proposition(skc8,X) | -proposition(skc8,W) | -event(skc8,V) | -event(skc8,U) | -present(W,X1) | -event(W,X1) | -smoke(W,X1).
% 1048926 [binary:1048788,1048881.2,cut:1048798,cut:1048799,cut:1048800] man(X,skf4(X)) | -agent(skc8,Z,skc15) | -agent(skc8,Y,skc15) | -theme(skc8,Z,X) | -theme(skc8,Y,U) | -agent(U,V,skc10) | -think_believe_consider(skc8,Z) | -think_believe_consider(skc8,Y) | -present(skc8,Y) | -present(skc8,Z) | -accessible_world(skc8,U) | -accessible_world(skc8,X) | -proposition(skc8,X) | -proposition(skc8,U) | -event(skc8,Y) | -event(skc8,Z) | -present(U,V) | -event(U,V) | -smoke(U,V).
% 1049026 [binary:1048790,1048758] -man(skc8,X) | man(skc12,X).
% 1049036 [binary:1048792,1049026] man(skc12,skc10).
% 1049038 [binary:1048780.2,1049036] agent(skc12,skf2(skc10),skc10).
% 1049039 [binary:1048781.2,1049036] event(skc12,skf2(X)).
% 1049040 [binary:1048782.2,1049036] present(skc12,skf2(X)).
% 1049041 [binary:1048783.2,1049036] smoke(skc12,skf2(X)).
% 1049184 [binary:1048787,1048926.2,cut:1048795,cut:1048796,cut:1048797] man(X,skf4(X)) | -theme(skc8,skc13,X) | -agent(skc8,Y,skc15) | -theme(skc8,Y,Z) | -agent(Z,U,skc10) | -think_believe_consider(skc8,Y) | -present(skc8,Y) | -accessible_world(skc8,Z) | -accessible_world(skc8,X) | -proposition(skc8,X) | -proposition(skc8,Z) | -event(skc8,Y) | -present(Z,U) | -event(Z,U) | -smoke(Z,U).
% 1049188 [binary:1048786,1049184.2,cut:1048790,cut:1048789] man(skc12,skf4(skc12)) | -agent(skc8,X,skc15) | -theme(skc8,X,Y) | -agent(Y,Z,skc10) | -think_believe_consider(skc8,X) | -present(skc8,X) | -accessible_world(skc8,Y) | -proposition(skc8,Y) | -event(skc8,X) | -present(Y,Z) | -event(Y,Z) | -smoke(Y,Z).
% 1049190 [binary:1048787,1049188.2,cut:1048795,cut:1048796,cut:1048797] man(skc12,skf4(skc12)) | -theme(skc8,skc13,X) | -agent(X,Y,skc10) | -accessible_world(skc8,X) | -proposition(skc8,X) | -present(X,Y) | -event(X,Y) | -smoke(X,Y).
% 1049192 [binary:1048786,1049190.2,cut:1048790,cut:1048789] man(skc12,skf4(skc12)) | -agent(skc12,X,skc10) | -present(skc12,X) | -event(skc12,X) | -smoke(skc12,X).
% 1049194 [binary:1049038,1049192.2,cut:1049040,cut:1049039,cut:1049041] man(skc12,skf4(skc12)).
% 1049195 [binary:1048780.2,1049194] agent(skc12,skf2(skf4(skc12)),skf4(skc12)).
% 1049218 [binary:1048802,1049195,cut:1048705,cut:1049040,cut:1049039,cut:1049041] 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 65
% clause depth limited to 3
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 763
% derived clauses: 1048998
% kept clauses: 586
% kept size sum: 5392
% kept mid-nuclei: 1047909
% kept new demods: 0
% forw unit-subs: 177
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 28
% fast unit cutoff: 1040538
% full unit cutoff: 1
% dbl unit cutoff: 10
% real runtime : 58.12
% process. runtime: 58.11
% specific non-discr-tree subsumption statistics:
% tried: 1307594
% length fails: 0
% strength fails: 319603
% predlist fails: 312812
% aux str. fails: 34
% by-lit fails: 611305
% full subs tried: 63826
% full subs fail: 63820
%
% ; 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/NLP258-1+eq_r.in")
%
%------------------------------------------------------------------------------