↑ Up

Crossbow---0.1.CSA-FMo.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Crossbow---0.1
% Problem  : GRA013+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_Crossbow---0.1 %s

% Computer : n019.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 : Sat Jul 16 07:11:40 EDT 2022

% Result   : CounterSatisfiable 5.20s 5.41s
% Output   : FiniteModel 5.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : GRA013+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14  % Command    : do_Crossbow---0.1 %s
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 600
% 0.14/0.35  % DateTime   : Mon May 30 22:50:25 EDT 2022
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  /export/starexec/sandbox/solver/bin
% 0.14/0.36  crossbow.opt
% 0.14/0.36  do_Crossbow---0.1
% 0.14/0.36  eprover
% 0.14/0.36  runsolver
% 0.14/0.36  starexec_run_Crossbow---0.1
% 5.20/5.41  % SZS status CounterSatisfiable for theBenchmark.p
% 5.20/5.41  % SZS output start FiniteModel for theBenchmark.p
% 5.20/5.41  % domain size: 5
% 5.20/5.41  fof(interp, fi_domain, ![X] : (X = 0 | X = 1 | X = 2 | X = 3 | X = 4)).
% 5.20/5.41  fof(interp, fi_predicates, ~goal).
% 5.20/5.41  fof(interp, fi_predicates, ~green(0, 0) & ~green(0, 1) & green(0, 2) &
% 5.20/5.41    ~green(0, 3) &
% 5.20/5.41    green(0, 4) &
% 5.20/5.41    ~green(1, 0) &
% 5.20/5.41    ~green(1, 1) &
% 5.20/5.41    ~green(1, 2) &
% 5.20/5.41    green(1, 3) &
% 5.20/5.41    green(1, 4) &
% 5.20/5.41    ~green(2, 0) &
% 5.20/5.41    ~green(2, 1) &
% 5.20/5.41    ~green(2, 2) &
% 5.20/5.41    green(2, 3) &
% 5.20/5.41    ~green(2, 4) &
% 5.20/5.41    ~green(3, 0) &
% 5.20/5.41    ~green(3, 1) &
% 5.20/5.41    ~green(3, 2) &
% 5.20/5.41    ~green(3, 3) &
% 5.20/5.41    ~green(3, 4) &
% 5.20/5.41    ~green(4, 0) &
% 5.20/5.41    ~green(4, 1) &
% 5.20/5.41    ~green(4, 2) &
% 5.20/5.41    ~green(4, 3) &
% 5.20/5.41    ~green(4, 4)).
% 5.20/5.41  fof(interp, fi_predicates, ~less_than(0, 0) & less_than(0, 1) & less_than(0, 2) &
% 5.20/5.41    less_than(0, 3) &
% 5.20/5.41    less_than(0, 4) &
% 5.20/5.41    ~less_than(1, 0) &
% 5.20/5.41    ~less_than(1, 1) &
% 5.20/5.41    less_than(1, 2) &
% 5.20/5.41    less_than(1, 3) &
% 5.20/5.41    less_than(1, 4) &
% 5.20/5.41    ~less_than(2, 0) &
% 5.20/5.41    ~less_than(2, 1) &
% 5.20/5.41    ~less_than(2, 2) &
% 5.20/5.41    less_than(2, 3) &
% 5.20/5.41    less_than(2, 4) &
% 5.20/5.41    ~less_than(3, 0) &
% 5.20/5.41    ~less_than(3, 1) &
% 5.20/5.41    ~less_than(3, 2) &
% 5.20/5.41    ~less_than(3, 3) &
% 5.20/5.41    less_than(3, 4) &
% 5.20/5.41    ~less_than(4, 0) &
% 5.20/5.41    ~less_than(4, 1) &
% 5.20/5.41    ~less_than(4, 2) &
% 5.20/5.41    ~less_than(4, 3) &
% 5.20/5.41    ~less_than(4, 4)).
% 5.20/5.41  fof(interp, fi_functors, n1 = 0).
% 5.20/5.41  fof(interp, fi_functors, n2 = 1).
% 5.20/5.41  fof(interp, fi_functors, n3 = 2).
% 5.20/5.41  fof(interp, fi_functors, n4 = 3).
% 5.20/5.41  fof(interp, fi_functors, n5 = 4).
% 5.20/5.41  fof(interp, fi_predicates, ~red(0, 0) & red(0, 1) & ~red(0, 2) & red(0, 3) &
% 5.20/5.41    ~red(0, 4) &
% 5.20/5.41    ~red(1, 0) &
% 5.20/5.41    ~red(1, 1) &
% 5.20/5.41    red(1, 2) &
% 5.20/5.41    ~red(1, 3) &
% 5.20/5.41    ~red(1, 4) &
% 5.20/5.41    ~red(2, 0) &
% 5.20/5.41    ~red(2, 1) &
% 5.20/5.41    ~red(2, 2) &
% 5.20/5.41    ~red(2, 3) &
% 5.20/5.41    red(2, 4) &
% 5.20/5.41    ~red(3, 0) &
% 5.20/5.41    ~red(3, 1) &
% 5.20/5.41    ~red(3, 2) &
% 5.20/5.41    ~red(3, 3) &
% 5.20/5.41    red(3, 4) &
% 5.20/5.41    ~red(4, 0) &
% 5.20/5.41    ~red(4, 1) &
% 5.20/5.41    ~red(4, 2) &
% 5.20/5.41    ~red(4, 3) &
% 5.20/5.41    ~red(4, 4)).
% 5.20/5.41  % SZS output end FiniteModel for theBenchmark.p
% 5.20/5.41  % 11 lemma(s) from E
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(A, A)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n5, n4)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n5, n3)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n5, n2)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n5, n1)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n4, n3)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n4, n2)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n4, n1)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n3, n2)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n3, n1)).
% 5.20/5.41  %     cnf(cl, axiom, ~less_than(n2, n1)).
% 5.20/5.41  % 4 pred(s)
% 5.20/5.41  % 5 func(s)
% 5.20/5.41  % 1 sort(s)
% 5.20/5.41  % 20 clause(s)
% 5.20/5.41  % Instantiating 1 (5018 ms)
% 5.20/5.41  % Solving (5018 ms)
% 5.20/5.41  % Instantiating 2 (5018 ms)
% 5.20/5.41  % Solving (5018 ms)
% 5.20/5.41  % Instantiating 3 (5018 ms)
% 5.20/5.41  % Solving (5018 ms)
% 5.20/5.41  % Instantiating 4 (5018 ms)
% 5.20/5.41  % Solving (5019 ms)
% 5.20/5.41  % Instantiating 5 (5019 ms)
% 5.20/5.41  % Solving (5019 ms)
% 5.20/5.41  % 
% 5.20/5.41  % 1 model found (5020 ms)
%------------------------------------------------------------------------------