%------------------------------------------------------------------------------ % File : Crossbow---0.1 % Problem : PUZ133+3 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : do_Crossbow---0.1 %s % Computer : n024.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 17:59:33 EDT 2022 % Result : CounterSatisfiable 5.21s 5.46s % Output : FiniteModel 5.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : PUZ133+3 : TPTP v8.1.0. Released v4.1.0. % 0.13/0.14 % Command : do_Crossbow---0.1 %s % 0.14/0.35 % Computer : n024.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 : Sun May 29 01:39:06 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.35 /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.21/5.46 % SZS status CounterSatisfiable for theBenchmark.p % 5.21/5.46 % SZS output start FiniteModel for theBenchmark.p % 5.21/5.46 % domain size: 4 % 5.21/5.46 fof(interp, fi_domain, ![X] : (X = 0 | X = 1 | X = 2 | X = 3)). % 5.21/5.46 fof(interp, fi_functors, esk1_0 = 1). % 5.21/5.46 fof(interp, fi_functors, esk2_0 = 0). % 5.21/5.46 fof(interp, fi_predicates, le(0, 0) & ~le(0, 1) & ~le(0, 2) & le(0, 3) & % 5.21/5.46 le(1, 0) & % 5.21/5.46 le(1, 1) & % 5.21/5.46 ~le(1, 2) & % 5.21/5.46 le(1, 3) & % 5.21/5.46 le(2, 0) & % 5.21/5.46 le(2, 1) & % 5.21/5.46 le(2, 2) & % 5.21/5.46 le(2, 3) & % 5.21/5.46 ~le(3, 0) & % 5.21/5.46 ~le(3, 1) & % 5.21/5.46 ~le(3, 2) & % 5.21/5.46 le(3, 3)). % 5.21/5.46 fof(interp, fi_predicates, ~lt(0, 0) & ~lt(0, 1) & ~lt(0, 2) & ~lt(0, 3) & % 5.21/5.46 ~lt(1, 0) & % 5.21/5.46 ~lt(1, 1) & % 5.21/5.46 ~lt(1, 2) & % 5.21/5.46 ~lt(1, 3) & % 5.21/5.46 ~lt(2, 0) & % 5.21/5.46 ~lt(2, 1) & % 5.21/5.46 ~lt(2, 2) & % 5.21/5.46 ~lt(2, 3) & % 5.21/5.46 ~lt(3, 0) & % 5.21/5.46 ~lt(3, 1) & % 5.21/5.46 ~lt(3, 2) & % 5.21/5.46 ~lt(3, 3)). % 5.21/5.46 fof(interp, fi_functors, minus(0, 0) = 1 & minus(0, 1) = 1 & minus(0, 2) = 2 & % 5.21/5.46 minus(0, 3) = 1 & % 5.21/5.46 minus(1, 0) = 1 & % 5.21/5.46 minus(1, 1) = 1 & % 5.21/5.46 minus(1, 2) = 2 & % 5.21/5.46 minus(1, 3) = 1 & % 5.21/5.46 minus(2, 0) = 2 & % 5.21/5.46 minus(2, 1) = 2 & % 5.21/5.46 minus(2, 2) = 1 & % 5.21/5.46 minus(2, 3) = 2 & % 5.21/5.46 minus(3, 0) = 1 & % 5.21/5.46 minus(3, 1) = 1 & % 5.21/5.46 minus(3, 2) = 2 & % 5.21/5.46 minus(3, 3) = 1). % 5.21/5.46 fof(interp, fi_functors, n = 0). % 5.21/5.46 fof(interp, fi_functors, n0 = 2). % 5.21/5.46 fof(interp, fi_functors, p(0) = 3 & p(1) = 2 & p(2) = 1 & p(3) = 3). % 5.21/5.46 fof(interp, fi_functors, plus(0, 0) = 1 & plus(0, 1) = 1 & plus(0, 2) = 0 & % 5.21/5.46 plus(0, 3) = 1 & % 5.21/5.46 plus(1, 0) = 1 & % 5.21/5.46 plus(1, 1) = 1 & % 5.21/5.46 plus(1, 2) = 0 & % 5.21/5.46 plus(1, 3) = 1 & % 5.21/5.46 plus(2, 0) = 0 & % 5.21/5.46 plus(2, 1) = 0 & % 5.21/5.46 plus(2, 2) = 1 & % 5.21/5.46 plus(2, 3) = 0 & % 5.21/5.46 plus(3, 0) = 1 & % 5.21/5.46 plus(3, 1) = 1 & % 5.21/5.46 plus(3, 2) = 0 & % 5.21/5.46 plus(3, 3) = 1). % 5.21/5.46 fof(interp, fi_predicates, queens_p). % 5.21/5.46 fof(interp, fi_predicates, ~queens_q). % 5.21/5.46 fof(interp, fi_functors, s(0) = 3 & s(1) = 0 & s(2) = 1 & s(3) = 3). % 5.21/5.46 % SZS output end FiniteModel for theBenchmark.p % 5.21/5.46 % 20 lemma(s) from E % 5.21/5.46 % cnf(cl, axiom, le(esk1_0, n)). % 5.21/5.46 % cnf(cl, axiom, le(esk2_0, n)). % 5.21/5.46 % cnf(cl, axiom, le(esk1_0, esk2_0)). % 5.21/5.46 % cnf(cl, axiom, le(n0, esk1_0)). % 5.21/5.46 % cnf(cl, axiom, le(A, s(s(A)))). % 5.21/5.46 % cnf(cl, axiom, le(n0, n)). % 5.21/5.46 % cnf(cl, axiom, le(A, s(s(s(A))))). % 5.21/5.46 % cnf(cl, axiom, le(n0, esk2_0)). % 5.21/5.46 % cnf(cl, axiom, minus(A, A) = minus(B, B)). % 5.21/5.46 % cnf(cl, axiom, p(esk1_0) != p(esk2_0)). % 5.21/5.46 % cnf(cl, axiom, ~le(esk2_0, n0)). % 5.21/5.46 % cnf(cl, axiom, ~le(n, n0)). % 5.21/5.46 % cnf(cl, axiom, ~le(n, esk1_0)). % 5.21/5.46 % cnf(cl, axiom, le(s(esk1_0), esk2_0)). % 5.21/5.46 % cnf(cl, axiom, le(s(n0), esk1_0)). % 5.21/5.46 % cnf(cl, axiom, le(s(esk1_0), n)). % 5.21/5.46 % cnf(cl, axiom, le(s(n0), n)). % 5.21/5.46 % cnf(cl, axiom, le(esk1_0, s(esk2_0))). % 5.21/5.46 % cnf(cl, axiom, le(n0, s(esk1_0))). % 5.21/5.46 % cnf(cl, axiom, le(n0, s(n))). % 5.21/5.46 % 29 pred(s) % 5.21/5.46 % 21 func(s) % 5.21/5.46 % 2 sort(s) % 5.21/5.46 % 79 clause(s) % 5.21/5.46 % Instantiating 1 (5060 ms) % 5.21/5.46 % Solving (5060 ms) % 5.21/5.46 % Instantiating 2 (5060 ms) % 5.21/5.46 % Solving (5061 ms) % 5.21/5.46 % Instantiating 3 (5061 ms) % 5.21/5.46 % Solving (5065 ms) % 5.21/5.46 % Instantiating 4 (5066 ms) % 5.21/5.46 % Solving (5076 ms) % 5.21/5.46 % % 5.21/5.46 % 1 model found (5079 ms) %------------------------------------------------------------------------------