TSTP Solution File: LCL571+1 by Crossbow---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Crossbow---0.1
% Problem : LCL571+1 : TPTP v8.1.0. Released v3.3.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 : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 08:03:45 EDT 2022
% Result : CounterSatisfiable 5.42s 5.66s
% Output : FiniteModel 5.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL571+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13 % Command : do_Crossbow---0.1 %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 07:42:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.36 /export/starexec/sandbox2/solver/bin
% 0.20/0.36 crossbow.opt
% 0.20/0.36 do_Crossbow---0.1
% 0.20/0.36 eprover
% 0.20/0.36 runsolver
% 0.20/0.36 starexec_run_Crossbow---0.1
% 5.42/5.66 % SZS status CounterSatisfiable for theBenchmark.p
% 5.42/5.66 % SZS output start FiniteModel for theBenchmark.p
% 5.42/5.66 % domain size: 4
% 5.42/5.66 fof(interp, fi_domain, ![X] : (X = 0 | X = 1 | X = 2 | X = 3)).
% 5.42/5.66 fof(interp, fi_predicates, adjunction).
% 5.42/5.66 fof(interp, fi_functors, and(0, 0) = 0 & and(0, 1) = 1 & and(0, 2) = 2 &
% 5.42/5.66 and(0, 3) = 3 &
% 5.42/5.66 and(1, 0) = 1 &
% 5.42/5.66 and(1, 1) = 1 &
% 5.42/5.66 and(1, 2) = 2 &
% 5.42/5.66 and(1, 3) = 2 &
% 5.42/5.66 and(2, 0) = 2 &
% 5.42/5.66 and(2, 1) = 2 &
% 5.42/5.66 and(2, 2) = 2 &
% 5.42/5.66 and(2, 3) = 2 &
% 5.42/5.66 and(3, 0) = 3 &
% 5.42/5.66 and(3, 1) = 2 &
% 5.42/5.66 and(3, 2) = 2 &
% 5.42/5.66 and(3, 3) = 3).
% 5.42/5.66 fof(interp, fi_predicates, axiom_4).
% 5.42/5.66 fof(interp, fi_predicates, axiom_5).
% 5.42/5.66 fof(interp, fi_predicates, axiom_B).
% 5.42/5.66 fof(interp, fi_predicates, axiom_K).
% 5.42/5.66 fof(interp, fi_predicates, axiom_M).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m1).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m10).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m2).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m3).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m4).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m5).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m6).
% 5.42/5.66 fof(interp, fi_predicates, ~axiom_m7).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m8).
% 5.42/5.66 fof(interp, fi_predicates, axiom_m9).
% 5.42/5.66 fof(interp, fi_predicates, axiom_s1).
% 5.42/5.66 fof(interp, fi_predicates, axiom_s2).
% 5.42/5.66 fof(interp, fi_predicates, axiom_s3).
% 5.42/5.66 fof(interp, fi_predicates, axiom_s4).
% 5.42/5.66 fof(interp, fi_functors, equiv(0, 0) = 0 & equiv(0, 1) = 1 & equiv(0, 2) = 2 &
% 5.42/5.66 equiv(0, 3) = 3 &
% 5.42/5.66 equiv(1, 0) = 1 &
% 5.42/5.66 equiv(1, 1) = 0 &
% 5.42/5.66 equiv(1, 2) = 3 &
% 5.42/5.66 equiv(1, 3) = 2 &
% 5.42/5.66 equiv(2, 0) = 2 &
% 5.42/5.66 equiv(2, 1) = 3 &
% 5.42/5.66 equiv(2, 2) = 0 &
% 5.42/5.66 equiv(2, 3) = 1 &
% 5.42/5.66 equiv(3, 0) = 3 &
% 5.42/5.66 equiv(3, 1) = 2 &
% 5.42/5.66 equiv(3, 2) = 1 &
% 5.42/5.66 equiv(3, 3) = 0).
% 5.42/5.66 fof(interp, fi_functors, esk10_0 = 1).
% 5.42/5.66 fof(interp, fi_functors, esk11_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk12_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk13_0 = 3).
% 5.42/5.66 fof(interp, fi_functors, esk14_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk15_0 = 1).
% 5.42/5.66 fof(interp, fi_functors, esk16_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk17_0 = 3).
% 5.42/5.66 fof(interp, fi_functors, esk18_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk19_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk1_0 = 1).
% 5.42/5.66 fof(interp, fi_functors, esk20_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk21_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk22_0 = 1).
% 5.42/5.66 fof(interp, fi_functors, esk23_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk24_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk25_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk26_0 = 3).
% 5.42/5.66 fof(interp, fi_functors, esk27_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk28_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk29_0 = 3).
% 5.42/5.66 fof(interp, fi_functors, esk2_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk30_0 = 3).
% 5.42/5.66 fof(interp, fi_functors, esk31_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk32_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk33_0 = 3).
% 5.42/5.66 fof(interp, fi_functors, esk34_0 = 1).
% 5.42/5.66 fof(interp, fi_functors, esk35_0 = 1).
% 5.42/5.66 fof(interp, fi_functors, esk36_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk37_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk38_0 = 2).
% 5.42/5.66 fof(interp, fi_functors, esk39_0 = 1).
% 5.42/5.66 fof(interp, fi_functors, esk3_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk4_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk5_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk6_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk7_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk8_0 = 0).
% 5.42/5.66 fof(interp, fi_functors, esk9_0 = 1).
% 5.42/5.66 fof(interp, fi_functors, implies(0, 0) = 0 & implies(0, 1) = 1 &
% 5.42/5.66 implies(0, 2) = 2 &
% 5.42/5.66 implies(0, 3) = 3 &
% 5.42/5.66 implies(1, 0) = 0 &
% 5.42/5.66 implies(1, 1) = 0 &
% 5.42/5.66 implies(1, 2) = 3 &
% 5.42/5.66 implies(1, 3) = 3 &
% 5.42/5.66 implies(2, 0) = 0 &
% 5.42/5.66 implies(2, 1) = 0 &
% 5.42/5.66 implies(2, 2) = 0 &
% 5.42/5.66 implies(2, 3) = 0 &
% 5.42/5.66 implies(3, 0) = 0 &
% 5.42/5.66 implies(3, 1) = 1 &
% 5.42/5.66 implies(3, 2) = 1 &
% 5.42/5.66 implies(3, 3) = 0).
% 5.42/5.66 fof(interp, fi_predicates, is_a_theorem(0) & is_a_theorem(1) & ~is_a_theorem(2) &
% 5.42/5.66 ~is_a_theorem(3)).
% 5.42/5.66 fof(interp, fi_predicates, modus_ponens_strict_implies).
% 5.42/5.66 fof(interp, fi_functors, necessarily(0) = 0 & necessarily(1) = 2 &
% 5.42/5.66 necessarily(2) = 2 &
% 5.42/5.66 necessarily(3) = 2).
% 5.42/5.66 fof(interp, fi_predicates, ~necessitation).
% 5.42/5.66 fof(interp, fi_functors, not(0) = 2 & not(1) = 3 & not(2) = 0 & not(3) = 1).
% 5.42/5.66 fof(interp, fi_predicates, ~op_and).
% 5.42/5.66 fof(interp, fi_predicates, op_equiv).
% 5.42/5.66 fof(interp, fi_predicates, op_implies).
% 5.42/5.66 fof(interp, fi_predicates, op_implies_and).
% 5.42/5.66 fof(interp, fi_predicates, ~op_implies_or).
% 5.42/5.66 fof(interp, fi_predicates, ~op_necessarily).
% 5.42/5.66 fof(interp, fi_predicates, op_or).
% 5.42/5.66 fof(interp, fi_predicates, op_possibly).
% 5.42/5.66 fof(interp, fi_predicates, op_strict_equiv).
% 5.42/5.66 fof(interp, fi_predicates, op_strict_implies).
% 5.42/5.66 fof(interp, fi_functors, or(0, 0) = 0 & or(0, 1) = 0 & or(0, 2) = 0 &
% 5.42/5.66 or(0, 3) = 0 &
% 5.42/5.66 or(1, 0) = 0 &
% 5.42/5.66 or(1, 1) = 1 &
% 5.42/5.66 or(1, 2) = 1 &
% 5.42/5.66 or(1, 3) = 0 &
% 5.42/5.66 or(2, 0) = 0 &
% 5.42/5.66 or(2, 1) = 1 &
% 5.42/5.66 or(2, 2) = 2 &
% 5.42/5.66 or(2, 3) = 3 &
% 5.42/5.66 or(3, 0) = 0 &
% 5.42/5.66 or(3, 1) = 0 &
% 5.42/5.66 or(3, 2) = 3 &
% 5.42/5.66 or(3, 3) = 3).
% 5.42/5.66 fof(interp, fi_functors, possibly(0) = 0 & possibly(1) = 0 & possibly(2) = 2 &
% 5.42/5.66 possibly(3) = 0).
% 5.42/5.66 fof(interp, fi_functors, strict_equiv(0, 0) = 0 & strict_equiv(0, 1) = 2 &
% 5.42/5.66 strict_equiv(0, 2) = 2 &
% 5.42/5.66 strict_equiv(0, 3) = 2 &
% 5.42/5.66 strict_equiv(1, 0) = 2 &
% 5.42/5.66 strict_equiv(1, 1) = 0 &
% 5.42/5.66 strict_equiv(1, 2) = 2 &
% 5.42/5.66 strict_equiv(1, 3) = 2 &
% 5.42/5.66 strict_equiv(2, 0) = 2 &
% 5.42/5.66 strict_equiv(2, 1) = 2 &
% 5.42/5.66 strict_equiv(2, 2) = 0 &
% 5.42/5.66 strict_equiv(2, 3) = 2 &
% 5.42/5.66 strict_equiv(3, 0) = 2 &
% 5.42/5.66 strict_equiv(3, 1) = 2 &
% 5.42/5.66 strict_equiv(3, 2) = 2 &
% 5.42/5.66 strict_equiv(3, 3) = 0).
% 5.42/5.66 fof(interp, fi_functors, strict_implies(0, 0) = 0 & strict_implies(0, 1) = 2 &
% 5.42/5.66 strict_implies(0, 2) = 2 &
% 5.42/5.66 strict_implies(0, 3) = 2 &
% 5.42/5.66 strict_implies(1, 0) = 0 &
% 5.42/5.66 strict_implies(1, 1) = 0 &
% 5.42/5.66 strict_implies(1, 2) = 2 &
% 5.42/5.66 strict_implies(1, 3) = 2 &
% 5.42/5.66 strict_implies(2, 0) = 0 &
% 5.42/5.66 strict_implies(2, 1) = 0 &
% 5.42/5.66 strict_implies(2, 2) = 0 &
% 5.42/5.66 strict_implies(2, 3) = 0 &
% 5.42/5.66 strict_implies(3, 0) = 0 &
% 5.42/5.66 strict_implies(3, 1) = 2 &
% 5.42/5.66 strict_implies(3, 2) = 2 &
% 5.42/5.66 strict_implies(3, 3) = 0).
% 5.42/5.66 fof(interp, fi_predicates, substitution_of_equivalents).
% 5.42/5.66 fof(interp, fi_predicates, substitution_strict_equiv).
% 5.42/5.66 % SZS output end FiniteModel for theBenchmark.p
% 5.42/5.66 % 18 lemma(s) from E
% 5.42/5.66 % cnf(cl, axiom, is_a_theorem(esk1_0)).
% 5.42/5.66 % cnf(cl, axiom, A = and(A, A)).
% 5.42/5.66 % cnf(cl, axiom, is_a_theorem(strict_implies(A, A))).
% 5.42/5.66 % cnf(cl, axiom, implies(A, A) = equiv(A, A)).
% 5.42/5.66 % cnf(cl, axiom, strict_implies(A, A) = strict_equiv(A, A)).
% 5.42/5.66 % cnf(cl, axiom, not(not(A)) = or(A, A)).
% 5.42/5.66 % cnf(cl, axiom, ~is_a_theorem(necessarily(esk1_0))).
% 5.42/5.66 % cnf(cl, axiom, not(necessarily(not(A))) = possibly(A)).
% 5.42/5.66 % cnf(cl, axiom, not(strict_implies(not(A), A)) = possibly(not(A))).
% 5.42/5.66 % cnf(cl, axiom, necessarily(not(not(A))) = strict_implies(not(A), A)).
% 5.42/5.66 % cnf(cl, axiom, is_a_theorem(strict_implies(and(A, B), A))).
% 5.42/5.66 % cnf(cl, axiom, necessarily(implies(A, B)) = strict_implies(A, B)).
% 5.42/5.66 % cnf(cl, axiom, is_a_theorem(strict_implies(possibly(A), necessarily(possibly(A))))).
% 5.42/5.66 % cnf(cl, axiom, is_a_theorem(strict_implies(and(A, B), and(A, B)))).
% 5.42/5.66 % cnf(cl, axiom, or(A, B) = implies(not(A), B)).
% 5.42/5.66 % cnf(cl, axiom, is_a_theorem(strict_implies(strict_equiv(A, B), strict_equiv(A, B)))).
% 5.42/5.66 % cnf(cl, axiom, is_a_theorem(strict_implies(equiv(A, B), equiv(A, B)))).
% 5.42/5.66 % cnf(cl, axiom, is_a_theorem(strict_implies(and(A, B), B))).
% 5.42/5.66 % 89 pred(s)
% 5.42/5.66 % 125 func(s)
% 5.42/5.66 % 1 sort(s)
% 5.42/5.66 % 230 clause(s)
% 5.42/5.66 % Instantiating 1 (5200 ms)
% 5.42/5.66 % Solving (5203 ms)
% 5.42/5.66 % Instantiating 2 (5203 ms)
% 5.42/5.66 % Solving (5204 ms)
% 5.42/5.66 % Instantiating 3 (5204 ms)
% 5.42/5.66 % Solving (5208 ms)
% 5.42/5.66 % Instantiating 4 (5212 ms)
% 5.42/5.66 % Solving (5223 ms)
% 5.42/5.66 %
% 5.42/5.66 % 1 model found (5274 ms)
%------------------------------------------------------------------------------