TSTP Solution File: SET045+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET045+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:20 EDT 2022
% Result : Theorem 0.64s 0.96s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SET045+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.29 % Computer : n005.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sun Jul 10 04:01:22 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.64/0.96 ============================== Prover9 ===============================
% 0.64/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.64/0.96 Process 23650 was started by sandbox on n005.cluster.edu,
% 0.64/0.96 Sun Jul 10 04:01:22 2022
% 0.64/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23497_n005.cluster.edu".
% 0.64/0.96 ============================== end of head ===========================
% 0.64/0.96
% 0.64/0.96 ============================== INPUT =================================
% 0.64/0.96
% 0.64/0.96 % Reading from file /tmp/Prover9_23497_n005.cluster.edu
% 0.64/0.96
% 0.64/0.96 set(prolog_style_variables).
% 0.64/0.96 set(auto2).
% 0.64/0.96 % set(auto2) -> set(auto).
% 0.64/0.96 % set(auto) -> set(auto_inference).
% 0.64/0.96 % set(auto) -> set(auto_setup).
% 0.64/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.64/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/0.96 % set(auto) -> set(auto_limits).
% 0.64/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/0.96 % set(auto) -> set(auto_denials).
% 0.64/0.96 % set(auto) -> set(auto_process).
% 0.64/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.64/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.64/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.64/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.64/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.64/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.64/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.64/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.64/0.96 % set(auto2) -> assign(stats, some).
% 0.64/0.96 % set(auto2) -> clear(echo_input).
% 0.64/0.96 % set(auto2) -> set(quiet).
% 0.64/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.64/0.96 % set(auto2) -> clear(print_given).
% 0.64/0.96 assign(lrs_ticks,-1).
% 0.64/0.96 assign(sos_limit,10000).
% 0.64/0.96 assign(order,kbo).
% 0.64/0.96 set(lex_order_vars).
% 0.64/0.96 clear(print_given).
% 0.64/0.96
% 0.64/0.96 % formulas(sos). % not echoed (2 formulas)
% 0.64/0.96
% 0.64/0.96 ============================== end of input ==========================
% 0.64/0.96
% 0.64/0.96 % From the command line: assign(max_seconds, 300).
% 0.64/0.96
% 0.64/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/0.96
% 0.64/0.96 % Formulas that are not ordinary clauses:
% 0.64/0.96 1 (all Z exists Y all X (element(X,Y) <-> element(X,Z) & -element(X,X))) # label(pel41_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.96 2 --(exists Z all X element(X,Z)) # label(pel41) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.64/0.96
% 0.64/0.96 ============================== end of process non-clausal formulas ===
% 0.64/0.96
% 0.64/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/0.96
% 0.64/0.96 ============================== PREDICATE ELIMINATION =================
% 0.64/0.96
% 0.64/0.96 ============================== end predicate elimination =============
% 0.64/0.96
% 0.64/0.96 Auto_denials: (non-Horn, no changes).
% 0.64/0.96
% 0.64/0.96 Term ordering decisions:
% 0.64/0.96
% 0.64/0.96 % Assigning unary symbol f1 kb_weight 0 and highest precedence (3).
% 0.64/0.96 Function symbol KB weights: c1=1. f1=0.
% 0.64/0.96
% 0.64/0.96 ============================== PROOF =================================
% 0.64/0.96 % SZS status Theorem
% 0.64/0.96 % SZS output start Refutation
% 0.64/0.96
% 0.64/0.96 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.64/0.96 % Length of proof is 8.
% 0.64/0.96 % Level of proof is 4.
% 0.64/0.96 % Maximum clause weight is 10.000.
% 0.64/0.96 % Given clauses 0.
% 0.64/0.96
% 0.64/0.96 1 (all Z exists Y all X (element(X,Y) <-> element(X,Z) & -element(X,X))) # label(pel41_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.96 2 --(exists Z all X element(X,Z)) # label(pel41) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.64/0.96 3 element(A,c1) # label(pel41) # label(negated_conjecture). [clausify(2)].
% 0.64/0.96 4 -element(A,f1(B)) | -element(A,A) # label(pel41_1) # label(axiom). [clausify(1)].
% 0.64/0.96 6 element(A,f1(B)) | -element(A,B) | element(A,A) # label(pel41_1) # label(axiom). [clausify(1)].
% 0.64/0.96 7 -element(f1(A),f1(A)). [factor(4,a,b)].
% 0.64/0.96 8 -element(f1(A),A). [factor(6,a,c),unit_del(a,7)].
% 0.64/0.96 9 $F. [resolve(8,a,3,a)].
% 0.64/0.96
% 0.64/0.96 % SZS output end Refutation
% 0.64/0.96 ============================== end of proof ==========================
% 0.64/0.96
% 0.64/0.96 ============================== STATISTICS ============================
% 0.64/0.96
% 0.64/0.96 Given=0. Generated=6. Kept=6. proofs=1.
% 0.64/0.96 Usable=0. Sos=3. Demods=0. Limbo=2, Disabled=4. Hints=0.
% 0.64/0.96 Megabytes=0.02.
% 0.64/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.64/0.96
% 0.64/0.96 ============================== end of statistics =====================
% 0.64/0.96
% 0.64/0.96 ============================== end of search =========================
% 0.64/0.96
% 0.64/0.96 THEOREM PROVED
% 0.64/0.96 % SZS status Theorem
% 0.64/0.96
% 0.64/0.96 Exiting with 1 proof.
% 0.64/0.96
% 0.64/0.96 Process 23650 exit (max_proofs) Sun Jul 10 04:01:22 2022
% 0.64/0.96 Prover9 interrupted
%------------------------------------------------------------------------------