TSTP Solution File: COL100-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COL100-2 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 : Fri Jul 15 00:40:00 EDT 2022
% Result : Timeout 300.11s 300.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : COL100-2 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue May 31 06:37:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.79/1.06 ============================== Prover9 ===============================
% 0.79/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.06 Process 26680 was started by sandbox2 on n027.cluster.edu,
% 0.79/1.06 Tue May 31 06:37:48 2022
% 0.79/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26527_n027.cluster.edu".
% 0.79/1.06 ============================== end of head ===========================
% 0.79/1.06
% 0.79/1.06 ============================== INPUT =================================
% 0.79/1.06
% 0.79/1.06 % Reading from file /tmp/Prover9_26527_n027.cluster.edu
% 0.79/1.06
% 0.79/1.06 set(prolog_style_variables).
% 0.79/1.06 set(auto2).
% 0.79/1.06 % set(auto2) -> set(auto).
% 0.79/1.06 % set(auto) -> set(auto_inference).
% 0.79/1.06 % set(auto) -> set(auto_setup).
% 0.79/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.06 % set(auto) -> set(auto_limits).
% 0.79/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.06 % set(auto) -> set(auto_denials).
% 0.79/1.06 % set(auto) -> set(auto_process).
% 0.79/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.06 % set(auto2) -> assign(stats, some).
% 0.79/1.06 % set(auto2) -> clear(echo_input).
% 0.79/1.06 % set(auto2) -> set(quiet).
% 0.79/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.06 % set(auto2) -> clear(print_given).
% 0.79/1.06 assign(lrs_ticks,-1).
% 0.79/1.06 assign(sos_limit,10000).
% 0.79/1.06 assign(order,kbo).
% 0.79/1.06 set(lex_order_vars).
% 0.79/1.06 clear(print_given).
% 0.79/1.06
% 0.79/1.06 % formulas(sos). % not echoed (160 formulas)
% 0.79/1.06
% 0.79/1.06 ============================== end of input ==========================
% 0.79/1.06
% 0.79/1.06 % From the command line: assign(max_seconds, 300).
% 0.79/1.06
% 0.79/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.06
% 0.79/1.06 % Formulas that are not ordinary clauses:
% 0.79/1.06
% 0.79/1.06 ============================== end of process non-clausal formulas ===
% 0.79/1.06
% 0.79/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.79/1.06
% 0.79/1.06 ============================== PREDICATE ELIMINATION =================
% 0.79/1.06 1 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(pair(A,C),F) # label(clause52) # label(axiom). [assumption].
% 0.79/1.06 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.79/1.06 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.79/1.06 3 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(A,E) # label(clause53) # label(axiom). [assumption].
% 0.79/1.06 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.79/1.06 4 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(C,E) # label(clause54) # label(axiom). [assumption].
% 0.79/1.06 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.79/1.06 5 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(B,V6) # label(clause55) # label(axiom). [assumption].
% 0.79/1.06 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.79/1.06 6 -rmultE_c1(A,B,C,D,E,F,V6,V7) | member(D,V6) # label(clause56) # label(axiom). [assumption].
% 0.79/1.06 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.79/1.06 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.79/1.06 8 -rmultE_c2(A,B,C,D,E,F,V6,V7) | member(pair(B,D),V7) # label(clause57) # label(axiom). [assumption].
% 0.79/1.06 9 -rmultE_c2(A,B,C,D,E,F,V6,V7) | member(C,E) # label(clause58) # label(axiom). [assumption].
% 0.79/1.06 10 -rmultE_c2(A,B,C,D,E,F,V6,V7) | A = C # label(clause59) # label(axiom). [assumption].
% 0.79/1.06 11 -rmultE_c2(A,B,C,D,E,F,V6,V7) | member(B,V6) # label(clause60) # label(axiom). [assumption].
% 0.84/1.09 12 -rmultE_c2(A,B,C,D,E,F,V6,V7) | member(D,V6) # label(clause61) # label(axiom). [assumption].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 Derived: member(A,B) | -member(pair(pair(A,C),pair(D,E)),rmult(B,F,V6,V7)) | A = D. [resolve(13,c,10,a)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 Derived: member(A,B) | -member(pair(pair(C,A),pair(D,E)),rmult(F,V6,B,V7)) | C = D. [resolve(15,c,10,a)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 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)].
% 0.84/1.09 Derived: member(A,B) | -member(pair(pair(C,D),pair(E,A)),rmult(F,V6,B,V7)) | C = E. [resolve(16,c,10,a)].
% 0.84/1.09 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)].
% 0.84/1.09 17 -trans(A) | -member(pair(B,C),A) | -member(pair(C,D),A) | member(pair(B,D),A) # label(transD) # label(axiom). [assumption].
% 0.84/1.09 18 trans(trancl(A)) # label(trans_trancl) # label(axiom). [assumption].
% 0.84/1.09 Derived: -member(pair(A,B),trancl(C)) | -member(pair(B,D),trancl(C)) | member(pair(A,D),trancl(C)). [resolve(17,a,18,a)].
% 0.84/1.09 19 diamond(r) # label(diamond_trancl_2h1) # label(hypothesis). [assumption].
% 0.84/1.09 20 -diamond(A) | -member(pair(B,C),trancl(A)) | -member(pair(B,D),A) | member(pair(D,diamond_strip_lemmaD_sk1(B,C,D,A)),trancl(A)) # label(diamond_strip_lemmaD1) # label(axiom). [assumption].
% 0.84/1.09 21 -diamond(A) | -member(pair(B,C),trancl(A)) | -member(pair(B,D),A) | member(pair(C,diamond_strip_lemmaD_sk1(B,C,D,A)),A) # label(diamond_strip_lemmaD2) # label(axiom). [assumption].
% 0.84/1.09 Derived: -member(pair(A,B),trancl(r)) | -member(pair(A,C),r) | member(pair(C,diamond_strip_lemmaD_sk1(A,B,C,r)),trancl(r)). [resolve(19,a,20,a)].
% 0.84/1.09 Derived: -member(pair(A,B),trancl(r)) | -member(pair(A,C),r) | member(pair(B,diamond_strip_lemmaD_sk1(A,B,C,r)),r). [resolve(19,a,21,a)].
% 0.84/1.09
% 0.84/1.09 ============================== end predicate elimination =============
% 0.84/1.09
% 0.84/1.09 Auto_denials: (non-Horn, no changes).
% 0.84/1.09
% 0.84/1.09 Term ordering decisions:
% 0.84/1.09 Function symbol KB weights: r=1. eptset=1. nat=1. y=1. ya=1. yp=1. z=1. combK=1. combS=1. pair=1. cons=1. qPair=1. comb_app=1. disjsum=1. int=1. comp=Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------