TSTP Solution File: KRS003-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS003-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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.44s 1.00s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS003-1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n020.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 : Tue Jun 7 18:57:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 12706 was started by sandbox2 on n020.cluster.edu,
% 0.44/1.00 Tue Jun 7 18:57:52 2022
% 0.44/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12552_n020.cluster.edu".
% 0.44/1.00 ============================== end of head ===========================
% 0.44/1.00
% 0.44/1.00 ============================== INPUT =================================
% 0.44/1.00
% 0.44/1.00 % Reading from file /tmp/Prover9_12552_n020.cluster.edu
% 0.44/1.00
% 0.44/1.00 set(prolog_style_variables).
% 0.44/1.00 set(auto2).
% 0.44/1.00 % set(auto2) -> set(auto).
% 0.44/1.00 % set(auto) -> set(auto_inference).
% 0.44/1.00 % set(auto) -> set(auto_setup).
% 0.44/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00 % set(auto) -> set(auto_limits).
% 0.44/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00 % set(auto) -> set(auto_denials).
% 0.44/1.00 % set(auto) -> set(auto_process).
% 0.44/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00 % set(auto2) -> assign(stats, some).
% 0.44/1.00 % set(auto2) -> clear(echo_input).
% 0.44/1.00 % set(auto2) -> set(quiet).
% 0.44/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00 % set(auto2) -> clear(print_given).
% 0.44/1.00 assign(lrs_ticks,-1).
% 0.44/1.00 assign(sos_limit,10000).
% 0.44/1.00 assign(order,kbo).
% 0.44/1.00 set(lex_order_vars).
% 0.44/1.00 clear(print_given).
% 0.44/1.00
% 0.44/1.00 % formulas(sos). % not echoed (16 formulas)
% 0.44/1.00
% 0.44/1.00 ============================== end of input ==========================
% 0.44/1.00
% 0.44/1.00 % From the command line: assign(max_seconds, 300).
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00
% 0.44/1.00 % Formulas that are not ordinary clauses:
% 0.44/1.00
% 0.44/1.00 ============================== end of process non-clausal formulas ===
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.00
% 0.44/1.00 ============================== PREDICATE ELIMINATION =================
% 0.44/1.00 1 c(A) | -e(A) # label(clause_15) # label(axiom). [assumption].
% 0.44/1.00 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: c(exist). [resolve(1,b,2,a)].
% 0.44/1.00 3 d(A) | -f(A) # label(clause_16) # label(axiom). [assumption].
% 0.44/1.00 4 f(exist) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.44/1.00 Derived: d(exist). [resolve(3,b,4,a)].
% 0.44/1.00 5 d(A) | -s1most(A) # label(clause_10) # label(axiom). [assumption].
% 0.44/1.00 6 s1most(A) | s(A,u3r1(A)) # label(clause_13) # label(axiom). [assumption].
% 0.44/1.00 7 s1most(A) | s(A,u3r2(A)) # label(clause_14) # label(axiom). [assumption].
% 0.44/1.00 8 s1most(A) | -d(A) # label(clause_9) # label(axiom). [assumption].
% 0.44/1.00 Derived: d(A) | s(A,u3r1(A)). [resolve(5,b,6,a)].
% 0.44/1.00 Derived: d(A) | s(A,u3r2(A)). [resolve(5,b,7,a)].
% 0.44/1.00 9 s1most(A) | -equalish(u3r2(A),u3r1(A)) # label(clause_12) # label(axiom). [assumption].
% 0.44/1.00 Derived: -equalish(u3r2(A),u3r1(A)) | d(A). [resolve(9,a,5,b)].
% 0.44/1.00 10 equalish(A,B) | -s1most(C) | -s(C,A) | -s(C,B) # label(clause_11) # label(axiom). [assumption].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u3r1(C)). [resolve(10,b,6,a)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u3r2(C)). [resolve(10,b,7,a)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -d(C). [resolve(10,b,8,a)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u3r2(C),u3r1(C)). [resolve(10,b,9,a)].
% 0.44/1.00 11 s2least(A) | -c(A) # label(clause_3) # label(axiom). [assumption].
% 0.44/1.00 12 -s2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_5) # label(axiom). [assumption].
% 0.44/1.00 Derived: -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(11,a,12,a)].
% 0.44/1.00 13 c(A) | -s2least(A) # label(clause_4) # label(axiom). [assumption].
% 0.44/1.00 14 s(A,u1r1(A)) | -s2least(A) # label(clause_6) # label(axiom). [assumption].
% 0.44/1.00 Derived: s(A,u1r1(A)) | -c(A). [resolve(14,b,11,a)].
% 0.44/1.00 15 s(A,u1r2(A)) | -s2least(A) # label(clause_7) # label(axiom). [assumption].
% 0.44/1.00 Derived: s(A,u1r2(A)) | -c(A). [resolve(15,b,11,a)].
% 0.44/1.00 16 s2least(A) | equalish(B,C) | -s(A,B) | -s(A,C) # label(clause_8) # label(axiom). [assumption].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u1r2(C),u1r1(C)). [resolve(16,a,12,a)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | c(C). [resolve(16,a,13,b)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u1r1(C)). [resolve(16,a,14,b)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u1r2(C)). [resolve(16,a,15,b)].
% 0.44/1.00 17 -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(11,a,12,a)].
% 0.44/1.00 18 c(exist). [resolve(1,b,2,a)].
% 0.44/1.00 Derived: -equalish(u1r2(exist),u1r1(exist)). [resolve(17,a,18,a)].
% 0.44/1.00 19 s(A,u1r1(A)) | -c(A). [resolve(14,b,11,a)].
% 0.44/1.00 Derived: s(exist,u1r1(exist)). [resolve(19,b,18,a)].
% 0.44/1.00 20 s(A,u1r2(A)) | -c(A). [resolve(15,b,11,a)].
% 0.44/1.00 Derived: s(exist,u1r2(exist)). [resolve(20,b,18,a)].
% 0.44/1.00 21 equalish(A,B) | -s(C,A) | -s(C,B) | c(C). [resolve(16,a,13,b)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u1r2(C),u1r1(C)). [resolve(21,d,17,a)].
% 0.44/1.00 22 equalish(A,B) | -s(C,A) | -s(C,B) | -d(C). [resolve(10,b,8,a)].
% 0.44/1.00 23 d(exist). [resolve(3,b,4,a)].
% 0.44/1.00 24 d(A) | s(A,u3r1(A)). [resolve(5,b,6,a)].
% 0.44/1.00 25 d(A) | s(A,u3r2(A)). [resolve(5,b,7,a)].
% 0.44/1.00 26 -equalish(u3r2(A),u3r1(A)) | d(A). [resolve(9,a,5,b)].
% 0.44/1.00 Derived: equalish(A,B) | -s(exist,A) | -s(exist,B). [resolve(22,d,23,a)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u3r1(C)). [resolve(22,d,24,a)].
% 0.44/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u3r2(C)). [resolve(22,d,25,a)].
% 0.44/1.00
% 0.44/1.00 ============================== end predicate elimination =============
% 0.44/1.00
% 0.44/1.00 Auto_denials: (non-Horn, no changes).
% 0.44/1.00
% 0.44/1.00 Term ordering decisions:
% 0.44/1.00 Function symbol KB weights: exist=1. u1r1=1. u1r2=1. u3r1=1. u3r2=1.
% 0.44/1.00
% 0.44/1.00 ============================== end of process initial clauses ========
% 0.44/1.00
% 0.44/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.00
% 0.44/1.00 ============================== end of clauses for search =============
% 0.44/1.00
% 0.44/1.00 ============================== SEARCH ================================
% 0.44/1.00
% 0.44/1.00 % Starting search at 0.01 seconds.
% 0.44/1.00
% 0.44/1.00 ============================== PROOF =================================
% 0.44/1.00 % SZS status Unsatisfiable
% 0.44/1.00 % SZS output start Refutation
% 0.44/1.00
% 0.44/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/1.00 % Length of proof is 21.
% 0.44/1.00 % Level of proof is 3.
% 0.44/1.00 % Maximum clause weight is 9.000.
% 0.44/1.00 % Given clauses 10.
% 0.44/1.00
% 0.44/1.00 1 c(A) | -e(A) # label(clause_15) # label(axiom). [assumption].
% 0.44/1.00 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.44/1.00 3 d(A) | -f(A) # label(clause_16) # label(axiom). [assumption].
% 0.44/1.00 4 f(exist) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.44/1.00 8 s1most(A) | -d(A) # label(clause_9) # label(axiom). [assumption].
% 0.44/1.00 10 equalish(A,B) | -s1most(C) | -s(C,A) | -s(C,B) # label(clause_11) # label(axiom). [assumption].
% 0.44/1.00 11 s2least(A) | -c(A) # label(clause_3) # label(axiom). [assumption].
% 0.44/1.00 12 -s2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_5) # label(axiom). [assumption].
% 0.44/1.00 14 s(A,u1r1(A)) | -s2least(A) # label(clause_6) # label(axiom). [assumption].
% 0.44/1.00 15 s(A,u1r2(A)) | -s2least(A) # label(clause_7) # label(axiom). [assumption].
% 0.44/1.00 17 -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(11,a,12,a)].
% 0.44/1.00 18 c(exist). [resolve(1,b,2,a)].
% 0.44/1.00 19 s(A,u1r1(A)) | -c(A). [resolve(14,b,11,a)].
% 0.44/1.00 20 s(A,u1r2(A)) | -c(A). [resolve(15,b,11,a)].
% 0.44/1.00 22 equalish(A,B) | -s(C,A) | -s(C,B) | -d(C). [resolve(10,b,8,a)].
% 0.44/1.00 23 d(exist). [resolve(3,b,4,a)].
% 0.44/1.00 33 -equalish(u1r2(exist),u1r1(exist)). [resolve(17,a,18,a)].
% 0.44/1.00 34 s(exist,u1r1(exist)). [resolve(19,b,18,a)].
% 0.44/1.00 35 s(exist,u1r2(exist)). [resolve(20,b,18,a)].
% 0.44/1.00 36 equalish(A,B) | -s(exist,A) | -s(exist,B). [resolve(22,d,23,a)].
% 0.44/1.00 57 $F. [ur(36,a,33,a,c,34,a),unit_del(a,35)].
% 0.44/1.00
% 0.44/1.00 % SZS output end Refutation
% 0.44/1.00 ============================== end of proof ==========================
% 0.44/1.00
% 0.44/1.00 ============================== STATISTICS ============================
% 0.44/1.00
% 0.44/1.00 Given=10. Generated=43. Kept=30. proofs=1.
% 0.44/1.00 Usable=10. Sos=16. Demods=0. Limbo=4, Disabled=39. Hints=0.
% 0.44/1.00 Megabytes=0.05.
% 0.44/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/1.00
% 0.44/1.00 ============================== end of statistics =====================
% 0.44/1.00
% 0.44/1.00 ============================== end of search =========================
% 0.44/1.00
% 0.44/1.00 THEOREM PROVED
% 0.44/1.00 % SZS status Unsatisfiable
% 0.44/1.00
% 0.44/1.00 Exiting with 1 proof.
% 0.44/1.00
% 0.44/1.00 Process 12706 exit (max_proofs) Tue Jun 7 18:57:52 2022
% 0.44/1.00 Prover9 interrupted
%------------------------------------------------------------------------------