TSTP Solution File: NLP252-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP252-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 : art05.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 49.5s
% Output : Assurance 49.5s
% 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/NLP252-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,932602,5,5802,932603,1,5802,932603,50,5802,932603,40,5802,932702,0,5802,933149,50,5808,933248,0,5809)
%
%
% START OF PROOF
% 933148 [?] ?
% 933202 [] -accessible_world(X,Y) | -man(X,Z) | man(Y,Z).
% 933223 [] man(X,skf4(X)) | -be(Y,Z,U,U) | -of(Y,X1,X2) | -of(Y,X3,U) | -of(Y,V,W) | -theme(Y,X5,X6) | -theme(Y,X4,X) | -agent(Y,X5,X2) | -agent(X6,X7,U) | -agent(Y,X4,W) | -think_believe_consider(Y,X5) | -think_believe_consider(Y,X4) | -present(Y,X5) | -present(X6,X7) | -present(Y,X4) | -accessible_world(Y,X6) | -accessible_world(Y,X) | -jules_forename(Y,X3) | -vincent_forename(Y,X1) | -vincent_forename(Y,V) | -forename(Y,X1) | -forename(Y,X3) | -forename(Y,V) | -man(Y,X2) | -man(Y,U) | -man(Y,W) | -state(Y,Z) | -proposition(Y,X6) | -proposition(Y,X) | -event(Y,X5) | -event(X6,X7) | -event(Y,X4) | -smoke(X6,X7) | -actual_world(Y).
% 933224 [] agent(skc12,skf2(X),X) | -man(skc12,X).
% 933225 [] event(skc12,skf2(X)) | -man(skc12,Y).
% 933226 [] present(skc12,skf2(X)) | -man(skc12,Y).
% 933227 [] smoke(skc12,skf2(X)) | -man(skc12,Y).
% 933228 [] be(skc8,skc9,skc10,skc10).
% 933229 [] of(skc8,skc11,skc10).
% 933230 [] theme(skc8,skc13,skc12).
% 933231 [] agent(skc8,skc13,skc15).
% 933232 [] of(skc8,skc14,skc15).
% 933233 [] proposition(skc8,skc12).
% 933234 [] accessible_world(skc8,skc12).
% 933235 [] state(skc8,skc9).
% 933236 [] man(skc8,skc10).
% 933237 [] forename(skc8,skc11).
% 933238 [] jules_forename(skc8,skc11).
% 933239 [] think_believe_consider(skc8,skc13).
% 933240 [] present(skc8,skc13).
% 933241 [] event(skc8,skc13).
% 933242 [] vincent_forename(skc8,skc14).
% 933243 [] forename(skc8,skc14).
% 933244 [] man(skc8,skc15).
% 933245 [] actual_world(skc8).
% 933247 [] -agent(X,Y,skf4(X)) | $spltprd1($spltcnst22,X) | -present(X,Y) | -event(X,Y) | -smoke(X,Y).
% 933248 [] -$spltprd1($spltcnst22,X) | -$spltprd1($spltcnst21,X).
% 933269 [binary:933223.2,933228,cut:933236,cut:933235,cut:933245] 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(X2,X4,skc10) | -agent(skc8,X3,W) | -agent(skc8,X1,U) | -think_believe_consider(skc8,X1) | -think_believe_consider(skc8,X3) | -present(skc8,X3) | -present(skc8,X1) | -accessible_world(skc8,X) | -accessible_world(skc8,X2) | -jules_forename(skc8,Y) | -vincent_forename(skc8,V) | -vincent_forename(skc8,Z) | -forename(skc8,Y) | -forename(skc8,V) | -forename(skc8,Z) | -man(skc8,U) | -man(skc8,W) | -proposition(skc8,X2) | -proposition(skc8,X) | -event(skc8,X3) | -event(skc8,X1) | -present(X2,X4) | -event(X2,X4) | -smoke(X2,X4).
% 933336 [binary:933229,933269.2,cut:933238,cut:933237] man(X,skf4(X)) | -of(skc8,Y,Z) | -of(skc8,U,V) | -theme(skc8,X1,X2) | -theme(skc8,W,X) | -agent(skc8,X1,V) | -agent(skc8,W,Z) | -agent(X2,X3,skc10) | -think_believe_consider(skc8,W) | -think_believe_consider(skc8,X1) | -present(skc8,X1) | -present(skc8,W) | -accessible_world(skc8,X2) | -accessible_world(skc8,X) | -vincent_forename(skc8,Y) | -vincent_forename(skc8,U) | -forename(skc8,Y) | -forename(skc8,U) | -man(skc8,V) | -man(skc8,Z) | -proposition(skc8,X) | -proposition(skc8,X2) | -event(skc8,X1) | -event(skc8,W) | -present(X2,X3) | -event(X2,X3) | -smoke(X2,X3).
% 933381 [binary:933232,933336.2,cut:933242,cut:933243,cut:933244] man(X,skf4(X)) | -agent(skc8,Y,skc15) | -of(skc8,Z,U) | -theme(skc8,Y,X) | -theme(skc8,V,W) | -agent(W,X1,skc10) | -agent(skc8,V,U) | -think_believe_consider(skc8,V) | -think_believe_consider(skc8,Y) | -present(skc8,V) | -present(skc8,Y) | -accessible_world(skc8,X) | -accessible_world(skc8,W) | -vincent_forename(skc8,Z) | -forename(skc8,Z) | -man(skc8,U) | -proposition(skc8,W) | -proposition(skc8,X) | -event(skc8,V) | -event(skc8,Y) | -present(W,X1) | -event(W,X1) | -smoke(W,X1).
% 933481 [binary:933234,933202] -man(skc8,X) | man(skc12,X).
% 933491 [binary:933236,933481] man(skc12,skc10).
% 933493 [binary:933224.2,933491] agent(skc12,skf2(skc10),skc10).
% 933494 [binary:933225.2,933491] event(skc12,skf2(X)).
% 933495 [binary:933226.2,933491] present(skc12,skf2(X)).
% 933496 [binary:933227.2,933491] smoke(skc12,skf2(X)).
% 933644 [binary:933231,933381.2,cut:933239,cut:933240,cut:933241] man(X,skf4(X)) | -theme(skc8,skc13,X) | -of(skc8,Y,Z) | -theme(skc8,U,V) | -agent(V,W,skc10) | -agent(skc8,U,Z) | -think_believe_consider(skc8,U) | -present(skc8,U) | -accessible_world(skc8,V) | -accessible_world(skc8,X) | -vincent_forename(skc8,Y) | -forename(skc8,Y) | -man(skc8,Z) | -proposition(skc8,X) | -proposition(skc8,V) | -event(skc8,U) | -present(V,W) | -event(V,W) | -smoke(V,W).
% 933648 [binary:933230,933644.2,cut:933234,cut:933233] man(skc12,skf4(skc12)) | -of(skc8,X,Y) | -theme(skc8,Z,U) | -agent(skc8,Z,Y) | -agent(U,V,skc10) | -think_believe_consider(skc8,Z) | -present(skc8,Z) | -accessible_world(skc8,U) | -vincent_forename(skc8,X) | -forename(skc8,X) | -man(skc8,Y) | -proposition(skc8,U) | -event(skc8,Z) | -present(U,V) | -event(U,V) | -smoke(U,V).
% 933651 [binary:933232,933648.2,cut:933242,cut:933243,cut:933244] 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).
% 933653 [binary:933231,933651.2,cut:933239,cut:933240,cut:933241] 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).
% 933655 [binary:933230,933653.2,cut:933234,cut:933233] man(skc12,skf4(skc12)) | -agent(skc12,X,skc10) | -present(skc12,X) | -event(skc12,X) | -smoke(skc12,X).
% 933659 [binary:933493,933655.2,cut:933495,cut:933494,cut:933496] man(skc12,skf4(skc12)).
% 933660 [binary:933224.2,933659] agent(skc12,skf2(skf4(skc12)),skf4(skc12)).
% 933683 [binary:933247,933660,cut:933495,cut:933494,cut:933496] $spltprd1($spltcnst22,skc12).
% 933685 [binary:933248,933683,cut:933148] 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: 781
% derived clauses: 933473
% kept clauses: 608
% kept size sum: 7602
% kept mid-nuclei: 932330
% kept new demods: 0
% forw unit-subs: 177
% forw double-subs: 0
% forw overdouble-subs: 8
% backward subs: 35
% fast unit cutoff: 922806
% full unit cutoff: 1
% dbl unit cutoff: 10
% real runtime : 58.69
% process. runtime: 58.16
% specific non-discr-tree subsumption statistics:
% tried: 1128901
% length fails: 0
% strength fails: 270215
% predlist fails: 353289
% aux str. fails: 72
% by-lit fails: 398197
% full subs tried: 107114
% full subs fail: 107090
%
% ; 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/NLP252-1+eq_r.in")
%
%------------------------------------------------------------------------------