%------------------------------------------------------------------------------ % File : Crossbow---0.1 % Problem : SWW103+1 : TPTP v8.1.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : do_Crossbow---0.1 %s % Computer : n026.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 : Wed Jul 20 23:23:41 EDT 2022 % Result : Satisfiable 5.22s 5.47s % Output : FiniteModel 5.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SWW103+1 : TPTP v8.1.0. Released v5.2.0. % 0.08/0.15 % Command : do_Crossbow---0.1 %s % 0.15/0.36 % Computer : n026.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Sun Jun 5 09:06:44 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.37 /export/starexec/sandbox/solver/bin % 0.15/0.37 crossbow.opt % 0.15/0.37 do_Crossbow---0.1 % 0.15/0.37 eprover % 0.15/0.37 runsolver % 0.15/0.37 starexec_run_Crossbow---0.1 % 5.22/5.47 % SZS status Satisfiable for theBenchmark.p % 5.22/5.47 % SZS output start FiniteModel for theBenchmark.p % 5.22/5.47 % domain size: 3 % 5.22/5.47 fof(interp, fi_domain, ![X] : (X = 0 | X = 1 | X = 2)). % 5.22/5.47 fof(interp, fi_functors, and1(0, 0) = 0 & and1(0, 1) = 0 & and1(0, 2) = 2 & % 5.22/5.47 and1(1, 0) = 0 & % 5.22/5.47 and1(1, 1) = 1 & % 5.22/5.47 and1(1, 2) = 2 & % 5.22/5.47 and1(2, 0) = 2 & % 5.22/5.47 and1(2, 1) = 2 & % 5.22/5.47 and1(2, 2) = 2). % 5.22/5.47 fof(interp, fi_functors, apply(0, 0) = 2 & apply(0, 1) = 2 & apply(0, 2) = 2 & % 5.22/5.47 apply(1, 0) = 2 & % 5.22/5.47 apply(1, 1) = 2 & % 5.22/5.47 apply(1, 2) = 2 & % 5.22/5.47 apply(2, 0) = 2 & % 5.22/5.47 apply(2, 1) = 2 & % 5.22/5.47 apply(2, 2) = 2). % 5.22/5.47 fof(interp, fi_predicates, bool(0) & bool(1) & ~bool(2)). % 5.22/5.47 fof(interp, fi_predicates, d(0) & d(1) & d(2)). % 5.22/5.47 fof(interp, fi_functors, err = 2). % 5.22/5.47 fof(interp, fi_functors, esk1_2(0, 0) = 0 & esk1_2(0, 1) = 0 & esk1_2(0, 2) = 0 & % 5.22/5.47 esk1_2(1, 0) = 0 & % 5.22/5.47 esk1_2(1, 1) = 1 & % 5.22/5.47 esk1_2(1, 2) = 0 & % 5.22/5.47 esk1_2(2, 0) = 0 & % 5.22/5.47 esk1_2(2, 1) = 0 & % 5.22/5.47 esk1_2(2, 2) = 0). % 5.22/5.47 fof(interp, fi_functors, esk2_2(0, 0) = 0 & esk2_2(0, 1) = 0 & esk2_2(0, 2) = 0 & % 5.22/5.47 esk2_2(1, 0) = 0 & % 5.22/5.47 esk2_2(1, 1) = 0 & % 5.22/5.47 esk2_2(1, 2) = 0 & % 5.22/5.47 esk2_2(2, 0) = 0 & % 5.22/5.47 esk2_2(2, 1) = 0 & % 5.22/5.47 esk2_2(2, 2) = 0). % 5.22/5.47 fof(interp, fi_functors, esk3_2(0, 0) = 0 & esk3_2(0, 1) = 1 & esk3_2(0, 2) = 0 & % 5.22/5.47 esk3_2(1, 0) = 1 & % 5.22/5.47 esk3_2(1, 1) = 1 & % 5.22/5.47 esk3_2(1, 2) = 0 & % 5.22/5.47 esk3_2(2, 0) = 0 & % 5.22/5.47 esk3_2(2, 1) = 0 & % 5.22/5.47 esk3_2(2, 2) = 0). % 5.22/5.47 fof(interp, fi_functors, esk4_1(0) = 0 & esk4_1(1) = 0 & esk4_1(2) = 0). % 5.22/5.47 fof(interp, fi_functors, esk5_2(0, 0) = 1 & esk5_2(0, 1) = 2 & esk5_2(0, 2) = 2 & % 5.22/5.47 esk5_2(1, 0) = 1 & % 5.22/5.47 esk5_2(1, 1) = 2 & % 5.22/5.47 esk5_2(1, 2) = 2 & % 5.22/5.47 esk5_2(2, 0) = 1 & % 5.22/5.47 esk5_2(2, 1) = 2 & % 5.22/5.47 esk5_2(2, 2) = 2). % 5.22/5.47 fof(interp, fi_functors, esk6_1(0) = 0 & esk6_1(1) = 0 & esk6_1(2) = 0). % 5.22/5.47 fof(interp, fi_functors, esk7_0 = 0). % 5.22/5.47 fof(interp, fi_predicates, ~existsprefers(0, 0) & ~existsprefers(0, 1) & % 5.22/5.47 ~existsprefers(0, 2) & % 5.22/5.47 existsprefers(1, 0) & % 5.22/5.47 ~existsprefers(1, 1) & % 5.22/5.47 ~existsprefers(1, 2) & % 5.22/5.47 existsprefers(2, 0) & % 5.22/5.47 existsprefers(2, 1) & % 5.22/5.47 ~existsprefers(2, 2)). % 5.22/5.47 fof(interp, fi_functors, false = 0). % 5.22/5.47 fof(interp, fi_functors, false1 = 0). % 5.22/5.47 fof(interp, fi_functors, false2 = 0). % 5.22/5.47 fof(interp, fi_predicates, ~forallprefers(0, 0) & forallprefers(0, 1) & % 5.22/5.47 ~forallprefers(0, 2) & % 5.22/5.47 ~forallprefers(1, 0) & % 5.22/5.47 ~forallprefers(1, 1) & % 5.22/5.47 ~forallprefers(1, 2) & % 5.22/5.47 forallprefers(2, 0) & % 5.22/5.47 forallprefers(2, 1) & % 5.22/5.47 ~forallprefers(2, 2)). % 5.22/5.47 fof(interp, fi_functors, impl(0, 0) = 1 & impl(0, 1) = 1 & impl(0, 2) = 2 & % 5.22/5.47 impl(1, 0) = 0 & % 5.22/5.47 impl(1, 1) = 1 & % 5.22/5.47 impl(1, 2) = 2 & % 5.22/5.47 impl(2, 0) = 2 & % 5.22/5.47 impl(2, 1) = 2 & % 5.22/5.47 impl(2, 2) = 2). % 5.22/5.47 fof(interp, fi_functors, lazy_and1(0, 0) = 0 & lazy_and1(0, 1) = 0 & % 5.22/5.47 lazy_and1(0, 2) = 0 & % 5.22/5.47 lazy_and1(1, 0) = 0 & % 5.22/5.47 lazy_and1(1, 1) = 1 & % 5.22/5.47 lazy_and1(1, 2) = 2 & % 5.22/5.47 lazy_and1(2, 0) = 2 & % 5.22/5.47 lazy_and1(2, 1) = 2 & % 5.22/5.47 lazy_and1(2, 2) = 2). % 5.22/5.47 fof(interp, fi_functors, lazy_impl(0, 0) = 1 & lazy_impl(0, 1) = 1 & % 5.22/5.47 lazy_impl(0, 2) = 1 & % 5.22/5.47 lazy_impl(1, 0) = 0 & % 5.22/5.47 lazy_impl(1, 1) = 1 & % 5.22/5.47 lazy_impl(1, 2) = 2 & % 5.22/5.47 lazy_impl(2, 0) = 2 & % 5.22/5.47 lazy_impl(2, 1) = 2 & % 5.22/5.47 lazy_impl(2, 2) = 2). % 5.22/5.47 fof(interp, fi_functors, not1(0) = 1 & not1(1) = 0 & not1(2) = 2). % 5.22/5.47 fof(interp, fi_functors, or1(0, 0) = 0 & or1(0, 1) = 1 & or1(0, 2) = 2 & % 5.22/5.47 or1(1, 0) = 1 & % 5.22/5.47 or1(1, 1) = 1 & % 5.22/5.47 or1(1, 2) = 2 & % 5.22/5.47 or1(2, 0) = 2 & % 5.22/5.47 or1(2, 1) = 2 & % 5.22/5.47 or1(2, 2) = 2). % 5.22/5.47 fof(interp, fi_functors, prop(0) = 1 & prop(1) = 1 & prop(2) = 0). % 5.22/5.47 fof(interp, fi_functors, true = 1). % 5.22/5.47 % SZS output end FiniteModel for theBenchmark.p % 5.22/5.47 % 20 lemma(s) from E % 5.22/5.47 % cnf(cl, axiom, d(false1)). % 5.22/5.47 % cnf(cl, axiom, bool(false1)). % 5.22/5.47 % cnf(cl, axiom, true = prop(true)). % 5.22/5.47 % cnf(cl, axiom, false1 = esk7_0). % 5.22/5.47 % cnf(cl, axiom, false1 = false2). % 5.22/5.47 % cnf(cl, axiom, not1(err) = err). % 5.22/5.47 % cnf(cl, axiom, true = lazy_impl(true, true)). % 5.22/5.47 % cnf(cl, axiom, true = impl(true, true)). % 5.22/5.47 % cnf(cl, axiom, false1 != err). % 5.22/5.47 % cnf(cl, axiom, false1 != true). % 5.22/5.47 % cnf(cl, axiom, ~forallprefers(false1, false1)). % 5.22/5.47 % cnf(cl, axiom, not1(false1) = true). % 5.22/5.47 % cnf(cl, axiom, false1 = not1(true)). % 5.22/5.47 % cnf(cl, axiom, false1 = lazy_and1(false1, A)). % 5.22/5.47 % cnf(cl, axiom, true = prop(false1)). % 5.22/5.47 % cnf(cl, axiom, false1 = lazy_impl(true, false1)). % 5.22/5.47 % cnf(cl, axiom, d(prop(A))). % 5.22/5.47 % cnf(cl, axiom, bool(prop(A))). % 5.22/5.47 % cnf(cl, axiom, true = prop(prop(A))). % 5.22/5.47 % cnf(cl, axiom, false1 = esk2_2(false1, A)). % 5.22/5.47 % 57 pred(s) % 5.22/5.47 % 20 func(s) % 5.22/5.47 % 3 sort(s) % 5.22/5.47 % 149 clause(s) % 5.22/5.47 % Instantiating 1 (5055 ms) % 5.22/5.47 % Solving (5055 ms) % 5.22/5.47 % Instantiating 2 (5056 ms) % 5.22/5.47 % Solving (5058 ms) % 5.32/5.47 % Instantiating 3 (5058 ms) % 5.32/5.47 % Solving (5066 ms) % 5.32/5.47 % % 5.32/5.47 % 1 model found (5068 ms) %------------------------------------------------------------------------------