TSTP Solution File: MGT038+2 by Crossbow---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Crossbow---0.1
% Problem : MGT038+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_Crossbow---0.1 %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 21:58:27 EDT 2022
% Result : CounterSatisfiable 5.17s 5.40s
% Output : FiniteModel 5.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT038+2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : do_Crossbow---0.1 %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 11:57:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 /export/starexec/sandbox/solver/bin
% 0.12/0.34 crossbow.opt
% 0.12/0.34 do_Crossbow---0.1
% 0.12/0.34 eprover
% 0.12/0.34 runsolver
% 0.12/0.34 starexec_run_Crossbow---0.1
% 5.17/5.40 % SZS status CounterSatisfiable for theBenchmark.p
% 5.17/5.40 % SZS output start FiniteModel for theBenchmark.p
% 5.17/5.40 % domain size: 2
% 5.17/5.40 fof(interp, fi_domain, ![X] : (X = 0 | X = 1)).
% 5.17/5.40 fof(interp, fi_functors, appear(0, 0) = 0 & appear(0, 1) = 0 & appear(1, 0) = 0 &
% 5.17/5.40 appear(1, 1) = 0).
% 5.17/5.40 fof(interp, fi_functors, cardinality_at_time(0, 0) = 0 &
% 5.17/5.40 cardinality_at_time(0, 1) = 1 &
% 5.17/5.40 cardinality_at_time(1, 0) = 1 &
% 5.17/5.40 cardinality_at_time(1, 1) = 0).
% 5.17/5.40 fof(interp, fi_predicates, contracts_from(0, 0) & ~contracts_from(0, 1) &
% 5.17/5.40 contracts_from(1, 0) &
% 5.17/5.40 ~contracts_from(1, 1)).
% 5.17/5.40 fof(interp, fi_functors, e = 0).
% 5.17/5.40 fof(interp, fi_functors, efficient_producers = 1).
% 5.17/5.40 fof(interp, fi_predicates, environment(0) & ~environment(1)).
% 5.17/5.40 fof(interp, fi_functors, equilibrium(0) = 0 & equilibrium(1) = 0).
% 5.17/5.40 fof(interp, fi_functors, esk1_2(0, 0) = 0 & esk1_2(0, 1) = 1 & esk1_2(1, 0) = 0 &
% 5.17/5.40 esk1_2(1, 1) = 0).
% 5.17/5.40 fof(interp, fi_functors, esk2_2(0, 0) = 0 & esk2_2(0, 1) = 0 & esk2_2(1, 0) = 0 &
% 5.17/5.40 esk2_2(1, 1) = 0).
% 5.17/5.40 fof(interp, fi_functors, esk3_2(0, 0) = 0 & esk3_2(0, 1) = 0 & esk3_2(1, 0) = 0 &
% 5.17/5.40 esk3_2(1, 1) = 0).
% 5.17/5.40 fof(interp, fi_functors, esk4_1(0) = 0 & esk4_1(1) = 0).
% 5.17/5.40 fof(interp, fi_functors, esk5_1(0) = 0 & esk5_1(1) = 0).
% 5.17/5.40 fof(interp, fi_functors, esk6_1(0) = 0 & esk6_1(1) = 0).
% 5.17/5.40 fof(interp, fi_functors, esk7_0 = 0).
% 5.17/5.40 fof(interp, fi_predicates, finite_set(0) & ~finite_set(1)).
% 5.17/5.40 fof(interp, fi_functors, first_movers = 0).
% 5.17/5.40 fof(interp, fi_predicates, greater(0, 0) & ~greater(0, 1) & ~greater(1, 0) &
% 5.17/5.40 greater(1, 1)).
% 5.17/5.40 fof(interp, fi_predicates, greater_or_equal(0, 0) & ~greater_or_equal(0, 1) &
% 5.17/5.40 ~greater_or_equal(1, 0) &
% 5.17/5.40 greater_or_equal(1, 1)).
% 5.17/5.40 fof(interp, fi_functors, growth_rate(0, 0) = 1 & growth_rate(0, 1) = 1 &
% 5.17/5.40 growth_rate(1, 0) = 0 &
% 5.17/5.40 growth_rate(1, 1) = 0).
% 5.17/5.40 fof(interp, fi_predicates, in_environment(0, 0) & ~in_environment(0, 1) &
% 5.17/5.40 ~in_environment(1, 0) &
% 5.17/5.40 ~in_environment(1, 1)).
% 5.17/5.40 fof(interp, fi_functors, s = 1).
% 5.17/5.40 fof(interp, fi_predicates, stable(0) & ~stable(1)).
% 5.17/5.40 fof(interp, fi_predicates, ~subpopulations(0, 0, 0, 0) &
% 5.17/5.40 ~subpopulations(0, 0, 0, 1) &
% 5.17/5.40 ~subpopulations(0, 0, 1, 0) &
% 5.17/5.40 ~subpopulations(0, 0, 1, 1) &
% 5.17/5.40 ~subpopulations(0, 1, 0, 0) &
% 5.17/5.40 ~subpopulations(0, 1, 0, 1) &
% 5.17/5.40 ~subpopulations(0, 1, 1, 0) &
% 5.17/5.40 ~subpopulations(0, 1, 1, 1) &
% 5.17/5.40 subpopulations(1, 0, 0, 0) &
% 5.17/5.40 ~subpopulations(1, 0, 0, 1) &
% 5.17/5.40 ~subpopulations(1, 0, 1, 0) &
% 5.17/5.40 ~subpopulations(1, 0, 1, 1) &
% 5.17/5.40 subpopulations(1, 1, 0, 0) &
% 5.17/5.40 ~subpopulations(1, 1, 0, 1) &
% 5.17/5.40 ~subpopulations(1, 1, 1, 0) &
% 5.17/5.40 ~subpopulations(1, 1, 1, 1)).
% 5.17/5.40 fof(interp, fi_functors, t2 = 0).
% 5.17/5.40 fof(interp, fi_functors, to = 0).
% 5.17/5.40 fof(interp, fi_functors, zero = 1).
% 5.17/5.40 % SZS output end FiniteModel for theBenchmark.p
% 5.17/5.41 % 1 lemma(s) from E
% 5.17/5.41 % cnf(cl, axiom, cardinality_at_time(first_movers, to) != zero).
% 5.17/5.41 % 49 pred(s)
% 5.17/5.41 % 22 func(s)
% 5.17/5.41 % 3 sort(s)
% 5.17/5.41 % 76 clause(s)
% 5.17/5.41 % Instantiating 1 (5032 ms)
% 5.17/5.41 % Solving (5032 ms)
% 5.17/5.41 % Instantiating 2 (5032 ms)
% 5.17/5.41 % Solving (5033 ms)
% 5.17/5.41 %
% 5.17/5.41 % 1 model found (5035 ms)
%------------------------------------------------------------------------------