TSTP Solution File: KRS002-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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 : Sun Jul 17 03:24:44 EDT 2022
% Result : Unsatisfiable 0.41s 0.96s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 07:14:02 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.41/0.95 ============================== Prover9 ===============================
% 0.41/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.95 Process 9055 was started by sandbox on n017.cluster.edu,
% 0.41/0.95 Tue Jun 7 07:14:03 2022
% 0.41/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8902_n017.cluster.edu".
% 0.41/0.95 ============================== end of head ===========================
% 0.41/0.95
% 0.41/0.95 ============================== INPUT =================================
% 0.41/0.95
% 0.41/0.95 % Reading from file /tmp/Prover9_8902_n017.cluster.edu
% 0.41/0.95
% 0.41/0.95 set(prolog_style_variables).
% 0.41/0.95 set(auto2).
% 0.41/0.95 % set(auto2) -> set(auto).
% 0.41/0.95 % set(auto) -> set(auto_inference).
% 0.41/0.95 % set(auto) -> set(auto_setup).
% 0.41/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.95 % set(auto) -> set(auto_limits).
% 0.41/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.95 % set(auto) -> set(auto_denials).
% 0.41/0.95 % set(auto) -> set(auto_process).
% 0.41/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.95 % set(auto2) -> assign(stats, some).
% 0.41/0.95 % set(auto2) -> clear(echo_input).
% 0.41/0.95 % set(auto2) -> set(quiet).
% 0.41/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.95 % set(auto2) -> clear(print_given).
% 0.41/0.95 assign(lrs_ticks,-1).
% 0.41/0.95 assign(sos_limit,10000).
% 0.41/0.95 assign(order,kbo).
% 0.41/0.95 set(lex_order_vars).
% 0.41/0.95 clear(print_given).
% 0.41/0.95
% 0.41/0.95 % formulas(sos). % not echoed (18 formulas)
% 0.41/0.95
% 0.41/0.95 ============================== end of input ==========================
% 0.41/0.95
% 0.41/0.95 % From the command line: assign(max_seconds, 300).
% 0.41/0.95
% 0.41/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.95
% 0.41/0.95 % Formulas that are not ordinary clauses:
% 0.41/0.95
% 0.41/0.95 ============================== end of process non-clausal formulas ===
% 0.41/0.95
% 0.41/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.95
% 0.41/0.95 ============================== PREDICATE ELIMINATION =================
% 0.41/0.95 1 r(A,u4r2(A)) | -e(A) # label(clause_14) # label(axiom). [assumption].
% 0.41/0.95 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.41/0.95 Derived: r(exist,u4r2(exist)). [resolve(1,b,2,a)].
% 0.41/0.95 3 d(A) | -e(B) | -r(B,A) # label(clause_15) # label(axiom). [assumption].
% 0.41/0.95 Derived: d(A) | -r(exist,A). [resolve(3,b,2,a)].
% 0.41/0.95 4 c(A) | -e(B) | -r(B,A) # label(clause_16) # label(axiom). [assumption].
% 0.41/0.95 Derived: c(A) | -r(exist,A). [resolve(4,b,2,a)].
% 0.41/0.95 5 e(A) | r(A,u4r1(A)) | -r(A,B) # label(clause_18) # label(axiom). [assumption].
% 0.41/0.95 Derived: r(A,u4r1(A)) | -r(A,B) | r(A,u4r2(A)). [resolve(5,a,1,b)].
% 0.41/0.95 Derived: r(A,u4r1(A)) | -r(A,B) | d(C) | -r(A,C). [resolve(5,a,3,b)].
% 0.41/0.95 Derived: r(A,u4r1(A)) | -r(A,B) | c(C) | -r(A,C). [resolve(5,a,4,b)].
% 0.41/0.95 6 e(A) | -c(u4r1(A)) | -d(u4r1(A)) | -r(A,B) # label(clause_17) # label(axiom). [assumption].
% 0.41/0.95 Derived: -c(u4r1(A)) | -d(u4r1(A)) | -r(A,B) | r(A,u4r2(A)). [resolve(6,a,1,b)].
% 0.41/0.95 Derived: -c(u4r1(A)) | -d(u4r1(A)) | -r(A,B) | d(C) | -r(A,C). [resolve(6,a,3,b)].
% 0.41/0.95 Derived: -c(u4r1(A)) | -d(u4r1(A)) | -r(A,B) | c(C) | -r(A,C). [resolve(6,a,4,b)].
% 0.41/0.95 7 d(A) | -s1most(A) # label(clause_9) # label(axiom). [assumption].
% 0.41/0.95 8 s1most(A) | s(A,u3r1(A)) # label(clause_12) # label(axiom). [assumption].
% 0.41/0.95 9 s1most(A) | s(A,u3r2(A)) # label(clause_13) # label(axiom). [assumption].
% 0.41/0.95 10 s1most(A) | -d(A) # label(clause_8) # label(axiom). [assumption].
% 0.41/0.95 Derived: d(A) | s(A,u3r1(A)). [resolve(7,b,8,a)].
% 0.41/0.95 Derived: d(A) | s(A,u3r2(A)). [resolve(7,b,9,a)].
% 0.41/0.95 11 s1most(A) | -equalish(u3r2(A),u3r1(A)) # label(clause_11) # label(axiom). [assumption].
% 0.41/0.95 Derived: -equalish(u3r2(A),u3r1(A)) | d(A). [resolve(11,a,7,b)].
% 0.41/0.95 12 equalish(A,B) | -s1most(C) | -s(C,A) | -s(C,B) # label(clause_10) # label(axiom). [assumption].
% 0.41/0.95 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u3r1(C)). [resolve(12,b,8,a)].
% 0.41/0.96 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u3r2(C)). [resolve(12,b,9,a)].
% 0.41/0.96 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -d(C). [resolve(12,b,10,a)].
% 0.41/0.96 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u3r2(C),u3r1(C)). [resolve(12,b,11,a)].
% 0.41/0.96 13 s2least(A) | -c(A) # label(clause_2) # label(axiom). [assumption].
% 0.41/0.96 14 -s2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_4) # label(axiom). [assumption].
% 0.41/0.96 Derived: -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(13,a,14,a)].
% 0.41/0.96 15 c(A) | -s2least(A) # label(clause_3) # label(axiom). [assumption].
% 0.41/0.96 16 s(A,u1r1(A)) | -s2least(A) # label(clause_5) # label(axiom). [assumption].
% 0.41/0.96 Derived: s(A,u1r1(A)) | -c(A). [resolve(16,b,13,a)].
% 0.41/0.96 17 s(A,u1r2(A)) | -s2least(A) # label(clause_6) # label(axiom). [assumption].
% 0.41/0.96 Derived: s(A,u1r2(A)) | -c(A). [resolve(17,b,13,a)].
% 0.41/0.96 18 s2least(A) | equalish(B,C) | -s(A,B) | -s(A,C) # label(clause_7) # label(axiom). [assumption].
% 0.41/0.96 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u1r2(C),u1r1(C)). [resolve(18,a,14,a)].
% 0.41/0.96 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | c(C). [resolve(18,a,15,b)].
% 0.41/0.96 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u1r1(C)). [resolve(18,a,16,b)].
% 0.41/0.96 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u1r2(C)). [resolve(18,a,17,b)].
% 0.41/0.96
% 0.41/0.96 ============================== end predicate elimination =============
% 0.41/0.96
% 0.41/0.96 Auto_denials: (non-Horn, no changes).
% 0.41/0.96
% 0.41/0.96 Term ordering decisions:
% 0.41/0.96 Function symbol KB weights: exist=1. u4r1=1. u3r1=1. u3r2=1. u1r1=1. u1r2=1. u4r2=1.
% 0.41/0.96
% 0.41/0.96 ============================== end of process initial clauses ========
% 0.41/0.96
% 0.41/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.96
% 0.41/0.96 ============================== end of clauses for search =============
% 0.41/0.96
% 0.41/0.96 ============================== SEARCH ================================
% 0.41/0.96
% 0.41/0.96 % Starting search at 0.01 seconds.
% 0.41/0.96
% 0.41/0.96 ============================== PROOF =================================
% 0.41/0.96 % SZS status Unsatisfiable
% 0.41/0.96 % SZS output start Refutation
% 0.41/0.96
% 0.41/0.96 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.41/0.96 % Length of proof is 23.
% 0.41/0.96 % Level of proof is 4.
% 0.41/0.96 % Maximum clause weight is 11.000.
% 0.41/0.96 % Given clauses 38.
% 0.41/0.96
% 0.41/0.96 1 r(A,u4r2(A)) | -e(A) # label(clause_14) # label(axiom). [assumption].
% 0.41/0.96 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.41/0.96 3 d(A) | -e(B) | -r(B,A) # label(clause_15) # label(axiom). [assumption].
% 0.41/0.96 4 c(A) | -e(B) | -r(B,A) # label(clause_16) # label(axiom). [assumption].
% 0.41/0.96 10 s1most(A) | -d(A) # label(clause_8) # label(axiom). [assumption].
% 0.41/0.96 12 equalish(A,B) | -s1most(C) | -s(C,A) | -s(C,B) # label(clause_10) # label(axiom). [assumption].
% 0.41/0.96 13 s2least(A) | -c(A) # label(clause_2) # label(axiom). [assumption].
% 0.41/0.96 14 -s2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_4) # label(axiom). [assumption].
% 0.41/0.96 16 s(A,u1r1(A)) | -s2least(A) # label(clause_5) # label(axiom). [assumption].
% 0.41/0.96 17 s(A,u1r2(A)) | -s2least(A) # label(clause_6) # label(axiom). [assumption].
% 0.41/0.96 19 r(exist,u4r2(exist)). [resolve(1,b,2,a)].
% 0.41/0.96 20 d(A) | -r(exist,A). [resolve(3,b,2,a)].
% 0.41/0.96 21 c(A) | -r(exist,A). [resolve(4,b,2,a)].
% 0.41/0.96 33 equalish(A,B) | -s(C,A) | -s(C,B) | -d(C). [resolve(12,b,10,a)].
% 0.41/0.96 35 -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(13,a,14,a)].
% 0.41/0.96 36 s(A,u1r1(A)) | -c(A). [resolve(16,b,13,a)].
% 0.41/0.96 37 s(A,u1r2(A)) | -c(A). [resolve(17,b,13,a)].
% 0.41/0.96 54 d(u4r2(exist)). [resolve(20,b,19,a)].
% 0.41/0.96 55 c(u4r2(exist)). [resolve(21,b,19,a)].
% 0.41/0.96 74 s(u4r2(exist),u1r2(u4r2(exist))). [resolve(55,a,37,b)].
% 0.41/0.96 75 s(u4r2(exist),u1r1(u4r2(exist))). [resolve(55,a,36,b)].
% 0.41/0.96 76 -equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))). [ur(35,a,55,a)].
% 0.41/0.96 85 $F. [ur(33,a,76,a,c,75,a,d,54,a),unit_del(a,74)].
% 0.41/0.96
% 0.41/0.96 % SZS output end Refutation
% 0.41/0.96 ============================== end of proof ==========================
% 0.41/0.96
% 0.41/0.96 ============================== STATISTICS ============================
% 0.41/0.96
% 0.41/0.96 Given=38. Generated=125. Kept=66. proofs=1.
% 0.41/0.96 Usable=38. Sos=23. Demods=0. Limbo=1, Disabled=45. Hints=0.
% 0.41/0.96 Megabytes=0.08.
% 0.41/0.96 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.41/0.96
% 0.41/0.96 ============================== end of statistics =====================
% 0.41/0.96
% 0.41/0.96 ============================== end of search =========================
% 0.41/0.96
% 0.41/0.96 THEOREM PROVED
% 0.41/0.96 % SZS status Unsatisfiable
% 0.41/0.96
% 0.41/0.96 Exiting with 1 proof.
% 0.41/0.96
% 0.41/0.96 Process 9055 exit (max_proofs) Tue Jun 7 07:14:03 2022
% 0.41/0.96 Prover9 interrupted
%------------------------------------------------------------------------------