TSTP Solution File: LCL909+1 by Crossbow---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Crossbow---0.1
% Problem : LCL909+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_Crossbow---0.1 %s
% Computer : n010.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:10 EDT 2022
% Result : Satisfiable 5.36s 5.60s
% Output : FiniteModel 5.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL909+1 : TPTP v8.1.0. Released v6.4.0.
% 0.03/0.12 % Command : do_Crossbow---0.1 %s
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 4 23:09:17 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.33 /export/starexec/sandbox/solver/bin
% 0.11/0.34 crossbow.opt
% 0.11/0.34 do_Crossbow---0.1
% 0.11/0.34 eprover
% 0.11/0.34 runsolver
% 0.11/0.34 starexec_run_Crossbow---0.1
% 5.36/5.60 % SZS status Satisfiable for theBenchmark.p
% 5.36/5.60 % SZS output start FiniteModel for theBenchmark.p
% 5.36/5.60 % domain size: 1
% 5.36/5.60 fof(interp, fi_domain, ![X] : X = 0).
% 5.36/5.60 fof(interp, fi_functors, and(0, 0) = 0).
% 5.36/5.60 fof(interp, fi_predicates, and_1).
% 5.36/5.60 fof(interp, fi_predicates, and_2).
% 5.36/5.60 fof(interp, fi_predicates, and_3).
% 5.36/5.60 fof(interp, fi_predicates, cn1).
% 5.36/5.60 fof(interp, fi_predicates, cn2).
% 5.36/5.60 fof(interp, fi_predicates, cn3).
% 5.36/5.60 fof(interp, fi_functors, equiv(0, 0) = 0).
% 5.36/5.60 fof(interp, fi_predicates, equivalence_1).
% 5.36/5.60 fof(interp, fi_predicates, equivalence_2).
% 5.36/5.60 fof(interp, fi_predicates, equivalence_3).
% 5.36/5.60 fof(interp, fi_functors, esk10_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk11_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk12_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk13_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk14_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk15_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk16_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk17_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk18_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk19_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk1_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk20_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk21_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk22_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk23_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk24_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk25_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk26_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk27_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk28_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk29_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk2_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk30_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk31_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk32_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk33_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk34_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk35_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk36_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk37_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk38_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk39_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk3_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk40_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk41_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk42_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk43_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk44_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk45_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk46_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk47_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk48_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk49_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk4_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk50_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk51_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk52_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk53_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk54_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk55_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk5_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk6_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk7_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk8_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, esk9_0 = 0).
% 5.36/5.60 fof(interp, fi_functors, implies(0, 0) = 0).
% 5.36/5.60 fof(interp, fi_predicates, implies_1).
% 5.36/5.60 fof(interp, fi_predicates, implies_2).
% 5.36/5.60 fof(interp, fi_predicates, implies_3).
% 5.36/5.60 fof(interp, fi_predicates, is_a_theorem(0)).
% 5.36/5.60 fof(interp, fi_predicates, kn1).
% 5.36/5.60 fof(interp, fi_predicates, kn2).
% 5.36/5.60 fof(interp, fi_predicates, kn3).
% 5.36/5.60 fof(interp, fi_predicates, modus_ponens).
% 5.36/5.60 fof(interp, fi_predicates, modus_tollens).
% 5.36/5.60 fof(interp, fi_functors, not(0) = 0).
% 5.36/5.60 fof(interp, fi_predicates, op_and).
% 5.36/5.60 fof(interp, fi_predicates, op_equiv).
% 5.36/5.60 fof(interp, fi_predicates, ~op_implies_and).
% 5.36/5.60 fof(interp, fi_predicates, op_implies_or).
% 5.36/5.60 fof(interp, fi_predicates, ~op_or).
% 5.36/5.60 fof(interp, fi_functors, or(0, 0) = 0).
% 5.36/5.60 fof(interp, fi_predicates, or_1).
% 5.36/5.60 fof(interp, fi_predicates, or_2).
% 5.36/5.60 fof(interp, fi_predicates, or_3).
% 5.36/5.60 fof(interp, fi_predicates, r1).
% 5.36/5.60 fof(interp, fi_predicates, r2).
% 5.36/5.60 fof(interp, fi_predicates, r3).
% 5.36/5.60 fof(interp, fi_predicates, r4).
% 5.36/5.60 fof(interp, fi_predicates, r5).
% 5.36/5.60 fof(interp, fi_predicates, substitution_of_equivalents).
% 5.36/5.60 % SZS output end FiniteModel for theBenchmark.p
% 5.36/5.60 % 10 lemma(s) from E
% 5.36/5.60 % cnf(cl, axiom, implies_1).
% 5.36/5.60 % cnf(cl, axiom, or_2).
% 5.36/5.60 % cnf(cl, axiom, kn1).
% 5.36/5.60 % cnf(cl, axiom, is_a_theorem(implies(or(A, A), A))).
% 5.36/5.60 % cnf(cl, axiom, is_a_theorem(implies(A, implies(B, A)))).
% 5.36/5.60 % cnf(cl, axiom, is_a_theorem(implies(implies(A, not(A)), not(A)))).
% 5.36/5.60 % cnf(cl, axiom, is_a_theorem(implies(A, and(A, A)))).
% 5.36/5.60 % cnf(cl, axiom, is_a_theorem(implies(implies(A, A), equiv(A, A)))).
% 5.36/5.60 % cnf(cl, axiom, is_a_theorem(implies(A, or(B, A)))).
% 5.36/5.60 % cnf(cl, axiom, implies(A, B) = or(not(A), B)).
% 5.36/5.60 % 83 pred(s)
% 5.36/5.60 % 144 func(s)
% 5.36/5.60 % 1 sort(s)
% 5.36/5.60 % 215 clause(s)
% 5.36/5.60 % Instantiating 1 (5234 ms)
% 5.36/5.60 % Solving (5234 ms)
% 5.36/5.60 %
% 5.36/5.60 % 1 model found (5235 ms)
%------------------------------------------------------------------------------