TSTP Solution File: SET046+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET046+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:26:21 EDT 2022
% Result : Theorem 0.68s 0.99s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET046+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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 : Sat Jul 9 18:26:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/0.99 ============================== Prover9 ===============================
% 0.68/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.99 Process 19234 was started by sandbox2 on n020.cluster.edu,
% 0.68/0.99 Sat Jul 9 18:26:29 2022
% 0.68/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19081_n020.cluster.edu".
% 0.68/0.99 ============================== end of head ===========================
% 0.68/0.99
% 0.68/0.99 ============================== INPUT =================================
% 0.68/0.99
% 0.68/0.99 % Reading from file /tmp/Prover9_19081_n020.cluster.edu
% 0.68/0.99
% 0.68/0.99 set(prolog_style_variables).
% 0.68/0.99 set(auto2).
% 0.68/0.99 % set(auto2) -> set(auto).
% 0.68/0.99 % set(auto) -> set(auto_inference).
% 0.68/0.99 % set(auto) -> set(auto_setup).
% 0.68/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.99 % set(auto) -> set(auto_limits).
% 0.68/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.99 % set(auto) -> set(auto_denials).
% 0.68/0.99 % set(auto) -> set(auto_process).
% 0.68/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.99 % set(auto2) -> assign(stats, some).
% 0.68/0.99 % set(auto2) -> clear(echo_input).
% 0.68/0.99 % set(auto2) -> set(quiet).
% 0.68/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.99 % set(auto2) -> clear(print_given).
% 0.68/0.99 assign(lrs_ticks,-1).
% 0.68/0.99 assign(sos_limit,10000).
% 0.68/0.99 assign(order,kbo).
% 0.68/0.99 set(lex_order_vars).
% 0.68/0.99 clear(print_given).
% 0.68/0.99
% 0.68/0.99 % formulas(sos). % not echoed (1 formulas)
% 0.68/0.99
% 0.68/0.99 ============================== end of input ==========================
% 0.68/0.99
% 0.68/0.99 % From the command line: assign(max_seconds, 300).
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.99
% 0.68/0.99 % Formulas that are not ordinary clauses:
% 0.68/0.99 1 --(exists Y all X (element(X,Y) <-> -(exists Z (element(X,Z) & element(Z,X))))) # label(pel42) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/0.99
% 0.68/0.99 ============================== end of process non-clausal formulas ===
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.99
% 0.68/0.99 ============================== PREDICATE ELIMINATION =================
% 0.68/0.99
% 0.68/0.99 ============================== end predicate elimination =============
% 0.68/0.99
% 0.68/0.99 Auto_denials: (non-Horn, no changes).
% 0.68/0.99
% 0.68/0.99 Term ordering decisions:
% 0.68/0.99
% 0.68/0.99 % Assigning unary symbol f1 kb_weight 0 and highest precedence (3).
% 0.68/0.99 Function symbol KB weights: c1=1. f1=0.
% 0.68/0.99
% 0.68/0.99 ============================== end of process initial clauses ========
% 0.68/0.99
% 0.68/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.99
% 0.68/0.99 ============================== end of clauses for search =============
% 0.68/0.99
% 0.68/0.99 ============================== SEARCH ================================
% 0.68/0.99
% 0.68/0.99 % Starting search at 0.01 seconds.
% 0.68/0.99
% 0.68/0.99 ============================== PROOF =================================
% 0.68/0.99 % SZS status Theorem
% 0.68/0.99 % SZS output start Refutation
% 0.68/0.99
% 0.68/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.68/0.99 % Length of proof is 8.
% 0.68/0.99 % Level of proof is 4.
% 0.68/0.99 % Maximum clause weight is 11.000.
% 0.68/0.99 % Given clauses 5.
% 0.68/0.99
% 0.68/0.99 1 --(exists Y all X (element(X,Y) <-> -(exists Z (element(X,Z) & element(Z,X))))) # label(pel42) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/0.99 2 element(A,c1) | element(A,f1(A)) # label(pel42) # label(negated_conjecture). [clausify(1)].
% 0.68/0.99 3 element(A,c1) | element(f1(A),A) # label(pel42) # label(negated_conjecture). [clausify(1)].
% 0.68/0.99 4 -element(A,c1) | -element(A,B) | -element(B,A) # label(pel42) # label(negated_conjecture). [clausify(1)].
% 0.68/0.99 6 -element(c1,c1). [factor(4,a,c),merge(b)].
% 0.68/0.99 12 -element(f1(A),c1) | -element(f1(A),A) | element(A,c1). [resolve(4,c,2,b)].
% 0.68/0.99 16 -element(f1(c1),c1). [factor(12,a,b),unit_del(b,6)].
% 0.68/0.99 20 $F. [resolve(6,a,3,a),unit_del(a,16)].
% 0.68/0.99
% 0.68/0.99 % SZS output end Refutation
% 0.68/0.99 ============================== end of proof ==========================
% 0.68/0.99
% 0.68/0.99 ============================== STATISTICS ============================
% 0.68/0.99
% 0.68/0.99 Given=5. Generated=30. Kept=18. proofs=1.
% 0.68/0.99 Usable=5. Sos=13. Demods=0. Limbo=0, Disabled=3. Hints=0.
% 0.68/0.99 Megabytes=0.03.
% 0.68/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.68/0.99
% 0.68/0.99 ============================== end of statistics =====================
% 0.68/0.99
% 0.68/0.99 ============================== end of search =========================
% 0.68/0.99
% 0.68/0.99 THEOREM PROVED
% 0.68/0.99 % SZS status Theorem
% 0.68/0.99
% 0.68/0.99 Exiting with 1 proof.
% 0.68/0.99
% 0.68/0.99 Process 19234 exit (max_proofs) Sat Jul 9 18:26:29 2022
% 0.68/0.99 Prover9 interrupted
%------------------------------------------------------------------------------