TSTP Solution File: SET821-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET821-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 : Tue Jul 19 04:32:20 EDT 2022
% Result : Unsatisfiable 0.43s 0.96s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET821-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 02:22:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.96 ============================== Prover9 ===============================
% 0.43/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.96 Process 25250 was started by sandbox2 on n022.cluster.edu,
% 0.43/0.96 Mon Jul 11 02:22:41 2022
% 0.43/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25097_n022.cluster.edu".
% 0.43/0.96 ============================== end of head ===========================
% 0.43/0.96
% 0.43/0.96 ============================== INPUT =================================
% 0.43/0.96
% 0.43/0.96 % Reading from file /tmp/Prover9_25097_n022.cluster.edu
% 0.43/0.96
% 0.43/0.96 set(prolog_style_variables).
% 0.43/0.96 set(auto2).
% 0.43/0.96 % set(auto2) -> set(auto).
% 0.43/0.96 % set(auto) -> set(auto_inference).
% 0.43/0.96 % set(auto) -> set(auto_setup).
% 0.43/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.96 % set(auto) -> set(auto_limits).
% 0.43/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.96 % set(auto) -> set(auto_denials).
% 0.43/0.96 % set(auto) -> set(auto_process).
% 0.43/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.96 % set(auto2) -> assign(stats, some).
% 0.43/0.96 % set(auto2) -> clear(echo_input).
% 0.43/0.96 % set(auto2) -> set(quiet).
% 0.43/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.96 % set(auto2) -> clear(print_given).
% 0.43/0.96 assign(lrs_ticks,-1).
% 0.43/0.96 assign(sos_limit,10000).
% 0.43/0.96 assign(order,kbo).
% 0.43/0.96 set(lex_order_vars).
% 0.43/0.96 clear(print_given).
% 0.43/0.96
% 0.43/0.96 % formulas(sos). % not echoed (10 formulas)
% 0.43/0.96
% 0.43/0.96 ============================== end of input ==========================
% 0.43/0.96
% 0.43/0.96 % From the command line: assign(max_seconds, 300).
% 0.43/0.96
% 0.43/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.96
% 0.43/0.96 % Formulas that are not ordinary clauses:
% 0.43/0.96
% 0.43/0.96 ============================== end of process non-clausal formulas ===
% 0.43/0.96
% 0.43/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.96
% 0.43/0.96 ============================== PREDICATE ELIMINATION =================
% 0.43/0.96 1 -class_Orderings_Oorder(A) | -c_less(B,B,A) # label(cls_Orderings_Oorder__less__irrefl__iff1_0) # label(axiom). [assumption].
% 0.43/0.96 2 class_Orderings_Oorder(tc_IntDef_Oint) # label(clsarity_IntDef__Oint_31) # label(axiom). [assumption].
% 0.43/0.96 Derived: -c_less(A,A,tc_IntDef_Oint). [resolve(1,a,2,a)].
% 0.43/0.96
% 0.43/0.96 ============================== end predicate elimination =============
% 0.43/0.96
% 0.43/0.96 Auto_denials: (non-Horn, no changes).
% 0.43/0.96
% 0.43/0.96 Term ordering decisions:
% 0.43/0.96
% 0.43/0.96 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (10).
% 0.43/0.96 Function symbol KB weights: tc_IntDef_Oint=1. v_b=1. v_a=1. v_c=1. c_uminus=1. c_insert=1. tc_set=0.
% 0.43/0.96
% 0.43/0.96 ============================== end of process initial clauses ========
% 0.43/0.96
% 0.43/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.96
% 0.43/0.96 ============================== end of clauses for search =============
% 0.43/0.96
% 0.43/0.96 ============================== SEARCH ================================
% 0.43/0.96
% 0.43/0.96 % Starting search at 0.01 seconds.
% 0.43/0.96
% 0.43/0.96 ============================== PROOF =================================
% 0.43/0.96 % SZS status Unsatisfiable
% 0.43/0.96 % SZS output start Refutation
% 0.43/0.96
% 0.43/0.96 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.96 % Length of proof is 24.
% 0.43/0.96 % Level of proof is 9.
% 0.43/0.96 % Maximum clause weight is 16.000.
% 0.43/0.96 % Given clauses 30.
% 0.43/0.96
% 0.43/0.96 1 -class_Orderings_Oorder(A) | -c_less(B,B,A) # label(cls_Orderings_Oorder__less__irrefl__iff1_0) # label(axiom). [assumption].
% 0.43/0.96 2 class_Orderings_Oorder(tc_IntDef_Oint) # label(clsarity_IntDef__Oint_31) # label(axiom). [assumption].
% 0.43/0.96 3 c_less(v_a,v_b,tc_IntDef_Oint) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.43/0.96 4 c_less(v_b,v_c,tc_IntDef_Oint) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.43/0.96 5 c_in(A,c_insert(A,B,C),C) # label(cls_Set_OinsertCI_1) # label(axiom). [assumption].
% 0.43/0.96 6 c_in(A,B,C) | c_in(A,c_uminus(B,tc_set(C)),C) # label(cls_Set_OComplI_0) # label(axiom). [assumption].
% 0.43/0.96 7 -c_in(A,B,C) | -c_in(A,c_uminus(B,tc_set(C)),C) # label(cls_Set_OComplD__dest_0) # label(axiom). [assumption].
% 0.43/0.96 8 -c_in(A,B,C) | c_in(A,c_insert(D,B,C),C) # label(cls_Set_OinsertCI_0) # label(axiom). [assumption].
% 0.43/0.96 9 c_in(v_c,A,tc_IntDef_Oint) | -c_in(v_b,A,tc_IntDef_Oint) | c_in(v_a,A,tc_IntDef_Oint) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.43/0.96 10 -c_in(A,c_insert(B,C,D),D) | c_in(A,C,D) | A = B # label(cls_Set_OinsertE_0) # label(axiom). [assumption].
% 0.43/0.96 11 -c_less(A,A,tc_IntDef_Oint). [resolve(1,a,2,a)].
% 0.43/0.96 12 -c_in(A,c_uminus(c_insert(A,B,C),tc_set(C)),C). [ur(7,a,5,a)].
% 0.43/0.96 14 c_in(A,c_insert(B,c_insert(A,C,D),D),D). [resolve(8,a,5,a)].
% 0.43/0.96 18 c_in(A,c_insert(B,c_insert(C,c_insert(A,D,E),E),E),E). [resolve(14,a,8,a)].
% 0.43/0.96 19 -c_in(A,c_uminus(c_insert(B,c_insert(A,C,D),D),tc_set(D)),D). [ur(7,a,14,a)].
% 0.43/0.96 22 -c_in(A,c_uminus(c_insert(B,c_insert(C,c_insert(A,D,E),E),E),tc_set(E)),E). [ur(7,a,18,a)].
% 0.43/0.96 31 -c_in(v_b,c_uminus(c_insert(v_c,c_insert(v_a,A,tc_IntDef_Oint),tc_IntDef_Oint),tc_set(tc_IntDef_Oint)),tc_IntDef_Oint). [ur(9,a,12,a,c,19,a)].
% 0.43/0.96 33 c_in(v_b,c_insert(v_c,c_insert(v_a,A,tc_IntDef_Oint),tc_IntDef_Oint),tc_IntDef_Oint). [resolve(31,a,6,b)].
% 0.43/0.96 39 -c_in(v_b,c_uminus(c_insert(v_a,c_insert(A,c_insert(v_c,B,tc_IntDef_Oint),tc_IntDef_Oint),tc_IntDef_Oint),tc_set(tc_IntDef_Oint)),tc_IntDef_Oint). [ur(9,a,22,a,c,12,a)].
% 0.43/0.96 40 c_in(v_b,c_insert(v_a,A,tc_IntDef_Oint),tc_IntDef_Oint) | v_c = v_b. [resolve(33,a,10,a),flip(b)].
% 0.43/0.96 44 v_c = v_b | c_in(v_b,A,tc_IntDef_Oint) | v_a = v_b. [resolve(40,a,10,a),flip(c)].
% 0.43/0.96 51 v_c = v_b | v_a = v_b. [resolve(44,b,39,a)].
% 0.43/0.96 52 v_a = v_b. [para(51(a,1),4(a,2)),unit_del(b,11)].
% 0.43/0.96 53 $F. [back_rewrite(3),rewrite([52(1)]),unit_del(a,11)].
% 0.43/0.96
% 0.43/0.96 % SZS output end Refutation
% 0.43/0.96 ============================== end of proof ==========================
% 0.43/0.96
% 0.43/0.96 ============================== STATISTICS ============================
% 0.43/0.96
% 0.43/0.96 Given=30. Generated=122. Kept=50. proofs=1.
% 0.43/0.96 Usable=13. Sos=2. Demods=1. Limbo=1, Disabled=45. Hints=0.
% 0.43/0.96 Megabytes=0.08.
% 0.43/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.96
% 0.43/0.96 ============================== end of statistics =====================
% 0.43/0.96
% 0.43/0.96 ============================== end of search =========================
% 0.43/0.96
% 0.43/0.96 THEOREM PROVED
% 0.43/0.96 % SZS status Unsatisfiable
% 0.43/0.96
% 0.43/0.96 Exiting with 1 proof.
% 0.43/0.96
% 0.43/0.96 Process 25250 exit (max_proofs) Mon Jul 11 02:22:41 2022
% 0.43/0.96 Prover9 interrupted
%------------------------------------------------------------------------------