%------------------------------------------------------------------------------ % File : Crossbow---0.1 % Problem : LCL907+1 : TPTP v9.3.1. Bugfixed v9.2.0. % Transfm : none % Format : tptp:raw % Command : do_Crossbow---0.1 %s % Computer : n007.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:18:23 AM UTC 2026 % Result : Satisfiable 5.35s 5.68s % Output : FiniteModel 5.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL907+1 : TPTP v9.3.1. Bugfixed v9.2.0. % 0.00/0.04 % Command : do_Crossbow---0.1 %s % 0.09/0.35 % Computer : n007.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Sat Sep 5 23:59:25 UTC 2026 % 0.09/0.35 % CPUTime : % 0.09/0.36 /export/starexec/sandbox/solver/bin % 0.09/0.36 crossbow.opt % 0.09/0.36 do_Crossbow---0.1 % 0.09/0.36 eprover % 0.09/0.36 runsolver % 0.09/0.36 starexec_run_Crossbow---0.1 % 5.35/5.68 % SZS status Satisfiable for theBenchmark.p % 5.35/5.68 % SZS output start FiniteModel for theBenchmark.p % 5.35/5.68 % domain size: 1 % 5.35/5.68 fof(interp, fi_domain, ![X] : X = 0). % 5.35/5.68 fof(interp, fi_functors, and(0, 0) = 0). % 5.35/5.68 fof(interp, fi_predicates, and_1). % 5.35/5.68 fof(interp, fi_predicates, and_2). % 5.35/5.68 fof(interp, fi_predicates, and_3). % 5.35/5.68 fof(interp, fi_predicates, cn1). % 5.35/5.68 fof(interp, fi_predicates, cn2). % 5.35/5.68 fof(interp, fi_predicates, cn3). % 5.35/5.68 fof(interp, fi_functors, equiv(0, 0) = 0). % 5.35/5.68 fof(interp, fi_predicates, equivalence_1). % 5.35/5.68 fof(interp, fi_predicates, equivalence_2). % 5.35/5.68 fof(interp, fi_predicates, equivalence_3). % 5.35/5.68 fof(interp, fi_functors, esk10_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk11_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk12_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk13_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk14_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk15_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk16_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk17_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk18_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk19_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk1_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk20_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk21_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk22_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk23_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk24_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk25_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk26_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk27_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk28_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk29_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk2_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk30_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk31_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk32_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk33_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk34_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk35_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk36_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk37_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk38_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk39_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk3_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk40_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk41_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk42_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk43_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk44_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk45_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk46_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk47_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk48_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk49_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk4_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk50_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk51_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk52_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk53_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk54_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk55_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk5_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk6_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk7_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk8_0 = 0). % 5.35/5.68 fof(interp, fi_functors, esk9_0 = 0). % 5.35/5.68 fof(interp, fi_functors, implies(0, 0) = 0). % 5.35/5.68 fof(interp, fi_predicates, implies_1). % 5.35/5.68 fof(interp, fi_predicates, implies_2). % 5.35/5.68 fof(interp, fi_predicates, implies_3). % 5.35/5.68 fof(interp, fi_predicates, is_a_theorem(0)). % 5.35/5.68 fof(interp, fi_predicates, kn1). % 5.35/5.68 fof(interp, fi_predicates, kn2). % 5.35/5.68 fof(interp, fi_predicates, kn3). % 5.35/5.68 fof(interp, fi_predicates, modus_ponens). % 5.35/5.68 fof(interp, fi_predicates, modus_tollens). % 5.35/5.69 fof(interp, fi_functors, not(0) = 0). % 5.35/5.69 fof(interp, fi_predicates, ~op_and). % 5.35/5.69 fof(interp, fi_predicates, op_equiv). % 5.35/5.69 fof(interp, fi_predicates, op_implies_and). % 5.35/5.69 fof(interp, fi_predicates, ~op_implies_or). % 5.35/5.69 fof(interp, fi_predicates, op_or). % 5.35/5.69 fof(interp, fi_functors, or(0, 0) = 0). % 5.35/5.69 fof(interp, fi_predicates, or_1). % 5.35/5.69 fof(interp, fi_predicates, or_2). % 5.35/5.69 fof(interp, fi_predicates, or_3). % 5.35/5.69 fof(interp, fi_predicates, r1). % 5.35/5.69 fof(interp, fi_predicates, r2). % 5.35/5.69 fof(interp, fi_predicates, r3). % 5.35/5.69 fof(interp, fi_predicates, r4). % 5.35/5.69 fof(interp, fi_predicates, r5). % 5.35/5.69 fof(interp, fi_predicates, substitution_of_equivalents). % 5.35/5.69 % SZS output end FiniteModel for theBenchmark.p % 5.35/5.69 % 20 lemma(s) from E % 5.35/5.69 % cnf(cl, axiom, r2). % 5.35/5.69 % cnf(cl, axiom, kn2). % 5.35/5.69 % cnf(cl, axiom, cn2). % 5.35/5.69 % cnf(cl, axiom, kn1). % 5.35/5.69 % cnf(cl, axiom, A = and(A, A)). % 5.35/5.69 % cnf(cl, axiom, not(not(A)) = not(not(not(not(A))))). % 5.35/5.69 % cnf(cl, axiom, is_a_theorem(implies(A, A))). % 5.35/5.69 % cnf(cl, axiom, implies(A, B) = implies(A, implies(A, B))). % 5.35/5.69 % cnf(cl, axiom, implies(A, A) = equiv(A, A)). % 5.35/5.69 % cnf(cl, axiom, implies(not(A), A) = not(not(A))). % 5.35/5.69 % cnf(cl, axiom, implies(A, A) = not(not(implies(A, A)))). % 5.35/5.69 % cnf(cl, axiom, implies(not(A), not(not(A))) = not(not(A))). % 5.35/5.69 % cnf(cl, axiom, implies(A, A) = implies(B, B)). % 5.35/5.69 % cnf(cl, axiom, is_a_theorem(implies(A, implies(B, A)))). % 5.35/5.69 % cnf(cl, axiom, is_a_theorem(implies(A, implies(B, B)))). % 5.35/5.69 % cnf(cl, axiom, implies(B, B) = and(implies(A, A), implies(B, B))). % 5.35/5.69 % cnf(cl, axiom, is_a_theorem(implies(A, not(not(A))))). % 5.35/5.69 % cnf(cl, axiom, implies(implies(B, A), A) = equiv(A, implies(B, A))). % 5.35/5.69 % cnf(cl, axiom, implies(A, A) = implies(not(implies(A, A)), B)). % 5.35/5.69 % cnf(cl, axiom, implies(not(not(A)), A) = equiv(A, not(not(A)))). % 5.35/5.69 % 87 pred(s) % 5.35/5.69 % 144 func(s) % 5.35/5.69 % 1 sort(s) % 5.35/5.69 % 237 clause(s) % 5.35/5.69 % Instantiating 1 (5291 ms) % 5.35/5.69 % Solving (5292 ms) % 5.35/5.69 % % 5.35/5.69 % 1 model found (5294 ms) %------------------------------------------------------------------------------