TSTP Solution File: NLP251-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP251-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 : art08.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/NLP251-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 81)
% (binary-posweight-order 29 #f 2 81)
% (binary-unit 29 #f 2 81)
% (binary-double 29 #f 2 81)
% (binary 29 #t 2 81)
% (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,810173,5,5802,810174,1,5802,810174,50,5802,810174,40,5802,810273,0,5802,810785,50,5815,810884,0,5815)
%
%
% START OF PROOF
% 810785 [?] ?
% 810838 [] -accessible_world(X,Y) | -man(X,Z) | man(Y,Z).
% 810859 [] man(X,skf4(X)) | -be(Y,Z,U,U) | -of(Y,X2,X3) | -of(Y,X4,X5) | -of(Y,V,U) | -of(Y,W,X1) | -theme(Y,X7,X8) | -theme(Y,X6,X) | -agent(Y,X7,X3) | -agent(X8,X9,X5) | -agent(Y,X6,X1) | -think_believe_consider(Y,X7) | -think_believe_consider(Y,X6) | -present(Y,X7) | -present(X8,X9) | -present(Y,X6) | -accessible_world(Y,X8) | -accessible_world(Y,X) | -jules_forename(Y,X4) | -jules_forename(Y,V) | -vincent_forename(Y,X2) | -vincent_forename(Y,W) | -forename(Y,X2) | -forename(Y,X4) | -forename(Y,V) | -forename(Y,W) | -man(Y,X3) | -man(Y,X5) | -man(Y,U) | -man(Y,X1) | -state(Y,Z) | -proposition(Y,X8) | -proposition(Y,X) | -event(Y,X7) | -event(X8,X9) | -event(Y,X6) | -smoke(X8,X9) | -actual_world(Y).
% 810860 [] agent(skc12,skf2(X),X) | -man(skc12,X).
% 810861 [] event(skc12,skf2(X)) | -man(skc12,Y).
% 810862 [] present(skc12,skf2(X)) | -man(skc12,Y).
% 810863 [] smoke(skc12,skf2(X)) | -man(skc12,Y).
% 810864 [] be(skc8,skc9,skc10,skc10).
% 810865 [] of(skc8,skc11,skc10).
% 810866 [] theme(skc8,skc13,skc12).
% 810867 [] agent(skc8,skc13,skc15).
% 810868 [] of(skc8,skc14,skc15).
% 810869 [] proposition(skc8,skc12).
% 810870 [] accessible_world(skc8,skc12).
% 810871 [] state(skc8,skc9).
% 810872 [] man(skc8,skc10).
% 810873 [] forename(skc8,skc11).
% 810874 [] jules_forename(skc8,skc11).
% 810875 [] think_believe_consider(skc8,skc13).
% 810876 [] present(skc8,skc13).
% 810877 [] event(skc8,skc13).
% 810878 [] vincent_forename(skc8,skc14).
% 810879 [] forename(skc8,skc14).
% 810880 [] man(skc8,skc15).
% 810881 [] actual_world(skc8).
% 810882 [] -agent(X,Y,skf4(X)) | $spltprd1($spltcnst23,X) | -present(X,Y) | -event(X,Y) | -smoke(X,Y).
% 810952 [binary:810859.2,810864,cut:810872,cut:810871,cut:810881] man(X,skf4(X)) | -of(skc8,Y,skc10) | -of(skc8,V,W) | -of(skc8,X1,X2) | -of(skc8,Z,U) | -theme(skc8,X5,X) | -theme(skc8,X3,X4) | -agent(skc8,X5,W) | -agent(skc8,X3,U) | -agent(X4,X6,X2) | -think_believe_consider(skc8,X3) | -think_believe_consider(skc8,X5) | -present(skc8,X5) | -present(skc8,X3) | -accessible_world(skc8,X4) | -accessible_world(skc8,X) | -jules_forename(skc8,X1) | -jules_forename(skc8,Y) | -vincent_forename(skc8,Z) | -vincent_forename(skc8,V) | -forename(skc8,Y) | -forename(skc8,V) | -forename(skc8,Z) | -forename(skc8,X1) | -man(skc8,W) | -man(skc8,U) | -man(skc8,X2) | -proposition(skc8,X) | -proposition(skc8,X4) | -event(skc8,X5) | -event(skc8,X3) | -present(X4,X6) | -event(X4,X6) | -smoke(X4,X6).
% 811019 [binary:810865,810952.2,cut:810874,cut:810873] man(X,skf4(X)) | -of(skc8,U,V) | -of(skc8,W,X1) | -of(skc8,Y,Z) | -theme(skc8,X3,X4) | -theme(skc8,X2,X) | -agent(skc8,X3,V) | -agent(skc8,X2,X1) | -agent(X4,X5,Z) | -think_believe_consider(skc8,X3) | -think_believe_consider(skc8,X2) | -present(skc8,X2) | -present(skc8,X3) | -accessible_world(skc8,X4) | -accessible_world(skc8,X) | -jules_forename(skc8,Y) | -vincent_forename(skc8,W) | -vincent_forename(skc8,U) | -forename(skc8,U) | -forename(skc8,Y) | -forename(skc8,W) | -man(skc8,Z) | -man(skc8,X1) | -man(skc8,V) | -proposition(skc8,X4) | -proposition(skc8,X) | -event(skc8,X3) | -event(skc8,X2) | -present(X4,X5) | -event(X4,X5) | -smoke(X4,X5).
% 811064 [binary:810868,811019.2,cut:810878,cut:810879,cut:810880] man(X,skf4(X)) | -agent(skc8,Y,skc15) | -of(skc8,V,W) | -of(skc8,Z,U) | -theme(skc8,X1,X) | -theme(skc8,Y,X2) | -agent(skc8,X1,W) | -agent(X2,X3,U) | -think_believe_consider(skc8,X1) | -think_believe_consider(skc8,Y) | -present(skc8,Y) | -present(skc8,X1) | -accessible_world(skc8,X) | -accessible_world(skc8,X2) | -jules_forename(skc8,Z) | -vincent_forename(skc8,V) | -forename(skc8,Z) | -forename(skc8,V) | -man(skc8,U) | -man(skc8,W) | -proposition(skc8,X) | -proposition(skc8,X2) | -event(skc8,X1) | -event(skc8,Y) | -present(X2,X3) | -event(X2,X3) | -smoke(X2,X3).
% 811164 [binary:810870,810838] -man(skc8,X) | man(skc12,X).
% 811174 [binary:810872,811164] man(skc12,skc10).
% 811176 [binary:810860.2,811174] agent(skc12,skf2(skc10),skc10).
% 811177 [binary:810861.2,811174] event(skc12,skf2(X)).
% 811178 [binary:810862.2,811174] present(skc12,skf2(X)).
% 811179 [binary:810863.2,811174] smoke(skc12,skf2(X)).
% 811323 [binary:810867,811064.2,cut:810875,cut:810876,cut:810877] man(X,skf4(X)) | -theme(skc8,skc13,Y) | -of(skc8,V,W) | -of(skc8,Z,U) | -theme(skc8,X1,X) | -agent(skc8,X1,U) | -agent(Y,X2,W) | -think_believe_consider(skc8,X1) | -present(skc8,X1) | -accessible_world(skc8,X) | -accessible_world(skc8,Y) | -jules_forename(skc8,V) | -vincent_forename(skc8,Z) | -forename(skc8,Z) | -forename(skc8,V) | -man(skc8,W) | -man(skc8,U) | -proposition(skc8,Y) | -proposition(skc8,X) | -event(skc8,X1) | -present(Y,X2) | -event(Y,X2) | -smoke(Y,X2).
% 811333 [binary:810866,811323.2,cut:810870,cut:810869] man(X,skf4(X)) | -of(skc8,U,V) | -of(skc8,Y,Z) | -theme(skc8,W,X) | -agent(skc12,X1,Z) | -agent(skc8,W,V) | -think_believe_consider(skc8,W) | -present(skc12,X1) | -present(skc8,W) | -accessible_world(skc8,X) | -jules_forename(skc8,Y) | -vincent_forename(skc8,U) | -forename(skc8,Y) | -forename(skc8,U) | -man(skc8,Z) | -man(skc8,V) | -proposition(skc8,X) | -event(skc12,X1) | -event(skc8,W) | -smoke(skc12,X1).
% 811347 [binary:810868,811333.2,cut:810878,cut:810879,cut:810880] 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(skc8,Y) | -event(skc12,V) | -smoke(skc12,V).
% 811349 [binary:810867,811347.2,cut:810875,cut:810876,cut:810877] 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).
% 811351 [binary:810866,811349.2,cut:810870,cut:810869] 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).
% 811353 [binary:810865,811351.2,cut:810874,cut:810873,cut:810872] man(skc12,skf4(skc12)) | -agent(skc12,X,skc10) | -present(skc12,X) | -event(skc12,X) | -smoke(skc12,X).
% 811356 [binary:811176,811353.2,cut:811178,cut:811177,cut:811179] man(skc12,skf4(skc12)).
% 811358 [binary:810860.2,811356] agent(skc12,skf2(skf4(skc12)),skf4(skc12)).
% 811380 [binary:810882,811358,cut:810785,cut:811178,cut:811177,cut:811179] 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 81
% clause depth limited to 3
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 806
% derived clauses: 811200
% kept clauses: 665
% kept size sum: 13418
% kept mid-nuclei: 809901
% kept new demods: 0
% forw unit-subs: 177
% forw double-subs: 0
% forw overdouble-subs: 80
% backward subs: 61
% fast unit cutoff: 801459
% full unit cutoff: 1
% dbl unit cutoff: 10
% real runtime : 58.31
% process. runtime: 58.29
% specific non-discr-tree subsumption statistics:
% tried: 723325
% length fails: 0
% strength fails: 91562
% predlist fails: 168824
% aux str. fails: 220
% by-lit fails: 347660
% full subs tried: 114953
% full subs fail: 114815
%
% ; 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/NLP251-1+eq_r.in")
%
%------------------------------------------------------------------------------