TSTP Solution File: ROB016-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ROB016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Mon Jul 18 20:55:29 EDT 2022
% Result : Unsatisfiable 0.45s 0.99s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ROB016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n021.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 : Thu Jun 9 14:51:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.45/0.99 ============================== Prover9 ===============================
% 0.45/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99 Process 829 was started by sandbox on n021.cluster.edu,
% 0.45/0.99 Thu Jun 9 14:51:39 2022
% 0.45/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_662_n021.cluster.edu".
% 0.45/0.99 ============================== end of head ===========================
% 0.45/0.99
% 0.45/0.99 ============================== INPUT =================================
% 0.45/0.99
% 0.45/0.99 % Reading from file /tmp/Prover9_662_n021.cluster.edu
% 0.45/0.99
% 0.45/0.99 set(prolog_style_variables).
% 0.45/0.99 set(auto2).
% 0.45/0.99 % set(auto2) -> set(auto).
% 0.45/0.99 % set(auto) -> set(auto_inference).
% 0.45/0.99 % set(auto) -> set(auto_setup).
% 0.45/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99 % set(auto) -> set(auto_limits).
% 0.45/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99 % set(auto) -> set(auto_denials).
% 0.45/0.99 % set(auto) -> set(auto_process).
% 0.45/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99 % set(auto2) -> assign(stats, some).
% 0.45/0.99 % set(auto2) -> clear(echo_input).
% 0.45/0.99 % set(auto2) -> set(quiet).
% 0.45/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99 % set(auto2) -> clear(print_given).
% 0.45/0.99 assign(lrs_ticks,-1).
% 0.45/0.99 assign(sos_limit,10000).
% 0.45/0.99 assign(order,kbo).
% 0.45/0.99 set(lex_order_vars).
% 0.45/0.99 clear(print_given).
% 0.45/0.99
% 0.45/0.99 % formulas(sos). % not echoed (11 formulas)
% 0.45/0.99
% 0.45/0.99 ============================== end of input ==========================
% 0.45/0.99
% 0.45/0.99 % From the command line: assign(max_seconds, 300).
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99
% 0.45/0.99 % Formulas that are not ordinary clauses:
% 0.45/0.99
% 0.45/0.99 ============================== end of process non-clausal formulas ===
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99
% 0.45/0.99 ============================== PREDICATE ELIMINATION =================
% 0.45/0.99
% 0.45/0.99 ============================== end predicate elimination =============
% 0.45/0.99
% 0.45/0.99 Auto_denials:
% 0.45/0.99 % copying label prove_result to answer in negative clause
% 0.45/0.99
% 0.45/0.99 Term ordering decisions:
% 0.45/0.99 Function symbol KB weights: e=1. one=1. d=1. k=1. add=1. multiply=1. negate=1. successor=1.
% 0.45/0.99
% 0.45/0.99 ============================== end of process initial clauses ========
% 0.45/0.99
% 0.45/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.99
% 0.45/0.99 ============================== end of clauses for search =============
% 0.45/0.99
% 0.45/0.99 ============================== SEARCH ================================
% 0.45/0.99
% 0.45/0.99 % Starting search at 0.01 seconds.
% 0.45/0.99
% 0.45/0.99 ============================== PROOF =================================
% 0.45/0.99 % SZS status Unsatisfiable
% 0.45/0.99 % SZS output start Refutation
% 0.45/0.99
% 0.45/0.99 % Proof 1 at 0.01 (+ 0.00) seconds: prove_result.
% 0.45/0.99 % Length of proof is 11.
% 0.45/0.99 % Level of proof is 3.
% 0.45/0.99 % Maximum clause weight is 28.000.
% 0.45/0.99 % Given clauses 12.
% 0.45/0.99
% 0.45/0.99 2 positive_integer(k) # label(k_positive) # label(axiom). [assumption].
% 0.45/0.99 4 add(A,B) = add(B,A) # label(commutativity_of_add) # label(axiom). [assumption].
% 0.45/0.99 5 negate(add(d,e)) = negate(e) # label(condition) # label(hypothesis). [assumption].
% 0.45/0.99 6 negate(add(e,d)) = negate(e). [copy(5),rewrite([4(3)])].
% 0.45/0.99 9 negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A # label(robbins_axiom) # label(axiom). [assumption].
% 0.45/0.99 10 negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e) # label(prove_result) # label(negated_conjecture) # answer(prove_result). [assumption].
% 0.45/0.99 14 negate(add(negate(A),negate(add(B,negate(A))))) != B | -positive_integer(C) | negate(add(A,multiply(C,add(B,negate(add(B,negate(A))))))) = negate(A) # label(lemma_3_6) # label(axiom). [assumption].
% 0.45/0.99 15 negate(add(negate(add(A,B)),negate(add(B,negate(A))))) = B. [para(4(a,1),9(a,1,1,1,1))].
% 0.45/0.99 27 negate(add(negate(e),negate(add(d,negate(e))))) != d # answer(prove_result). [ur(14,b,2,a,c,10,a)].
% 0.45/0.99 28 negate(add(negate(e),negate(add(d,negate(e))))) = d. [para(6(a,1),15(a,1,1,1))].
% 0.45/0.99 29 $F # answer(prove_result). [resolve(28,a,27,a)].
% 0.45/0.99
% 0.45/0.99 % SZS output end Refutation
% 0.45/0.99 ============================== end of proof ==========================
% 0.45/0.99
% 0.45/0.99 ============================== STATISTICS ============================
% 0.45/0.99
% 0.45/0.99 Given=12. Generated=61. Kept=25. proofs=1.
% 0.45/0.99 Usable=12. Sos=12. Demods=15. Limbo=0, Disabled=11. Hints=0.
% 0.45/0.99 Megabytes=0.07.
% 0.45/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/0.99
% 0.45/0.99 ============================== end of statistics =====================
% 0.45/0.99
% 0.45/0.99 ============================== end of search =========================
% 0.45/0.99
% 0.45/0.99 THEOREM PROVED
% 0.45/0.99 % SZS status Unsatisfiable
% 0.45/0.99
% 0.45/0.99 Exiting with 1 proof.
% 0.45/0.99
% 0.45/0.99 Process 829 exit (max_proofs) Thu Jun 9 14:51:39 2022
% 0.45/0.99 Prover9 interrupted
%------------------------------------------------------------------------------