TSTP Solution File: SET787-2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SET787-2 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n010.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:05 EDT 2022

% Result   : Timeout 300.07s 300.34s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET787-2 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n010.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 18:00:00 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.44/1.04  ============================== Prover9 ===============================
% 0.44/1.04  Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.04  Process 31635 was started by sandbox on n010.cluster.edu,
% 0.44/1.04  Sun Jul 10 18:00:01 2022
% 0.44/1.04  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31278_n010.cluster.edu".
% 0.44/1.04  ============================== end of head ===========================
% 0.44/1.04  
% 0.44/1.04  ============================== INPUT =================================
% 0.44/1.04  
% 0.44/1.04  % Reading from file /tmp/Prover9_31278_n010.cluster.edu
% 0.44/1.04  
% 0.44/1.04  set(prolog_style_variables).
% 0.44/1.04  set(auto2).
% 0.44/1.04      % set(auto2) -> set(auto).
% 0.44/1.04      % set(auto) -> set(auto_inference).
% 0.44/1.04      % set(auto) -> set(auto_setup).
% 0.44/1.04      % set(auto_setup) -> set(predicate_elim).
% 0.44/1.04      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.04      % set(auto) -> set(auto_limits).
% 0.44/1.04      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.04      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.04      % set(auto) -> set(auto_denials).
% 0.44/1.04      % set(auto) -> set(auto_process).
% 0.44/1.04      % set(auto2) -> assign(new_constants, 1).
% 0.44/1.04      % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.04      % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.04      % set(auto2) -> assign(max_hours, 1).
% 0.44/1.04      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.04      % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.04      % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.04      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.04      % set(auto2) -> set(sort_initial_sos).
% 0.44/1.04      % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.04      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.04      % set(auto2) -> assign(max_megs, 400).
% 0.44/1.04      % set(auto2) -> assign(stats, some).
% 0.44/1.04      % set(auto2) -> clear(echo_input).
% 0.44/1.04      % set(auto2) -> set(quiet).
% 0.44/1.04      % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.04      % set(auto2) -> clear(print_given).
% 0.44/1.04  assign(lrs_ticks,-1).
% 0.44/1.04  assign(sos_limit,10000).
% 0.44/1.04  assign(order,kbo).
% 0.44/1.04  set(lex_order_vars).
% 0.44/1.04  clear(print_given).
% 0.44/1.04  
% 0.44/1.04  % formulas(sos).  % not echoed (149 formulas)
% 0.44/1.04  
% 0.44/1.04  ============================== end of input ==========================
% 0.44/1.04  
% 0.44/1.04  % From the command line: assign(max_seconds, 300).
% 0.44/1.04  
% 0.44/1.04  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.04  
% 0.44/1.04  % Formulas that are not ordinary clauses:
% 0.44/1.04  
% 0.44/1.04  ============================== end of process non-clausal formulas ===
% 0.44/1.04  
% 0.44/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.04  
% 0.44/1.04  ============================== PREDICATE ELIMINATION =================
% 0.44/1.04  1 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(pair(A,C),F) # label(clause52) # label(axiom).  [assumption].
% 0.44/1.04  2 -member(pair(pair(A,B),pair(C,D)),rmult(E,F,V6,V7)) | rmultE_c1(A,B,C,D,E,F,V6,V7) | rmultE_c2(A,B,C,D,E,F,V6,V7) # label(clause51) # label(axiom).  [assumption].
% 0.44/1.04  Derived: member(pair(A,B),C) | -member(pair(pair(A,D),pair(B,E)),rmult(F,C,V6,V7)) | rmultE_c2(A,D,B,E,F,C,V6,V7).  [resolve(1,a,2,b)].
% 0.44/1.04  3 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(A,E) # label(clause53) # label(axiom).  [assumption].
% 0.44/1.04  Derived: member(A,B) | -member(pair(pair(A,C),pair(D,E)),rmult(B,F,V6,V7)) | rmultE_c2(A,C,D,E,B,F,V6,V7).  [resolve(3,a,2,b)].
% 0.44/1.04  4 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(C,E) # label(clause54) # label(axiom).  [assumption].
% 0.44/1.04  Derived: member(A,B) | -member(pair(pair(C,D),pair(A,E)),rmult(B,F,V6,V7)) | rmultE_c2(C,D,A,E,B,F,V6,V7).  [resolve(4,a,2,b)].
% 0.44/1.04  5 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(B,V6) # label(clause55) # label(axiom).  [assumption].
% 0.44/1.04  Derived: member(A,B) | -member(pair(pair(C,A),pair(D,E)),rmult(F,V6,B,V7)) | rmultE_c2(C,A,D,E,F,V6,B,V7).  [resolve(5,a,2,b)].
% 0.44/1.04  6 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(D,V6) # label(clause56) # label(axiom).  [assumption].
% 0.44/1.04  Derived: member(A,B) | -member(pair(pair(C,D),pair(E,A)),rmult(F,V6,B,V7)) | rmultE_c2(C,D,E,A,F,V6,B,V7).  [resolve(6,a,2,b)].
% 0.44/1.04  7 member(pair(A,B),C) | -member(pair(pair(A,D),pair(B,E)),rmult(F,C,V6,V7)) | rmultE_c2(A,D,B,E,F,C,V6,V7).  [resolve(1,a,2,b)].
% 0.44/1.04  8 -rmultE_c2(A,B,C,D,E,F,V6,V7) | member(pair(B,D),V7) # label(clause57) # label(axiom).  [assumption].
% 0.44/1.04  9 -rmultE_c2(A,B,C,D,E,F,V6,V7) | member(C,E) # label(clause58) # label(axiom).  [assumption].
% 0.44/1.04  10 -rmultE_c2(A,B,C,D,E,F,V6,V7) | A = C # label(clause59) # label(axiom).  [assumption].
% 0.44/1.04  11 -rmultE_c2(A,B,C,D,E,F,V6,V7) | member(B,V6) # label(clause60) # label(axiom).  [assumption].
% 1.13/1.44  12 -rmultE_c2(A,B,C,D,E,F,V6,V7) | member(D,V6) # label(clause61) # label(axiom).  [assumption].
% 1.13/1.44  Derived: member(pair(A,B),C) | -member(pair(pair(A,D),pair(B,E)),rmult(F,C,V6,V7)) | member(pair(D,E),V7).  [resolve(7,c,8,a)].
% 1.13/1.44  Derived: member(pair(A,B),C) | -member(pair(pair(A,D),pair(B,E)),rmult(F,C,V6,V7)) | member(B,F).  [resolve(7,c,9,a)].
% 1.13/1.44  Derived: member(pair(A,B),C) | -member(pair(pair(A,D),pair(B,E)),rmult(F,C,V6,V7)) | A = B.  [resolve(7,c,10,a)].
% 1.13/1.44  Derived: member(pair(A,B),C) | -member(pair(pair(A,D),pair(B,E)),rmult(F,C,V6,V7)) | member(D,V6).  [resolve(7,c,11,a)].
% 1.13/1.44  Derived: member(pair(A,B),C) | -member(pair(pair(A,D),pair(B,E)),rmult(F,C,V6,V7)) | member(E,V6).  [resolve(7,c,12,a)].
% 1.13/1.44  13 member(A,B) | -member(pair(pair(A,C),pair(D,E)),rmult(B,F,V6,V7)) | rmultE_c2(A,C,D,E,B,F,V6,V7).  [resolve(3,a,2,b)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(A,C),pair(D,E)),rmult(B,F,V6,V7)) | member(pair(C,E),V7).  [resolve(13,c,8,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(A,C),pair(D,E)),rmult(B,F,V6,V7)) | member(D,B).  [resolve(13,c,9,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(A,C),pair(D,E)),rmult(B,F,V6,V7)) | A = D.  [resolve(13,c,10,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(A,C),pair(D,E)),rmult(B,F,V6,V7)) | member(C,V6).  [resolve(13,c,11,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(A,C),pair(D,E)),rmult(B,F,V6,V7)) | member(E,V6).  [resolve(13,c,12,a)].
% 1.13/1.44  14 member(A,B) | -member(pair(pair(C,D),pair(A,E)),rmult(B,F,V6,V7)) | rmultE_c2(C,D,A,E,B,F,V6,V7).  [resolve(4,a,2,b)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(C,D),pair(A,E)),rmult(B,F,V6,V7)) | member(pair(D,E),V7).  [resolve(14,c,8,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(C,D),pair(A,E)),rmult(B,F,V6,V7)) | member(A,B).  [resolve(14,c,9,a)].
% 1.13/1.44  15 member(A,B) | -member(pair(pair(C,A),pair(D,E)),rmult(F,V6,B,V7)) | rmultE_c2(C,A,D,E,F,V6,B,V7).  [resolve(5,a,2,b)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(C,A),pair(D,E)),rmult(F,V6,B,V7)) | member(pair(A,E),V7).  [resolve(15,c,8,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(C,A),pair(D,E)),rmult(F,V6,B,V7)) | C = D.  [resolve(15,c,10,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(C,A),pair(D,E)),rmult(F,V6,B,V7)) | member(A,B).  [resolve(15,c,11,a)].
% 1.13/1.44  16 member(A,B) | -member(pair(pair(C,D),pair(E,A)),rmult(F,V6,B,V7)) | rmultE_c2(C,D,E,A,F,V6,B,V7).  [resolve(6,a,2,b)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(C,D),pair(E,A)),rmult(F,V6,B,V7)) | member(pair(D,A),V7).  [resolve(16,c,8,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(C,D),pair(E,A)),rmult(F,V6,B,V7)) | C = E.  [resolve(16,c,10,a)].
% 1.13/1.44  Derived: member(A,B) | -member(pair(pair(C,D),pair(E,A)),rmult(F,V6,B,V7)) | member(A,B).  [resolve(16,c,12,a)].
% 1.13/1.44  
% 1.13/1.44  ============================== end predicate elimination =============
% 1.13/1.44  
% 1.13/1.44  Auto_denials:  (non-Horn, no changes).
% 1.13/1.44  
% 1.13/1.44  Term ordering decisions:
% 1.13/1.44  Function symbol KB weights:  eptset=1. nat=1. a=1. b=1. sk2=1. pair=1. cons=1. qPair=1. disjsum=1. sigma=1. un=1. int=1. comp=1. qsum=1. apply=1. idE_sk1=1. upair=1. diff=1. interI_sk1=1. powI_sk1=1. qconverseE_sk1=1. qconverseE_sk2=1. subsetI_sk1=1. unionE_sk1=1. image=1. vimage=1. inl=1. inr=1. succ=1. union=1. inter=1. pow=1. converse=1. fin=1. qInl=1. qInr=1. fst=1. memrel=1. qconverse=1. card_Union_sk1=1. field=1. id=1. order_Inter_sk1=1. order_Union_sk1=1. snd=1. converseE_sk1=1. converseE_sk2=1. converse_sk1=1. converse_sk2=1. qsumE_sk1=1. qsumE_sk2=1. sumE_sk1=1. sumE_sk2=1. sigmaE_sk1x=1. compE_sk1=1. compE_sk2=1. compE_sk3=1. sigmaE_sk1y=1. subsetD_sk1=1. rmult=1. radd=1.
% 1.13/1.44  
% 1.13/1.44  ============================== end of process initial clauses ========
% 1.13/1.44  
% 1.13/1.44  ============================== CLAUSES FOR SEARCH ====================
% 1.13/1.44  
% 1.13/1.44  ============================== end of clauses for search =============
% 1.13/1.44  
% 1.13/1.44  ============================== SEARCH ================================
% 1.13/1.44  
% 1.13/1.44  % Starting search at 0.04 seconds.
% 1.13/1.44  
% 1.13/1.44  Low Water (keep): wt=18.000, iters=3598
% 1.13/1.44  
% 1.13/1.44  Low Water (keep): wt=17.000, iters=3431
% 1.13/1.44  
% 1.13/1.44  Low Water (keep): wt=16.000, iters=3387
% 1.13/1.44  
% 1.13/1.44  Low Water (keep): wt=15.000, iters=3398
% 1.13/1.44  
% 1.13/1.44  Low Water (keep): wt=14.000, iters=3352Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------