TSTP Solution File: SET864-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET864-2 : TPTP v8.1.0. Released v3.2.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 : Tue Jul 19 04:33:02 EDT 2022
% Result : Unsatisfiable 0.69s 0.98s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET864-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 02:20:44 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.69/0.98 ============================== Prover9 ===============================
% 0.69/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.98 Process 21294 was started by sandbox on n013.cluster.edu,
% 0.69/0.98 Mon Jul 11 02:20:45 2022
% 0.69/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21139_n013.cluster.edu".
% 0.69/0.98 ============================== end of head ===========================
% 0.69/0.98
% 0.69/0.98 ============================== INPUT =================================
% 0.69/0.98
% 0.69/0.98 % Reading from file /tmp/Prover9_21139_n013.cluster.edu
% 0.69/0.98
% 0.69/0.98 set(prolog_style_variables).
% 0.69/0.98 set(auto2).
% 0.69/0.98 % set(auto2) -> set(auto).
% 0.69/0.98 % set(auto) -> set(auto_inference).
% 0.69/0.98 % set(auto) -> set(auto_setup).
% 0.69/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.98 % set(auto) -> set(auto_limits).
% 0.69/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.98 % set(auto) -> set(auto_denials).
% 0.69/0.98 % set(auto) -> set(auto_process).
% 0.69/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.98 % set(auto2) -> assign(stats, some).
% 0.69/0.98 % set(auto2) -> clear(echo_input).
% 0.69/0.98 % set(auto2) -> set(quiet).
% 0.69/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.98 % set(auto2) -> clear(print_given).
% 0.69/0.98 assign(lrs_ticks,-1).
% 0.69/0.98 assign(sos_limit,10000).
% 0.69/0.98 assign(order,kbo).
% 0.69/0.98 set(lex_order_vars).
% 0.69/0.98 clear(print_given).
% 0.69/0.98
% 0.69/0.98 % formulas(sos). % not echoed (6 formulas)
% 0.69/0.98
% 0.69/0.98 ============================== end of input ==========================
% 0.69/0.98
% 0.69/0.98 % From the command line: assign(max_seconds, 300).
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.98
% 0.69/0.98 % Formulas that are not ordinary clauses:
% 0.69/0.98
% 0.69/0.98 ============================== end of process non-clausal formulas ===
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.98
% 0.69/0.98 ============================== PREDICATE ELIMINATION =================
% 0.69/0.98
% 0.69/0.98 ============================== end predicate elimination =============
% 0.69/0.98
% 0.69/0.98 Auto_denials:
% 0.69/0.98 % copying label cls_conjecture_5 to answer in negative clause
% 0.69/0.98
% 0.69/0.98 Term ordering decisions:
% 0.69/0.98 Function symbol KB weights: t_a=1. v_S=1. v_c=1. c_Union=1. c_Zorn_Omaxchain=1. tc_set=1. v_x=1.
% 0.69/0.98
% 0.69/0.98 ============================== end of process initial clauses ========
% 0.69/0.98
% 0.69/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.98
% 0.69/0.98 ============================== end of clauses for search =============
% 0.69/0.98
% 0.69/0.98 ============================== SEARCH ================================
% 0.69/0.98
% 0.69/0.98 % Starting search at 0.01 seconds.
% 0.69/0.98
% 0.69/0.98 ============================== PROOF =================================
% 0.69/0.98 % SZS status Unsatisfiable
% 0.69/0.98 % SZS output start Refutation
% 0.69/0.98
% 0.69/0.98 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_5.
% 0.69/0.98 % Length of proof is 11.
% 0.69/0.98 % Level of proof is 3.
% 0.69/0.98 % Maximum clause weight is 25.000.
% 0.69/0.98 % Given clauses 8.
% 0.69/0.98
% 0.69/0.98 1 c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.69/0.98 2 c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.69/0.98 3 A != v_x(A) | -c_in(A,v_S,tc_set(t_a)) # label(cls_conjecture_5) # label(negated_conjecture) # answer(cls_conjecture_5). [assumption].
% 0.69/0.98 4 v_x(A) != A | -c_in(A,v_S,tc_set(t_a)) # answer(cls_conjecture_5). [copy(3),flip(a)].
% 0.69/0.98 5 c_in(v_x(A),v_S,tc_set(t_a)) | -c_in(A,v_S,tc_set(t_a)) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.69/0.98 6 c_lessequals(A,v_x(A),tc_set(t_a)) | -c_in(A,v_S,tc_set(t_a)) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.69/0.98 7 -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Omaxchain(B,C),tc_set(tc_set(C))) | -c_lessequals(c_Union(D,C),A,tc_set(C)) | c_Union(D,C) = A # label(cls_Zorn_Omaxchain__Zorn_0) # label(axiom). [assumption].
% 0.69/0.98 8 v_x(c_Union(v_c,t_a)) != c_Union(v_c,t_a) # answer(cls_conjecture_5). [ur(4,b,1,a)].
% 0.69/0.98 9 c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)). [hyper(5,b,1,a)].
% 0.69/0.98 10 c_lessequals(c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)),tc_set(t_a)). [hyper(6,b,1,a)].
% 0.69/0.98 13 $F # answer(cls_conjecture_5). [ur(7,a,9,a,b,2,a,d,8,a(flip)),unit_del(a,10)].
% 0.69/0.98
% 0.69/0.98 % SZS output end Refutation
% 0.69/0.98 ============================== end of proof ==========================
% 0.69/0.98
% 0.69/0.98 ============================== STATISTICS ============================
% 0.69/0.98
% 0.69/0.98 Given=8. Generated=12. Kept=11. proofs=1.
% 0.69/0.98 Usable=8. Sos=1. Demods=0. Limbo=2, Disabled=6. Hints=0.
% 0.69/0.98 Megabytes=0.04.
% 0.69/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.69/0.98
% 0.69/0.98 ============================== end of statistics =====================
% 0.69/0.98
% 0.69/0.98 ============================== end of search =========================
% 0.69/0.98
% 0.69/0.98 THEOREM PROVED
% 0.69/0.98 % SZS status Unsatisfiable
% 0.69/0.98
% 0.69/0.98 Exiting with 1 proof.
% 0.69/0.98
% 0.69/0.98 Process 21294 exit (max_proofs) Mon Jul 11 02:20:45 2022
% 0.69/0.98 Prover9 interrupted
%------------------------------------------------------------------------------