TSTP Solution File: LCL911+1 by Crossbow---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Crossbow---0.1
% Problem : LCL911+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_Crossbow---0.1 %s
% Computer : n021.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:08:11 EDT 2022
% Result : Satisfiable 6.01s 6.21s
% Output : FiniteModel 6.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL911+1 : TPTP v8.1.0. Released v6.4.0.
% 0.07/0.13 % Command : do_Crossbow---0.1 %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 18:36:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 /export/starexec/sandbox2/solver/bin
% 0.13/0.35 crossbow.opt
% 0.13/0.35 do_Crossbow---0.1
% 0.13/0.35 eprover
% 0.13/0.35 runsolver
% 0.13/0.35 starexec_run_Crossbow---0.1
% 6.01/6.21 % SZS status Satisfiable for theBenchmark.p
% 6.01/6.21 % SZS output start FiniteModel for theBenchmark.p
% 6.01/6.21 % domain size: 1
% 6.01/6.21 fof(interp, fi_domain, ![X] : X = 0).
% 6.01/6.21 fof(interp, fi_predicates, adjunction).
% 6.01/6.21 fof(interp, fi_functors, and(0, 0) = 0).
% 6.01/6.21 fof(interp, fi_predicates, and_1).
% 6.01/6.21 fof(interp, fi_predicates, and_2).
% 6.01/6.21 fof(interp, fi_predicates, and_3).
% 6.01/6.21 fof(interp, fi_predicates, axiom_4).
% 6.01/6.21 fof(interp, fi_predicates, axiom_5).
% 6.01/6.21 fof(interp, fi_predicates, axiom_B).
% 6.01/6.21 fof(interp, fi_predicates, axiom_K).
% 6.01/6.21 fof(interp, fi_predicates, axiom_M).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m1).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m10).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m2).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m3).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m4).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m5).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m6).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m7).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m8).
% 6.01/6.21 fof(interp, fi_predicates, axiom_m9).
% 6.01/6.21 fof(interp, fi_predicates, axiom_s1).
% 6.01/6.21 fof(interp, fi_predicates, axiom_s2).
% 6.01/6.21 fof(interp, fi_predicates, axiom_s3).
% 6.01/6.21 fof(interp, fi_predicates, axiom_s4).
% 6.01/6.21 fof(interp, fi_predicates, cn1).
% 6.01/6.21 fof(interp, fi_predicates, cn2).
% 6.01/6.21 fof(interp, fi_predicates, cn3).
% 6.01/6.21 fof(interp, fi_functors, equiv(0, 0) = 0).
% 6.01/6.21 fof(interp, fi_predicates, equivalence_1).
% 6.01/6.21 fof(interp, fi_predicates, equivalence_2).
% 6.01/6.21 fof(interp, fi_predicates, equivalence_3).
% 6.01/6.21 fof(interp, fi_functors, esk10_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk11_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk12_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk13_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk14_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk15_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk16_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk17_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk18_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk19_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk1_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk20_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk21_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk22_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk23_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk24_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk25_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk26_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk27_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk28_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk29_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk2_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk30_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk31_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk32_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk33_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk34_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk35_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk36_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk37_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk38_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk39_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk3_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk40_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk41_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk42_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk43_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk44_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk45_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk46_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk47_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk48_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk49_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk4_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk50_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk51_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk52_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk53_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk54_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk55_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk56_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk57_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk58_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk59_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk5_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk60_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk61_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk62_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk63_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk64_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk65_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk66_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk67_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk68_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk69_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk6_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk70_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk71_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk72_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk73_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk74_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk75_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk76_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk77_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk78_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk79_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk7_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk80_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk81_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk82_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk83_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk84_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk85_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk86_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk87_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk88_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk89_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk8_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk90_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk91_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk92_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk93_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk94_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, esk9_0 = 0).
% 6.01/6.21 fof(interp, fi_functors, implies(0, 0) = 0).
% 6.01/6.21 fof(interp, fi_predicates, implies_1).
% 6.01/6.21 fof(interp, fi_predicates, implies_2).
% 6.01/6.21 fof(interp, fi_predicates, implies_3).
% 6.01/6.21 fof(interp, fi_predicates, is_a_theorem(0)).
% 6.01/6.21 fof(interp, fi_predicates, kn1).
% 6.01/6.21 fof(interp, fi_predicates, kn2).
% 6.01/6.21 fof(interp, fi_predicates, kn3).
% 6.01/6.21 fof(interp, fi_predicates, modus_ponens).
% 6.01/6.21 fof(interp, fi_predicates, modus_ponens_strict_implies).
% 6.01/6.21 fof(interp, fi_predicates, modus_tollens).
% 6.01/6.21 fof(interp, fi_functors, necessarily(0) = 0).
% 6.01/6.21 fof(interp, fi_predicates, necessitation).
% 6.01/6.21 fof(interp, fi_functors, not(0) = 0).
% 6.01/6.21 fof(interp, fi_predicates, ~op_and).
% 6.01/6.21 fof(interp, fi_predicates, op_equiv).
% 6.01/6.21 fof(interp, fi_predicates, op_implies_and).
% 6.01/6.21 fof(interp, fi_predicates, ~op_implies_or).
% 6.01/6.21 fof(interp, fi_predicates, ~op_necessarily).
% 6.01/6.21 fof(interp, fi_predicates, op_or).
% 6.01/6.21 fof(interp, fi_predicates, op_possibly).
% 6.01/6.21 fof(interp, fi_predicates, ~op_strict_equiv).
% 6.01/6.21 fof(interp, fi_predicates, ~op_strict_implies).
% 6.01/6.21 fof(interp, fi_functors, or(0, 0) = 0).
% 6.01/6.21 fof(interp, fi_predicates, or_1).
% 6.01/6.21 fof(interp, fi_predicates, or_2).
% 6.01/6.21 fof(interp, fi_predicates, or_3).
% 6.01/6.21 fof(interp, fi_functors, possibly(0) = 0).
% 6.01/6.21 fof(interp, fi_predicates, r1).
% 6.01/6.21 fof(interp, fi_predicates, r2).
% 6.01/6.21 fof(interp, fi_predicates, r3).
% 6.01/6.21 fof(interp, fi_predicates, r4).
% 6.01/6.21 fof(interp, fi_predicates, r5).
% 6.01/6.21 fof(interp, fi_functors, strict_equiv(0, 0) = 0).
% 6.01/6.21 fof(interp, fi_functors, strict_implies(0, 0) = 0).
% 6.01/6.21 fof(interp, fi_predicates, substitution_of_equivalents).
% 6.01/6.21 fof(interp, fi_predicates, substitution_strict_equiv).
% 6.01/6.21 % SZS output end FiniteModel for theBenchmark.p
% 6.01/6.21 % 20 lemma(s) from E
% 6.01/6.21 % cnf(cl, axiom, r2).
% 6.01/6.21 % cnf(cl, axiom, kn2).
% 6.01/6.21 % cnf(cl, axiom, adjunction).
% 6.01/6.21 % cnf(cl, axiom, cn2).
% 6.01/6.21 % cnf(cl, axiom, kn1).
% 6.01/6.21 % cnf(cl, axiom, is_a_theorem(implies(A, A))).
% 6.01/6.21 % cnf(cl, axiom, or(A, B) = or(A, or(A, B))).
% 6.01/6.21 % cnf(cl, axiom, implies(A, B) = implies(A, implies(A, B))).
% 6.01/6.21 % cnf(cl, axiom, implies(A, A) = equiv(A, A)).
% 6.01/6.21 % cnf(cl, axiom, necessarily(possibly(A)) = possibly(A)).
% 6.01/6.21 % cnf(cl, axiom, not(not(possibly(A))) = possibly(possibly(A))).
% 6.01/6.21 % cnf(cl, axiom, implies(A, A) = implies(B, B)).
% 6.01/6.21 % cnf(cl, axiom, is_a_theorem(implies(necessarily(A), A))).
% 6.01/6.21 % cnf(cl, axiom, is_a_theorem(implies(A, implies(B, A)))).
% 6.01/6.21 % cnf(cl, axiom, not(necessarily(not(A))) = possibly(A)).
% 6.01/6.21 % cnf(cl, axiom, is_a_theorem(or(A, not(A)))).
% 6.01/6.21 % cnf(cl, axiom, is_a_theorem(implies(A, and(A, A)))).
% 6.01/6.21 % cnf(cl, axiom, is_a_theorem(implies(A, implies(B, B)))).
% 6.01/6.21 % cnf(cl, axiom, necessarily(not(possibly(A))) = not(possibly(A))).
% 6.01/6.21 % cnf(cl, axiom, implies(B, B) = implies(necessarily(A), A)).
% 6.01/6.21 % 151 pred(s)
% 6.01/6.21 % 265 func(s)
% 6.01/6.21 % 1 sort(s)
% 6.01/6.21 % 413 clause(s)
% 6.01/6.21 % Instantiating 1 (5823 ms)
% 6.01/6.21 % Solving (5823 ms)
% 6.01/6.21 %
% 6.01/6.21 % 1 model found (5824 ms)
%------------------------------------------------------------------------------