TSTP Solution File: SET839-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET839-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:38 EDT 2022
% Result : Unsatisfiable 0.46s 1.01s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET839-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n027.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 : Sun Jul 10 14:25:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.01 ============================== Prover9 ===============================
% 0.46/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.01 Process 25422 was started by sandbox on n027.cluster.edu,
% 0.46/1.01 Sun Jul 10 14:25:03 2022
% 0.46/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25269_n027.cluster.edu".
% 0.46/1.01 ============================== end of head ===========================
% 0.46/1.01
% 0.46/1.01 ============================== INPUT =================================
% 0.46/1.01
% 0.46/1.01 % Reading from file /tmp/Prover9_25269_n027.cluster.edu
% 0.46/1.01
% 0.46/1.01 set(prolog_style_variables).
% 0.46/1.01 set(auto2).
% 0.46/1.01 % set(auto2) -> set(auto).
% 0.46/1.01 % set(auto) -> set(auto_inference).
% 0.46/1.01 % set(auto) -> set(auto_setup).
% 0.46/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.01 % set(auto) -> set(auto_limits).
% 0.46/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.01 % set(auto) -> set(auto_denials).
% 0.46/1.01 % set(auto) -> set(auto_process).
% 0.46/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.01 % set(auto2) -> assign(stats, some).
% 0.46/1.01 % set(auto2) -> clear(echo_input).
% 0.46/1.01 % set(auto2) -> set(quiet).
% 0.46/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.01 % set(auto2) -> clear(print_given).
% 0.46/1.01 assign(lrs_ticks,-1).
% 0.46/1.01 assign(sos_limit,10000).
% 0.46/1.01 assign(order,kbo).
% 0.46/1.01 set(lex_order_vars).
% 0.46/1.01 clear(print_given).
% 0.46/1.01
% 0.46/1.01 % formulas(sos). % not echoed (6 formulas)
% 0.46/1.01
% 0.46/1.01 ============================== end of input ==========================
% 0.46/1.01
% 0.46/1.01 % From the command line: assign(max_seconds, 300).
% 0.46/1.01
% 0.46/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.01
% 0.46/1.01 % Formulas that are not ordinary clauses:
% 0.46/1.01
% 0.46/1.01 ============================== end of process non-clausal formulas ===
% 0.46/1.01
% 0.46/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.01
% 0.46/1.01 ============================== PREDICATE ELIMINATION =================
% 0.46/1.01
% 0.46/1.01 ============================== end predicate elimination =============
% 0.46/1.01
% 0.46/1.01 Auto_denials: (non-Horn, no changes).
% 0.46/1.01
% 0.46/1.01 Term ordering decisions:
% 0.46/1.01
% 0.46/1.01 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (9).
% 0.46/1.01 Function symbol KB weights: t_a=1. v_S=1. c_emptyset=1. c_Main_OsubsetI__1=1. c_insert=1. tc_set=0.
% 0.46/1.01
% 0.46/1.01 ============================== end of process initial clauses ========
% 0.46/1.01
% 0.46/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.01
% 0.46/1.01 ============================== end of clauses for search =============
% 0.46/1.01
% 0.46/1.01 ============================== SEARCH ================================
% 0.46/1.01
% 0.46/1.01 % Starting search at 0.01 seconds.
% 0.46/1.01
% 0.46/1.01 ============================== PROOF =================================
% 0.46/1.01 % SZS status Unsatisfiable
% 0.46/1.01 % SZS output start Refutation
% 0.46/1.01
% 0.46/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/1.01 % Length of proof is 14.
% 0.46/1.01 % Level of proof is 7.
% 0.46/1.01 % Maximum clause weight is 21.000.
% 0.46/1.01 % Given clauses 15.
% 0.46/1.01
% 0.46/1.01 1 c_in(A,c_insert(A,B,C),C) # label(cls_Set_OinsertCI_1) # label(axiom). [assumption].
% 0.46/1.01 2 c_in(c_Main_OsubsetI__1(A,B,C),A,C) | c_lessequals(A,B,tc_set(C)) # label(cls_Set_OsubsetI_0) # label(axiom). [assumption].
% 0.46/1.01 3 -c_lessequals(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.46/1.01 4 -c_in(c_Main_OsubsetI__1(A,B,C),B,C) | c_lessequals(A,B,tc_set(C)) # label(cls_Set_OsubsetI_1) # label(axiom). [assumption].
% 0.46/1.01 5 -c_lessequals(A,B,tc_set(C)) | -c_lessequals(B,A,tc_set(C)) | B = A # label(cls_Set_Osubset__antisym_0) # label(axiom). [assumption].
% 0.46/1.01 6 c_lessequals(A,B,tc_set(t_a)) | -c_in(B,v_S,tc_set(t_a)) | -c_in(A,v_S,tc_set(t_a)) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.46/1.01 8 c_in(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),v_S,tc_set(t_a)). [resolve(3,a,2,b)].
% 0.46/1.01 9 -c_in(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)). [ur(4,b,3,a)].
% 0.46/1.01 13 c_lessequals(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),B,tc_set(t_a)) | -c_in(B,v_S,tc_set(t_a)). [resolve(8,a,6,c)].
% 0.46/1.01 20 c_lessequals(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_Main_OsubsetI__1(v_S,c_insert(B,c_emptyset,tc_set(t_a)),tc_set(t_a)),tc_set(t_a)). [resolve(13,b,8,a)].
% 0.46/1.01 24 c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)) = c_Main_OsubsetI__1(v_S,c_insert(B,c_emptyset,tc_set(t_a)),tc_set(t_a)). [resolve(20,a,5,b),unit_del(a,20)].
% 0.46/1.01 25 c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)) = c_0. [new_symbol(24)].
% 0.46/1.01 31 -c_in(c_0,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)). [back_rewrite(9),rewrite([25(8)])].
% 0.46/1.01 32 $F. [resolve(31,a,1,a)].
% 0.46/1.01
% 0.46/1.01 % SZS output end Refutation
% 0.46/1.01 ============================== end of proof ==========================
% 0.46/1.01
% 0.46/1.01 ============================== STATISTICS ============================
% 0.46/1.01
% 0.46/1.01 Given=15. Generated=44. Kept=31. proofs=1.
% 0.46/1.01 Usable=11. Sos=3. Demods=1. Limbo=6, Disabled=16. Hints=0.
% 0.46/1.01 Megabytes=0.06.
% 0.46/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.01
% 0.46/1.01 ============================== end of statistics =====================
% 0.46/1.01
% 0.46/1.01 ============================== end of search =========================
% 0.46/1.01
% 0.46/1.01 THEOREM PROVED
% 0.46/1.01 % SZS status Unsatisfiable
% 0.46/1.01
% 0.46/1.01 Exiting with 1 proof.
% 0.46/1.01
% 0.46/1.01 Process 25422 exit (max_proofs) Sun Jul 10 14:25:03 2022
% 0.46/1.01 Prover9 interrupted
%------------------------------------------------------------------------------