TSTP Solution File: SET047-5 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SET047-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n026.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:23 EDT 2022

% Result   : Unsatisfiable 0.73s 1.00s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET047-5 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n026.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.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 00:53:26 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.73/1.00  ============================== Prover9 ===============================
% 0.73/1.00  Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.00  Process 25867 was started by sandbox on n026.cluster.edu,
% 0.73/1.00  Sun Jul 10 00:53:26 2022
% 0.73/1.00  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25511_n026.cluster.edu".
% 0.73/1.00  ============================== end of head ===========================
% 0.73/1.00  
% 0.73/1.00  ============================== INPUT =================================
% 0.73/1.00  
% 0.73/1.00  % Reading from file /tmp/Prover9_25511_n026.cluster.edu
% 0.73/1.00  
% 0.73/1.00  set(prolog_style_variables).
% 0.73/1.00  set(auto2).
% 0.73/1.00      % set(auto2) -> set(auto).
% 0.73/1.00      % set(auto) -> set(auto_inference).
% 0.73/1.00      % set(auto) -> set(auto_setup).
% 0.73/1.00      % set(auto_setup) -> set(predicate_elim).
% 0.73/1.00      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.00      % set(auto) -> set(auto_limits).
% 0.73/1.00      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.00      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.00      % set(auto) -> set(auto_denials).
% 0.73/1.00      % set(auto) -> set(auto_process).
% 0.73/1.00      % set(auto2) -> assign(new_constants, 1).
% 0.73/1.00      % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.00      % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.00      % set(auto2) -> assign(max_hours, 1).
% 0.73/1.00      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.00      % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.00      % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.00      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.00      % set(auto2) -> set(sort_initial_sos).
% 0.73/1.00      % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.00      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.00      % set(auto2) -> assign(max_megs, 400).
% 0.73/1.00      % set(auto2) -> assign(stats, some).
% 0.73/1.00      % set(auto2) -> clear(echo_input).
% 0.73/1.00      % set(auto2) -> set(quiet).
% 0.73/1.00      % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.00      % set(auto2) -> clear(print_given).
% 0.73/1.00  assign(lrs_ticks,-1).
% 0.73/1.00  assign(sos_limit,10000).
% 0.73/1.00  assign(order,kbo).
% 0.73/1.00  set(lex_order_vars).
% 0.73/1.00  clear(print_given).
% 0.73/1.00  
% 0.73/1.00  % formulas(sos).  % not echoed (6 formulas)
% 0.73/1.00  
% 0.73/1.00  ============================== end of input ==========================
% 0.73/1.00  
% 0.73/1.00  % From the command line: assign(max_seconds, 300).
% 0.73/1.00  
% 0.73/1.00  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.00  
% 0.73/1.00  % Formulas that are not ordinary clauses:
% 0.73/1.00  
% 0.73/1.00  ============================== end of process non-clausal formulas ===
% 0.73/1.00  
% 0.73/1.00  ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.00  
% 0.73/1.00  ============================== PREDICATE ELIMINATION =================
% 0.73/1.00  
% 0.73/1.00  ============================== end predicate elimination =============
% 0.73/1.00  
% 0.73/1.00  Auto_denials:  (non-Horn, no changes).
% 0.73/1.00  
% 0.73/1.00  Term ordering decisions:
% 0.73/1.00  Function symbol KB weights:  a=1. b=1. f=1.
% 0.73/1.00  
% 0.73/1.00  ============================== end of process initial clauses ========
% 0.73/1.00  
% 0.73/1.00  ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.00  
% 0.73/1.00  ============================== end of clauses for search =============
% 0.73/1.00  
% 0.73/1.00  ============================== SEARCH ================================
% 0.73/1.00  
% 0.73/1.00  % Starting search at 0.01 seconds.
% 0.73/1.00  
% 0.73/1.00  ============================== PROOF =================================
% 0.73/1.00  % SZS status Unsatisfiable
% 0.73/1.00  % SZS output start Refutation
% 0.73/1.00  
% 0.73/1.00  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.73/1.00  % Length of proof is 36.
% 0.73/1.00  % Level of proof is 21.
% 0.73/1.00  % Maximum clause weight is 30.000.
% 0.73/1.00  % Given clauses 33.
% 0.73/1.00  
% 0.73/1.00  1 set_equal(a,b) | set_equal(b,a) # label(prove_symmetry1) # label(negated_conjecture).  [assumption].
% 0.73/1.00  2 element(f(A,B),A) | element(f(A,B),B) | set_equal(A,B) # label(clause_3) # label(axiom).  [assumption].
% 0.73/1.00  3 -set_equal(b,a) | -set_equal(a,b) # label(prove_symmetry2) # label(negated_conjecture).  [assumption].
% 0.73/1.00  4 -set_equal(A,B) | -element(C,A) | element(C,B) # label(element_substitution1) # label(axiom).  [assumption].
% 0.73/1.00  5 -set_equal(A,B) | -element(C,B) | element(C,A) # label(element_substitution2) # label(axiom).  [assumption].
% 0.73/1.00  6 -element(f(A,B),B) | -element(f(A,B),A) | set_equal(A,B) # label(clause_4) # label(axiom).  [assumption].
% 0.73/1.00  9 -set_equal(a,b) | element(f(b,a),b) | element(f(b,a),a).  [resolve(3,a,2,c)].
% 0.73/1.00  10 -element(A,B) | element(A,C) | element(f(B,C),B) | element(f(B,C),C).  [resolve(4,a,2,c)].
% 0.73/1.00  11 -element(A,b) | element(A,a) | set_equal(a,b).  [resolve(4,a,1,b)].
% 0.73/1.00  12 -element(A,B) | element(A,C) | element(f(C,B),C) | element(f(C,B),B).  [resolve(5,a,2,c)].
% 0.73/1.00  13 -element(A,a) | element(A,b) | set_equal(a,b).  [resolve(5,a,1,b)].
% 0.73/1.00  14 element(f(b,a),b) | element(f(b,a),a) | element(f(a,b),a) | element(f(a,b),b).  [resolve(9,a,2,c)].
% 0.73/1.00  15 element(f(b,a),a) | element(f(a,b),a) | element(f(a,b),b) | element(f(b,a),A) | element(f(A,b),A) | element(f(A,b),b).  [resolve(14,a,12,a)].
% 0.73/1.00  16 element(f(b,a),a) | element(f(a,b),a) | element(f(a,b),b).  [factor(15,a,d),merge(d),merge(e)].
% 0.73/1.00  18 element(f(a,b),a) | element(f(a,b),b) | element(f(b,a),A) | element(f(a,A),a) | element(f(a,A),A).  [resolve(16,a,10,a)].
% 0.73/1.00  19 element(f(a,b),a) | element(f(a,b),b) | -element(f(b,a),b) | set_equal(b,a).  [resolve(16,a,6,a)].
% 0.73/1.00  20 element(f(a,b),a) | element(f(a,b),b) | element(f(b,a),b).  [factor(18,a,d),merge(d)].
% 0.73/1.00  24 element(f(a,b),a) | element(f(a,b),b) | set_equal(b,a).  [resolve(19,c,20,c),merge(d),merge(e)].
% 0.73/1.00  25 element(f(a,b),a) | element(f(a,b),b) | -set_equal(a,b).  [resolve(24,c,3,a)].
% 0.73/1.00  44 element(f(a,b),a) | element(f(a,b),b).  [resolve(25,c,2,c),merge(c),merge(d)].
% 0.73/1.00  46 element(f(a,b),a) | set_equal(a,b).  [resolve(44,b,11,a),merge(b)].
% 0.73/1.00  48 element(f(a,b),a) | -element(A,b) | element(A,a).  [resolve(46,b,5,a)].
% 0.73/1.00  50 element(f(a,b),a) | -element(f(a,b),b).  [factor(48,a,c)].
% 0.73/1.00  51 element(f(a,b),a).  [resolve(50,b,44,b),merge(b)].
% 0.73/1.00  52 element(f(a,b),b) | set_equal(a,b).  [resolve(51,a,13,a)].
% 0.73/1.00  55 -element(f(a,b),b) | set_equal(a,b).  [resolve(51,a,6,b)].
% 0.73/1.00  57 element(f(a,b),b) | -element(A,a) | element(A,b).  [resolve(52,b,4,a)].
% 0.73/1.00  58 element(f(a,b),b).  [factor(57,a,c),unit_del(b,51)].
% 0.73/1.00  59 set_equal(a,b).  [back_unit_del(55),unit_del(a,58)].
% 0.73/1.00  60 element(f(b,a),b) | element(f(b,a),a).  [back_unit_del(9),unit_del(a,59)].
% 0.73/1.00  61 -set_equal(b,a).  [back_unit_del(3),unit_del(b,59)].
% 0.73/1.00  62 -element(A,b) | element(A,a).  [resolve(59,a,5,a)].
% 0.73/1.00  63 -element(A,a) | element(A,b).  [resolve(59,a,4,a)].
% 0.73/1.00  73 element(f(b,a),a).  [resolve(60,a,62,a),merge(b)].
% 0.73/1.00  74 element(f(b,a),b).  [resolve(73,a,63,a)].
% 0.73/1.00  77 $F.  [resolve(73,a,6,a),unit_del(a,74),unit_del(b,61)].
% 0.73/1.00  
% 0.73/1.00  % SZS output end Refutation
% 0.73/1.00  ============================== end of proof ==========================
% 0.73/1.00  
% 0.73/1.00  ============================== STATISTICS ============================
% 0.73/1.00  
% 0.73/1.00  Given=33. Generated=289. Kept=76. proofs=1.
% 0.73/1.00  Usable=16. Sos=10. Demods=0. Limbo=3, Disabled=53. Hints=0.
% 0.73/1.00  Megabytes=0.07.
% 0.73/1.00  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.73/1.00  
% 0.73/1.00  ============================== end of statistics =====================
% 0.73/1.00  
% 0.73/1.00  ============================== end of search =========================
% 0.73/1.00  
% 0.73/1.00  THEOREM PROVED
% 0.73/1.00  % SZS status Unsatisfiable
% 0.73/1.00  
% 0.73/1.00  Exiting with 1 proof.
% 0.73/1.00  
% 0.73/1.00  Process 25867 exit (max_proofs) Sun Jul 10 00:53:26 2022
% 0.73/1.00  Prover9 interrupted
%------------------------------------------------------------------------------