↑ Up

Crossbow---0.1.CSA-FMo.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Crossbow---0.1
% Problem  : MGT034+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_Crossbow---0.1 %s

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:04:04 AM UTC 2026

% Result   : CounterSatisfiable 5.02s 5.36s
% Output   : FiniteModel 5.02s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem    : MGT034+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.02  % Command    : do_Crossbow---0.1 %s
% 0.03/0.30  % Computer : n012.cluster.edu
% 0.03/0.30  % Model    : x86_64 x86_64
% 0.03/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30  % Memory   : 8046.5625MB
% 0.03/0.30  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit   : 300
% 0.03/0.30  % WCLimit    : 300
% 0.03/0.30  % DateTime   : Mon Sep  7 12:28:57 UTC 2026
% 0.03/0.30  % CPUTime    : 
% 0.03/0.31  /export/starexec/sandbox/solver/bin
% 0.03/0.31  crossbow.opt
% 0.03/0.31  do_Crossbow---0.1
% 0.03/0.31  eprover
% 0.03/0.31  runsolver
% 0.03/0.31  starexec_run_Crossbow---0.1
% 5.02/5.36  % SZS status CounterSatisfiable for theBenchmark.p
% 5.02/5.36  % SZS output start FiniteModel for theBenchmark.p
% 5.02/5.36  % domain size: 2
% 5.02/5.36  fof(interp, fi_domain, ![X] : (X = 0 | X = 1)).
% 5.02/5.36  fof(interp, fi_functors, appear(0, 0) = 0 & appear(0, 1) = 0 & appear(1, 0) = 1 &
% 5.02/5.36    appear(1, 1) = 1).
% 5.02/5.36  fof(interp, fi_functors, critical_point(0) = 1 & critical_point(1) = 1).
% 5.02/5.36  fof(interp, fi_predicates, decreases(0) & ~decreases(1)).
% 5.02/5.36  fof(interp, fi_functors, difference(0, 0) = 1 & difference(0, 1) = 0 &
% 5.02/5.36    difference(1, 0) = 1 &
% 5.02/5.36    difference(1, 1) = 0).
% 5.02/5.36  fof(interp, fi_functors, disbanding_rate(0, 0) = 1 & disbanding_rate(0, 1) = 0 &
% 5.02/5.36    disbanding_rate(1, 0) = 1 &
% 5.02/5.36    disbanding_rate(1, 1) = 1).
% 5.02/5.36  fof(interp, fi_functors, efficient_producers = 0).
% 5.02/5.36  fof(interp, fi_predicates, environment(0) & environment(1)).
% 5.02/5.36  fof(interp, fi_functors, esk1_0 = 0).
% 5.02/5.36  fof(interp, fi_functors, esk2_0 = 0).
% 5.02/5.36  fof(interp, fi_functors, first_movers = 1).
% 5.02/5.36  fof(interp, fi_functors, founding_rate(0, 0) = 1 & founding_rate(0, 1) = 1 &
% 5.02/5.36    founding_rate(1, 0) = 1 &
% 5.02/5.36    founding_rate(1, 1) = 1).
% 5.02/5.36  fof(interp, fi_predicates, ~greater(0, 0) & ~greater(0, 1) & greater(1, 0) &
% 5.02/5.36    ~greater(1, 1)).
% 5.02/5.36  fof(interp, fi_predicates, greater_or_equal(0, 0) & ~greater_or_equal(0, 1) &
% 5.02/5.36    greater_or_equal(1, 0) &
% 5.02/5.36    greater_or_equal(1, 1)).
% 5.02/5.36  fof(interp, fi_functors, growth_rate(0, 0) = 0 & growth_rate(0, 1) = 1 &
% 5.02/5.36    growth_rate(1, 0) = 1 &
% 5.02/5.36    growth_rate(1, 1) = 1).
% 5.02/5.36  fof(interp, fi_predicates, ~in_environment(0, 0) & in_environment(0, 1) &
% 5.02/5.36    ~in_environment(1, 0) &
% 5.02/5.36    in_environment(1, 1)).
% 5.02/5.36  fof(interp, fi_predicates, selection_favors(0, 0, 0) &
% 5.02/5.36    ~selection_favors(0, 0, 1) &
% 5.02/5.36    selection_favors(0, 1, 0) &
% 5.02/5.36    selection_favors(0, 1, 1) &
% 5.02/5.36    ~selection_favors(1, 0, 0) &
% 5.02/5.36    selection_favors(1, 0, 1) &
% 5.02/5.36    ~selection_favors(1, 1, 0) &
% 5.02/5.36    ~selection_favors(1, 1, 1)).
% 5.02/5.36  fof(interp, fi_functors, start_time(0) = 1 & start_time(1) = 1).
% 5.02/5.36  fof(interp, fi_predicates, ~subpopulations(0, 0, 0, 0) &
% 5.02/5.36    ~subpopulations(0, 0, 0, 1) &
% 5.02/5.36    ~subpopulations(0, 0, 1, 0) &
% 5.02/5.36    ~subpopulations(0, 0, 1, 1) &
% 5.02/5.36    ~subpopulations(0, 1, 0, 0) &
% 5.02/5.36    subpopulations(0, 1, 0, 1) &
% 5.02/5.36    ~subpopulations(0, 1, 1, 0) &
% 5.02/5.36    subpopulations(0, 1, 1, 1) &
% 5.02/5.36    ~subpopulations(1, 0, 0, 0) &
% 5.02/5.36    subpopulations(1, 0, 0, 1) &
% 5.02/5.36    ~subpopulations(1, 0, 1, 0) &
% 5.02/5.36    subpopulations(1, 0, 1, 1) &
% 5.02/5.36    ~subpopulations(1, 1, 0, 0) &
% 5.02/5.36    ~subpopulations(1, 1, 0, 1) &
% 5.02/5.36    ~subpopulations(1, 1, 1, 0) &
% 5.02/5.36    ~subpopulations(1, 1, 1, 1)).
% 5.02/5.36  fof(interp, fi_functors, zero = 0).
% 5.02/5.36  % SZS output end FiniteModel for theBenchmark.p
% 5.02/5.36  % 1 lemma(s) from E
% 5.02/5.36  %     cnf(cl, axiom, critical_point(esk1_0) != esk2_0).
% 5.02/5.36  % 60 pred(s)
% 5.02/5.36  % 14 func(s)
% 5.02/5.36  % 3 sort(s)
% 5.02/5.36  % 84 clause(s)
% 5.02/5.36  % Instantiating 1 (5035 ms)
% 5.02/5.36  % Solving (5035 ms)
% 5.02/5.36  % Instantiating 2 (5035 ms)
% 5.02/5.36  % Solving (5036 ms)
% 5.02/5.36  % 
% 5.02/5.36  % 1 model found (5037 ms)
%------------------------------------------------------------------------------