↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT021-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 : 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 0.0s
% Output   : Assurance 0.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/MGT/MGT021-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 3 9)
% (binary-unit 9 #f 3 9)
% (binary-double 9 #f 3 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 9)
% (binary-order 25 #f 3 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(12,40,0,24,0,0)
% 
% 
% START OF PROOF
% 14 [] -subpopulations(first_movers,efficient_producers,X,Y) | in_environment(X,Y) | -environment(X).
% 15 [] greater(number_of_organizations(X,Y),zero) | -subpopulations(first_movers,efficient_producers,X,Y) | -environment(X).
% 16 [] -decreases(X) | -increases(X).
% 18 [] -greater(number_of_organizations(X,Y),zero) | -greater(equilibrium(X),Y) | decreases(resources(X,Y)) | -in_environment(X,Y) | -environment(X).
% 19 [] -greater(number_of_organizations(X,Y),zero) | constant(resources(X,Y)) | greater(equilibrium(X),Y) | -in_environment(X,Y) | -environment(X).
% 20 [] increases(difference(disbanding_rate(first_movers,X),disbanding_rate(efficient_producers,X))) | -decreases(resources(Y,X)) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 21 [] -decreases(difference(disbanding_rate(first_movers,X),disbanding_rate(efficient_producers,X))) | -constant(resources(Y,X)) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 22 [] environment(sk1).
% 23 [] subpopulations(first_movers,efficient_producers,sk1,sk2).
% 24 [] decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))).
% 34 [hyper:14,23,cut:22] in_environment(sk1,sk2).
% 35 [hyper:15,23,cut:22] greater(number_of_organizations(sk1,sk2),zero).
% 37 [hyper:19,34,cut:35,cut:22] constant(resources(sk1,sk2)) | greater(equilibrium(sk1),sk2).
% 46 [hyper:21,37,cut:24,cut:23,cut:22] greater(equilibrium(sk1),sk2).
% 47 [hyper:18,46,cut:35,cut:34,cut:22] decreases(resources(sk1,sk2)).
% 48 [hyper:20,47,cut:23,cut:22] increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))).
% 52 [hyper:16,48,cut:24] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 3
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    13
%  derived clauses:   32
%  kept clauses:      7
%  kept size sum:     40
%  kept mid-nuclei:   16
%  kept new demods:   0
%  forw unit-subs:    2
%  forw double-subs: 2
%  forw overdouble-subs: 0
%  backward subs:     2
%  fast unit cutoff:  15
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           4
%  length fails:    0
%  strength fails:  4
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/MGT/MGT021-1+eq_r.in")
% 
%------------------------------------------------------------------------------