TSTP Solution File: LCL832-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL832-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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 13:50:38 EDT 2022
% Result : Timeout 300.02s 300.26s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL832-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n013.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 : Mon Jul 4 15:45:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.03 ============================== Prover9 ===============================
% 0.45/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03 Process 18614 was started by sandbox on n013.cluster.edu,
% 0.45/1.03 Mon Jul 4 15:45:30 2022
% 0.45/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18460_n013.cluster.edu".
% 0.45/1.03 ============================== end of head ===========================
% 0.45/1.03
% 0.45/1.03 ============================== INPUT =================================
% 0.45/1.03
% 0.45/1.03 % Reading from file /tmp/Prover9_18460_n013.cluster.edu
% 0.45/1.03
% 0.45/1.03 set(prolog_style_variables).
% 0.45/1.03 set(auto2).
% 0.45/1.03 % set(auto2) -> set(auto).
% 0.45/1.03 % set(auto) -> set(auto_inference).
% 0.45/1.03 % set(auto) -> set(auto_setup).
% 0.45/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03 % set(auto) -> set(auto_limits).
% 0.45/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03 % set(auto) -> set(auto_denials).
% 0.45/1.03 % set(auto) -> set(auto_process).
% 0.45/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03 % set(auto2) -> assign(stats, some).
% 0.45/1.03 % set(auto2) -> clear(echo_input).
% 0.45/1.03 % set(auto2) -> set(quiet).
% 0.45/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03 % set(auto2) -> clear(print_given).
% 0.45/1.03 assign(lrs_ticks,-1).
% 0.45/1.03 assign(sos_limit,10000).
% 0.45/1.03 assign(order,kbo).
% 0.45/1.03 set(lex_order_vars).
% 0.45/1.03 clear(print_given).
% 0.45/1.03
% 0.45/1.03 % formulas(sos). % not echoed (75 formulas)
% 0.45/1.03
% 0.45/1.03 ============================== end of input ==========================
% 0.45/1.03
% 0.45/1.03 % From the command line: assign(max_seconds, 300).
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03
% 0.45/1.03 % Formulas that are not ordinary clauses:
% 0.45/1.03
% 0.45/1.03 ============================== end of process non-clausal formulas ===
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03
% 0.45/1.03 ============================== PREDICATE ELIMINATION =================
% 0.45/1.03 1 -class_Ring__and__Field_Oordered__semidom(A) | -c_HOL_Oord__class_Oless(c_Nat_Osemiring__1__class_Oof__nat(B,A),c_HOL_Ozero__class_Ozero(A),A) # label(cls_of__nat__less__0__iff_0) # label(axiom). [assumption].
% 0.45/1.03 2 class_Ring__and__Field_Oordered__semidom(tc_nat) # label(clsarity_nat__Ring__and__Field_Oordered__semidom) # label(axiom). [assumption].
% 0.45/1.03 Derived: -c_HOL_Oord__class_Oless(c_Nat_Osemiring__1__class_Oof__nat(A,tc_nat),c_HOL_Ozero__class_Ozero(tc_nat),tc_nat). [resolve(1,a,2,a)].
% 0.45/1.03 3 -class_Ring__and__Field_Oordered__semidom(A) | c_HOL_Oord__class_Oless(c_Nat_Osemiring__1__class_Oof__nat(B,A),c_Nat_Osemiring__1__class_Oof__nat(C,A),A) | -c_HOL_Oord__class_Oless(B,C,tc_nat) # label(cls_of__nat__less__iff_1) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_HOL_Oord__class_Oless(c_Nat_Osemiring__1__class_Oof__nat(A,tc_nat),c_Nat_Osemiring__1__class_Oof__nat(B,tc_nat),tc_nat) | -c_HOL_Oord__class_Oless(A,B,tc_nat). [resolve(3,a,2,a)].
% 0.45/1.03 4 -class_Ring__and__Field_Oordered__semidom(A) | c_HOL_Oord__class_Oless(B,C,tc_nat) | -c_HOL_Oord__class_Oless(c_Nat_Osemiring__1__class_Oof__nat(B,A),c_Nat_Osemiring__1__class_Oof__nat(C,A),A) # label(cls_of__nat__less__iff_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_HOL_Oord__class_Oless(A,B,tc_nat) | -c_HOL_Oord__class_Oless(c_Nat_Osemiring__1__class_Oof__nat(A,tc_nat),c_Nat_Osemiring__1__class_Oof__nat(B,tc_nat),tc_nat). [resolve(4,a,2,a)].
% 0.45/1.03 5 -class_Ring__and__Field_Oordered__semidom(A) | c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),B,tc_nat) | -c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(A),c_Nat_Osemiring__1__class_Oof__nat(B,A),A) # label(cls_of__nat__0__less__iff_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),A,tc_nat) | -c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),c_Nat_Osemiring__1__class_Oof__nat(A,tc_nat),tc_nat). [resolve(5,a,2,a)].
% 0.45/1.03 6 -class_Ring__and__Field_Oordered__semidom(A) | c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(A),c_Nat_Osemiring__1__class_Oof__nat(B,A),A) | -c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),B,tc_nat) # label(cls_of__nat__0__less__iff_1) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),c_Nat_Osemiring__1__class_Oof__nat(A,tc_nat),tc_nat) | -c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),A,tc_nat). [resolve(6,a,2,a)].
% 0.45/1.03 7 -class_Ring__and__Field_Osemiring__1(A) | c_Nat_Osemiring__1__class_Oof__nat(c_HOL_Ozero__class_Ozero(tc_nat),A) = c_HOL_Ozero__class_Ozero(A) # label(cls_of__nat__0_0) # label(axiom). [assumption].
% 0.45/1.03 8 class_Ring__and__Field_Osemiring__1(tc_nat) # label(clsarity_nat__Ring__and__Field_Osemiring__1) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_Nat_Osemiring__1__class_Oof__nat(c_HOL_Ozero__class_Ozero(tc_nat),tc_nat) = c_HOL_Ozero__class_Ozero(tc_nat). [resolve(7,a,8,a)].
% 0.45/1.03 9 -class_Nat_Osemiring__char__0(A) | c_Nat_Osemiring__1__class_Oof__nat(B,A) != c_Nat_Osemiring__1__class_Oof__nat(C,A) | B = C # label(cls_of__nat__eq__iff_0) # label(axiom). [assumption].
% 0.45/1.03 10 class_Nat_Osemiring__char__0(tc_nat) # label(clsarity_nat__Nat_Osemiring__char__0) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_Nat_Osemiring__1__class_Oof__nat(A,tc_nat) != c_Nat_Osemiring__1__class_Oof__nat(B,tc_nat) | A = B. [resolve(9,a,10,a)].
% 0.45/1.03 11 -class_Orderings_Opreorder(A) | -c_HOL_Oord__class_Oless(B,B,A) # label(cls_order__less__irrefl_0) # label(axiom). [assumption].
% 0.45/1.03 12 class_Orderings_Opreorder(tc_nat) # label(clsarity_nat__Orderings_Opreorder) # label(axiom). [assumption].
% 0.45/1.03 Derived: -c_HOL_Oord__class_Oless(A,A,tc_nat). [resolve(11,a,12,a)].
% 0.45/1.03 13 -class_Orderings_Opreorder(A) | -c_HOL_Oord__class_Oless(B,C,A) | -c_HOL_Oord__class_Oless(C,B,A) # label(cls_order__less__asym_H_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: -c_HOL_Oord__class_Oless(A,B,tc_nat) | -c_HOL_Oord__class_Oless(B,A,tc_nat). [resolve(13,a,12,a)].
% 0.45/1.03 14 -class_Orderings_Opreorder(A) | -c_HOL_Oord__class_Oless(B,C,A) | -c_HOL_Oord__class_Oless(C,B,A) # label(cls_order__less__asym_0) # label(axiom). [assumption].
% 0.45/1.03 15 -class_Orderings_Opreorder(A) | c_HOL_Oord__class_Oless(B,C,A) | -c_HOL_Oord__class_Oless(D,C,A) | -c_HOL_Oord__class_Oless(B,D,A) # label(cls_order__less__trans_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_HOL_Oord__class_Oless(A,B,tc_nat) | -c_HOL_Oord__class_Oless(C,B,tc_nat) | -c_HOL_Oord__class_Oless(A,C,tc_nat). [resolve(15,a,12,a)].
% 0.45/1.03 16 -class_Orderings_Olinorder(A) | -c_HOL_Oord__class_Oless(B,B,A) # label(cls_linorder__neq__iff_1) # label(axiom). [assumption].
% 0.45/1.03 17 class_Orderings_Olinorder(tc_nat) # label(clsarity_nat__Orderings_Olinorder) # label(axiom). [assumption].
% 0.45/1.03 18 -class_Orderings_Olinorder(A) | -c_HOL_Oord__class_Oless(B,C,A) | -c_HOL_Oord__class_Oless(C,B,A) # label(cls_not__less__iff__gr__or__eq_1) # label(axiom). [assumption].
% 0.45/1.03 19 -class_Orderings_Olinorder(A) | B = C | c_HOL_Oord__class_Oless(B,C,A) | c_HOL_Oord__class_Oless(C,B,A) # label(cls_linorder__antisym__conv3_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: A = B | c_HOL_Oord__class_Oless(A,B,tc_nat) | c_HOL_Oord__class_Oless(B,A,tc_nat). [resolve(19,a,17,a)].
% 0.45/1.03 20 -class_Orderings_Olinorder(A) | c_HOL_Oord__class_Oless(B,C,A) | C = B | c_HOL_Oord__class_Oless(C,B,A) # label(cls_linorder__less__linear_0) # label(axiom). [assumption].
% 0.45/1.03 21 -class_Orderings_Olinorder(A) | c_HOL_Oord__class_Oless(B,C,A) | c_HOL_Oord__class_Oless(C,B,A) | C = B # label(cls_linorder__neqE_0) # label(axiom). [assumption].
% 0.45/1.03 22 -class_Orderings_Olinorder(A) | B = C | c_HOL_Oord__class_Oless(C,B,A) | c_HOL_Oord__class_Oless(B,C,A) # label(cls_not__less__iff__gr__or__eq_0) # label(axiom). [assumption].
% 0.45/1.03 23 -class_Orderings_Oorder(A) | -c_HOL_Oord__class_Oless(B,B,A) # label(cls_order__less__le_1) # label(axiom). [assumption].
% 0.45/1.03 24 class_Orderings_Oorder(tc_nat) # label(clsarity_nat__Orderings_Oorder) # labelCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------