TSTP Solution File: PLA028+1 by Crossbow---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Crossbow---0.1
% Problem : PLA028+1 : TPTP v8.1.0. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : do_Crossbow---0.1 %s
% Computer : n020.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 : Mon Jul 18 16:51:44 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.10/0.12 % Problem : PLA028+1 : TPTP v8.1.0. Bugfixed v2.5.0.
% 0.10/0.13 % Command : do_Crossbow---0.1 %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue May 31 19:09:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.34 /export/starexec/sandbox2/solver/bin
% 0.14/0.34 crossbow.opt
% 0.14/0.34 do_Crossbow---0.1
% 0.14/0.34 eprover
% 0.14/0.34 runsolver
% 0.14/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: 3
% 5.17/5.40 fof(interp, fi_domain, ![X] : (X = 0 | X = 1 | X = 2)).
% 5.17/5.40 fof(interp, fi_predicates, a_block(0) & a_block(1) & a_block(2)).
% 5.17/5.40 fof(interp, fi_functors, block_1 = 0).
% 5.17/5.40 fof(interp, fi_functors, block_2 = 1).
% 5.17/5.40 fof(interp, fi_predicates, clear(0, 0) & clear(0, 1) & ~clear(0, 2) &
% 5.17/5.40 clear(1, 0) &
% 5.17/5.40 ~clear(1, 1) &
% 5.17/5.40 ~clear(1, 2) &
% 5.17/5.40 ~clear(2, 0) &
% 5.17/5.40 ~clear(2, 1) &
% 5.17/5.40 ~clear(2, 2)).
% 5.17/5.40 fof(interp, fi_predicates, ~destination(0, 0) & ~destination(0, 1) &
% 5.17/5.40 ~destination(0, 2) &
% 5.17/5.40 destination(1, 0) &
% 5.17/5.40 ~destination(1, 1) &
% 5.17/5.40 ~destination(1, 2) &
% 5.17/5.40 ~destination(2, 0) &
% 5.17/5.40 destination(2, 1) &
% 5.17/5.40 ~destination(2, 2)).
% 5.17/5.40 fof(interp, fi_predicates, ~different(0, 0) & different(0, 1) & different(0, 2) &
% 5.17/5.40 ~different(1, 0) &
% 5.17/5.40 ~different(1, 1) &
% 5.17/5.40 different(1, 2) &
% 5.17/5.40 ~different(2, 0) &
% 5.17/5.40 ~different(2, 1) &
% 5.17/5.40 ~different(2, 2)).
% 5.17/5.40 fof(interp, fi_functors, esk1_0 = 0).
% 5.17/5.40 fof(interp, fi_predicates, ~fixed(0) & ~fixed(1) & fixed(2)).
% 5.17/5.40 fof(interp, fi_predicates, goal_time(0) & goal_time(1) & ~goal_time(2)).
% 5.17/5.40 fof(interp, fi_predicates, ~neq(0, 0) & neq(0, 1) & neq(0, 2) & neq(1, 0) &
% 5.17/5.40 ~neq(1, 1) &
% 5.17/5.40 neq(1, 2) &
% 5.17/5.40 neq(2, 0) &
% 5.17/5.40 neq(2, 1) &
% 5.17/5.40 ~neq(2, 2)).
% 5.17/5.40 fof(interp, fi_predicates, nonfixed(0) & nonfixed(1) & ~nonfixed(2)).
% 5.17/5.40 fof(interp, fi_predicates, object(0, 0) & object(0, 1) & ~object(0, 2) &
% 5.17/5.40 ~object(1, 0) &
% 5.17/5.40 ~object(1, 1) &
% 5.17/5.40 ~object(1, 2) &
% 5.17/5.40 ~object(2, 0) &
% 5.17/5.40 ~object(2, 1) &
% 5.17/5.40 ~object(2, 2)).
% 5.17/5.40 fof(interp, fi_predicates, ~on(0, 0, 0) & ~on(0, 0, 1) & ~on(0, 0, 2) &
% 5.17/5.40 ~on(0, 1, 0) &
% 5.17/5.40 on(0, 1, 1) &
% 5.17/5.40 ~on(0, 1, 2) &
% 5.17/5.40 on(0, 2, 0) &
% 5.17/5.40 ~on(0, 2, 1) &
% 5.17/5.40 ~on(0, 2, 2) &
% 5.17/5.40 ~on(1, 0, 0) &
% 5.17/5.40 ~on(1, 0, 1) &
% 5.17/5.40 ~on(1, 0, 2) &
% 5.17/5.40 ~on(1, 1, 0) &
% 5.17/5.40 ~on(1, 1, 1) &
% 5.17/5.40 ~on(1, 1, 2) &
% 5.17/5.40 on(1, 2, 0) &
% 5.17/5.40 on(1, 2, 1) &
% 5.17/5.40 ~on(1, 2, 2) &
% 5.17/5.40 ~on(2, 0, 0) &
% 5.17/5.40 ~on(2, 0, 1) &
% 5.17/5.40 ~on(2, 0, 2) &
% 5.17/5.40 ~on(2, 1, 0) &
% 5.17/5.40 ~on(2, 1, 1) &
% 5.17/5.40 ~on(2, 1, 2) &
% 5.17/5.40 ~on(2, 2, 0) &
% 5.17/5.40 ~on(2, 2, 1) &
% 5.17/5.40 ~on(2, 2, 2)).
% 5.17/5.40 fof(interp, fi_functors, s(0) = 1 & s(1) = 0 & s(2) = 0).
% 5.17/5.40 fof(interp, fi_predicates, ~source(0, 0) & ~source(0, 1) & ~source(0, 2) &
% 5.17/5.40 ~source(1, 0) &
% 5.17/5.40 source(1, 1) &
% 5.17/5.40 ~source(1, 2) &
% 5.17/5.40 source(2, 0) &
% 5.17/5.40 ~source(2, 1) &
% 5.17/5.40 ~source(2, 2)).
% 5.17/5.40 fof(interp, fi_functors, table = 2).
% 5.17/5.40 fof(interp, fi_predicates, time(0) & time(1) & ~time(2)).
% 5.17/5.40 fof(interp, fi_functors, time_0 = 0).
% 5.17/5.40 % SZS output end FiniteModel for theBenchmark.p
% 5.17/5.40 % 7 lemma(s) from E
% 5.17/5.40 % cnf(cl, axiom, ~fixed(block_1)).
% 5.17/5.40 % cnf(cl, axiom, ~fixed(block_2)).
% 5.17/5.40 % cnf(cl, axiom, ~nonfixed(table)).
% 5.17/5.40 % cnf(cl, axiom, ~different(table, table)).
% 5.17/5.40 % cnf(cl, axiom, ~different(block_2, block_2)).
% 5.17/5.40 % cnf(cl, axiom, ~neq(block_2, block_2)).
% 5.17/5.40 % cnf(cl, axiom, ~different(block_1, block_1)).
% 5.17/5.40 % 15 pred(s)
% 5.17/5.40 % 7 func(s)
% 5.17/5.40 % 2 sort(s)
% 5.17/5.40 % 58 clause(s)
% 5.17/5.40 % Instantiating 1 (5023 ms)
% 5.17/5.40 % Solving (5023 ms)
% 5.17/5.40 % Instantiating 2 (5023 ms)
% 5.17/5.40 % Solving (5024 ms)
% 5.17/5.40 % Instantiating 3 (5024 ms)
% 5.17/5.40 % Solving (5026 ms)
% 5.17/5.40 %
% 5.17/5.40 % 1 model found (5026 ms)
%------------------------------------------------------------------------------