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