%------------------------------------------------------------------------------ % File : Crossbow---0.1 % Problem : LCL576+1 : TPTP v9.3.1. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : do_Crossbow---0.1 %s % Computer : n009.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 : Mon Sep 7 11:17:25 AM UTC 2026 % Result : CounterSatisfiable 5.55s 5.87s % Output : FiniteModel 5.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.04 % Problem : LCL576+1 : TPTP v9.3.1. Released v3.3.0. % 0.00/0.06 % Command : do_Crossbow---0.1 %s % 0.18/0.43 % Computer : n009.cluster.edu % 0.18/0.43 % Model : x86_64 x86_64 % 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.43 % Memory : 8046.5625MB % 0.18/0.43 % OS : Linux 6.8.0-71-generic % 0.18/0.43 % CPULimit : 300 % 0.18/0.43 % WCLimit : 300 % 0.18/0.43 % DateTime : Fri Sep 4 19:54:36 UTC 2026 % 0.18/0.43 % CPUTime : % 0.18/0.44 /export/starexec/sandbox2/solver/bin % 0.18/0.44 crossbow.opt % 0.18/0.44 do_Crossbow---0.1 % 0.18/0.44 eprover % 0.18/0.44 runsolver % 0.18/0.44 starexec_run_Crossbow---0.1 % 5.55/5.87 % SZS status CounterSatisfiable for theBenchmark.p % 5.55/5.87 % SZS output start FiniteModel for theBenchmark.p % 5.55/5.87 % domain size: 2 % 5.55/5.87 fof(interp, fi_domain, ![X] : (X = 0 | X = 1)). % 5.55/5.87 fof(interp, fi_predicates, adjunction). % 5.55/5.87 fof(interp, fi_functors, and(0, 0) = 0 & and(0, 1) = 1 & and(1, 0) = 1 & % 5.55/5.87 and(1, 1) = 1). % 5.55/5.87 fof(interp, fi_predicates, axiom_4). % 5.55/5.87 fof(interp, fi_predicates, axiom_5). % 5.55/5.87 fof(interp, fi_predicates, ~axiom_B). % 5.55/5.87 fof(interp, fi_predicates, axiom_K). % 5.55/5.87 fof(interp, fi_predicates, axiom_M). % 5.55/5.87 fof(interp, fi_predicates, axiom_m1). % 5.55/5.87 fof(interp, fi_predicates, axiom_m10). % 5.55/5.87 fof(interp, fi_predicates, axiom_m2). % 5.55/5.87 fof(interp, fi_predicates, axiom_m3). % 5.55/5.87 fof(interp, fi_predicates, axiom_m4). % 5.55/5.87 fof(interp, fi_predicates, axiom_m5). % 5.55/5.87 fof(interp, fi_predicates, ~axiom_m6). % 5.55/5.87 fof(interp, fi_predicates, axiom_m7). % 5.55/5.87 fof(interp, fi_predicates, axiom_m8). % 5.55/5.87 fof(interp, fi_predicates, axiom_m9). % 5.55/5.87 fof(interp, fi_predicates, axiom_s1). % 5.55/5.87 fof(interp, fi_predicates, axiom_s2). % 5.55/5.87 fof(interp, fi_predicates, axiom_s3). % 5.55/5.87 fof(interp, fi_predicates, axiom_s4). % 5.55/5.87 fof(interp, fi_functors, equiv(0, 0) = 0 & equiv(0, 1) = 1 & equiv(1, 0) = 1 & % 5.55/5.87 equiv(1, 1) = 0). % 5.55/5.87 fof(interp, fi_functors, esk10_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk11_0 = 1). % 5.55/5.87 fof(interp, fi_functors, esk12_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk13_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk14_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk15_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk16_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk17_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk18_0 = 1). % 5.55/5.87 fof(interp, fi_functors, esk19_0 = 1). % 5.55/5.87 fof(interp, fi_functors, esk1_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk20_0 = 1). % 5.55/5.87 fof(interp, fi_functors, esk21_0 = 1). % 5.55/5.87 fof(interp, fi_functors, esk22_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk23_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk24_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk25_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk26_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk27_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk28_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk29_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk2_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk30_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk31_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk32_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk33_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk34_0 = 1). % 5.55/5.87 fof(interp, fi_functors, esk35_0 = 1). % 5.55/5.87 fof(interp, fi_functors, esk36_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk37_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk38_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk39_0 = 1). % 5.55/5.87 fof(interp, fi_functors, esk3_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk4_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk5_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk6_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk7_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk8_0 = 0). % 5.55/5.87 fof(interp, fi_functors, esk9_0 = 1). % 5.55/5.87 fof(interp, fi_functors, implies(0, 0) = 0 & implies(0, 1) = 1 & % 5.55/5.87 implies(1, 0) = 0 & % 5.55/5.87 implies(1, 1) = 0). % 5.55/5.87 fof(interp, fi_predicates, is_a_theorem(0) & ~is_a_theorem(1)). % 5.55/5.87 fof(interp, fi_predicates, modus_ponens_strict_implies). % 5.55/5.87 fof(interp, fi_functors, necessarily(0) = 0 & necessarily(1) = 1). % 5.55/5.87 fof(interp, fi_predicates, necessitation). % 5.55/5.87 fof(interp, fi_functors, not(0) = 1 & not(1) = 1). % 5.55/5.87 fof(interp, fi_predicates, ~op_and). % 5.55/5.87 fof(interp, fi_predicates, op_equiv). % 5.55/5.87 fof(interp, fi_predicates, op_implies). % 5.55/5.87 fof(interp, fi_predicates, ~op_implies_and). % 5.55/5.87 fof(interp, fi_predicates, ~op_implies_or). % 5.55/5.87 fof(interp, fi_predicates, ~op_necessarily). % 5.55/5.87 fof(interp, fi_predicates, op_or). % 5.55/5.87 fof(interp, fi_predicates, op_possibly). % 5.55/5.87 fof(interp, fi_predicates, op_strict_equiv). % 5.55/5.87 fof(interp, fi_predicates, op_strict_implies). % 5.55/5.87 fof(interp, fi_functors, or(0, 0) = 1 & or(0, 1) = 1 & or(1, 0) = 1 & % 5.55/5.87 or(1, 1) = 1). % 5.55/5.87 fof(interp, fi_functors, possibly(0) = 1 & possibly(1) = 1). % 5.55/5.87 fof(interp, fi_functors, strict_equiv(0, 0) = 0 & strict_equiv(0, 1) = 1 & % 5.55/5.87 strict_equiv(1, 0) = 1 & % 5.55/5.87 strict_equiv(1, 1) = 0). % 5.55/5.87 fof(interp, fi_functors, strict_implies(0, 0) = 0 & strict_implies(0, 1) = 1 & % 5.55/5.87 strict_implies(1, 0) = 0 & % 5.55/5.87 strict_implies(1, 1) = 0). % 5.55/5.87 fof(interp, fi_predicates, substitution_strict_equiv). % 5.55/5.87 % SZS output end FiniteModel for theBenchmark.p % 5.55/5.87 % 14 lemma(s) from E % 5.55/5.87 % cnf(cl, axiom, A = and(A, A)). % 5.55/5.87 % cnf(cl, axiom, is_a_theorem(strict_implies(A, A))). % 5.55/5.87 % cnf(cl, axiom, implies(A, A) = equiv(A, A)). % 5.55/5.87 % cnf(cl, axiom, strict_implies(A, A) = strict_equiv(A, A)). % 5.55/5.87 % cnf(cl, axiom, not(not(A)) = or(A, A)). % 5.55/5.87 % cnf(cl, axiom, not(necessarily(not(A))) = possibly(A)). % 5.55/5.87 % cnf(cl, axiom, ~is_a_theorem(strict_implies(esk33_0, possibly(esk33_0)))). % 5.55/5.87 % cnf(cl, axiom, is_a_theorem(strict_implies(and(A, B), A))). % 5.55/5.87 % cnf(cl, axiom, necessarily(implies(A, B)) = strict_implies(A, B)). % 5.55/5.87 % cnf(cl, axiom, is_a_theorem(strict_implies(possibly(A), necessarily(possibly(A))))). % 5.55/5.87 % cnf(cl, axiom, is_a_theorem(strict_implies(and(A, B), and(A, B)))). % 5.55/5.87 % cnf(cl, axiom, is_a_theorem(strict_implies(strict_equiv(A, B), strict_equiv(A, B)))). % 5.55/5.87 % cnf(cl, axiom, is_a_theorem(strict_implies(equiv(A, B), equiv(A, B)))). % 5.55/5.87 % cnf(cl, axiom, is_a_theorem(strict_implies(and(A, B), B))). % 5.55/5.87 % 86 pred(s) % 5.55/5.87 % 125 func(s) % 5.55/5.87 % 1 sort(s) % 5.55/5.87 % 220 clause(s) % 5.55/5.87 % Instantiating 1 (5361 ms) % 5.55/5.87 % Solving (5368 ms) % 5.55/5.87 % Instantiating 2 (5368 ms) % 5.55/5.87 % Solving (5372 ms) % 5.55/5.87 % % 5.55/5.87 % 1 model found (5375 ms) %------------------------------------------------------------------------------