TSTP Solution File: MGT031-1 by FDP---0.9.16
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : FDP---0.9.16
% Problem : MGT031-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : add_equality
% Format : protein
% Command : fdp-casc %s %d
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Jan 9 21:43:27 EST 2011
% Result : Satisfiable 280.34s
% Output : Assurance 280.34s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% o===================================o
% | EQuality TRAnsFOrmation |
% | bthomas@informatik.uni-koblenz.de |
% o===================================o
% $Revision: 1.14 $
% reading /tmp/MGT031-1+eq_rstfp.tme
% result written to : /tmp/MGT031-1+eq_rstfp-eqt.tme
% FDPLL - A First-Order Davis-Putnam Theorem Prover
% Version 0.9.16 (26/06/2002)
% Proving /tmp/MGT031-1+eq_rstfp-eqt ...
% Proving /tmp/MGT031-1+eq_rstfp-eqt (restart with term depth limit 7) ...
% Proving /tmp/MGT031-1+eq_rstfp ...
% Proving /tmp/MGT031-1+eq_rstfp (restart with term depth limit 7) ...
% Done.
% Input File...............: /tmp/MGT031-1+eq_rstfp.tme
% System...................: Linux art03.cs.miami.edu 2.6.26.8-57.fc8 #1 SMP Thu Dec 18 19:19:45 EST 2008 i686 i686 i386 GNU/Linux
% Automatic mode...........: on
% Time limit...............: 300 seconds
% Current restart interval.: 52 seconds
% Restart with =-axioms....: 225 seconds
% Initial interpretation...: [+(_40890)]
% Clause set type..........: Non-Horn, with equality
% Equality transformation..: on
% Non-constant functions...: yes
% Term depth settings......: 3/2 (Init/Increment)
% unit_extend..............: on
% splitting type...........: exact
% Final tree statistics:
% Tree for clause set......: as initially given, after non-success with equality transformation
% # Restarts...............: 1
% Term depth limit.........: 7
% # Splits.................: 35
% # Commits................: 15
% # Unit extension steps...: 54
% # Unit back subsumptions.: 0
% # Branches closed........: 0
% # Level cuts.............: 0
% Time.....................: 279.83 seconds.
% Result...................: SATISFIABLE with model:
% +(greater_or_equal(appear(an_organisation, sk2), appear(an_organisation, sk2)))
% +(greater_or_equal(zero, zero))
% +(greater_or_equal(number_of_organizations(e, appear(an_organisation, sk2)), number_of_organizations(e, appear(an_organisation, sk2))))
% +(greater_or_equal(appear(efficient_producers, e), appear(efficient_producers, e)))
% +(greater_or_equal(appear(first_movers, sk2), appear(first_movers, sk2)))
% +(zero = zero)
% +(an_organisation = an_organisation)
% +(appear(an_organisation, sk2) = appear(an_organisation, sk2))
% +(number_of_organizations(e, appear(an_organisation, sk2)) = number_of_organizations(e, appear(an_organisation, sk2)))
% +(efficient_producers = efficient_producers)
% +(appear(efficient_producers, e) = appear(efficient_producers, e))
% +(sk2 = sk2)
% +(appear(first_movers, sk2) = appear(first_movers, sk2))
% +(e = e)
% +(first_movers = first_movers)
% -(greater_or_equal(cardinality_at_time(first_movers, appear(an_organisation, sk2)), number_of_organizations(e, appear(an_organisation, sk2))))
% -(cardinality_at_time(first_movers, appear(an_organisation, sk2)) = number_of_organizations(e, appear(an_organisation, sk2)))
% -(greater(cardinality_at_time(first_movers, appear(an_organisation, sk2)), number_of_organizations(e, appear(an_organisation, sk2))))
% -(number_of_organizations(e, appear(an_organisation, sk2)) = cardinality_at_time(first_movers, appear(an_organisation, sk2)))
% +(greater_or_equal(appear(efficient_producers, e), appear(an_organisation, sk2)))
% -(greater(cardinality_at_time(first_movers, appear(an_organisation, sk2)), zero))
% +(greater(appear(efficient_producers, e), appear(an_organisation, sk2)))
% +(greater(appear(first_movers, sk2), appear(an_organisation, sk2)))
% -(first_movers = an_organisation)
% +(greater_or_equal(appear(efficient_producers, e), appear(first_movers, sk2)))
% +(greater_or_equal(number_of_organizations(e, appear(an_organisation, sk2)), zero))
% -(an_organisation = first_movers)
% -(appear(first_movers, sk2) = appear(an_organisation, sk2))
% +(greater(appear(efficient_producers, e), appear(first_movers, sk2)))
% +(greater_or_equal(appear(first_movers, sk2), appear(an_organisation, sk2)))
% +(greater(number_of_organizations(e, appear(an_organisation, sk2)), zero))
% +(greater_or_equal(X_41346, X_41346))
% -(appear(an_organisation, sk2) = appear(first_movers, sk2))
% +(in_environment(sk2, appear(an_organisation, sk2)))
% +(environment(sk2))
% +(X_41383 = X_41383)
% +(_41387)
% -(greater_or_equal(appear(efficient_producers, sk2), appear(first_movers, sk2)))
% -(efficient_producers = first_movers)
% -(greater_or_equal(appear(efficient_producers, sk2), appear(efficient_producers, e)))
% -(sk2 = e)
% -(first_movers = efficient_producers)
% -(appear(efficient_producers, sk2) = appear(first_movers, sk2))
% -(e = sk2)
% -(appear(efficient_producers, sk2) = appear(efficient_producers, e))
% -(greater(appear(efficient_producers, sk2), appear(first_movers, sk2)))
% -(greater(appear(efficient_producers, sk2), appear(efficient_producers, e)))
% -(appear(first_movers, sk2) = appear(efficient_producers, sk2))
% -(appear(efficient_producers, e) = appear(efficient_producers, sk2))
% -(greater(appear(efficient_producers, sk2), appear(an_organisation, sk2)))
% -(environment(e))
% -(Y_41597 = first_movers)
% -(first_movers = Y_41622)
% -(Y_41647 = e)
% -(e = Y_41672)
% -(Y_41697 = appear(first_movers, sk2))
% -(appear(first_movers, sk2) = Y_41728)
% -(A_41753 = sk2)
% -(sk2 = Y_41778)
% -(Y_41803 = appear(efficient_producers, e))
% -(appear(efficient_producers, e) = Y_41834)
% -(A_41859 = efficient_producers)
% -(efficient_producers = Y_41884)
% -(Y_41909 = number_of_organizations(e, appear(an_organisation, sk2)))
% -(number_of_organizations(e, appear(an_organisation, sk2)) = Y_41946)
% -(A_41971 = appear(an_organisation, sk2))
% -(appear(an_organisation, sk2) = Y_42002)
% -(A_42027 = an_organisation)
% -(an_organisation = Y_42052)
% -(greater(A_42077, appear(first_movers, sk2)))
% -(greater(A_42105, appear(efficient_producers, e)))
% -(greater(A_42133, number_of_organizations(e, appear(an_organisation, sk2))))
% -(greater(A_42164, zero))
% -(environment(A_42188))
% -(greater(A_42213, appear(an_organisation, sk2)))
% -(A_42241 = zero)
% -(zero = Y_42266)
% -(greater_or_equal(A_42291, appear(first_movers, sk2)))
% -(greater_or_equal(A_42319, appear(efficient_producers, e)))
% -(greater_or_equal(A_42347, number_of_organizations(e, appear(an_organisation, sk2))))
% -(zero = cardinality_at_time(first_movers, appear(an_organisation, sk2)))
% -(cardinality_at_time(first_movers, appear(an_organisation, sk2)) = zero)
% -(greater_or_equal(cardinality_at_time(first_movers, appear(an_organisation, sk2)), zero))
% -(greater_or_equal(A_42434, zero))
% -(an_organisation = efficient_producers)
% -(efficient_producers = an_organisation)
% -(appear(an_organisation, sk2) = appear(efficient_producers, sk2))
% -(appear(efficient_producers, sk2) = appear(an_organisation, sk2))
% -(greater_or_equal(appear(efficient_producers, sk2), appear(an_organisation, sk2)))
% -(greater_or_equal(A_42529, appear(an_organisation, sk2)))
%
%------------------------------------------------------------------------------