TSTP Solution File: ROB009-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ROB009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:28 EDT 2022
% Result : Unsatisfiable 0.45s 1.07s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ROB009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 14:55:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.07 ============================== Prover9 ===============================
% 0.45/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.07 Process 22406 was started by sandbox2 on n023.cluster.edu,
% 0.45/1.07 Thu Jun 9 14:55:23 2022
% 0.45/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22008_n023.cluster.edu".
% 0.45/1.07 ============================== end of head ===========================
% 0.45/1.07
% 0.45/1.07 ============================== INPUT =================================
% 0.45/1.07
% 0.45/1.07 % Reading from file /tmp/Prover9_22008_n023.cluster.edu
% 0.45/1.07
% 0.45/1.07 set(prolog_style_variables).
% 0.45/1.07 set(auto2).
% 0.45/1.07 % set(auto2) -> set(auto).
% 0.45/1.07 % set(auto) -> set(auto_inference).
% 0.45/1.07 % set(auto) -> set(auto_setup).
% 0.45/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.07 % set(auto) -> set(auto_limits).
% 0.45/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.07 % set(auto) -> set(auto_denials).
% 0.45/1.07 % set(auto) -> set(auto_process).
% 0.45/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.07 % set(auto2) -> assign(stats, some).
% 0.45/1.07 % set(auto2) -> clear(echo_input).
% 0.45/1.07 % set(auto2) -> set(quiet).
% 0.45/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.07 % set(auto2) -> clear(print_given).
% 0.45/1.07 assign(lrs_ticks,-1).
% 0.45/1.07 assign(sos_limit,10000).
% 0.45/1.07 assign(order,kbo).
% 0.45/1.07 set(lex_order_vars).
% 0.45/1.07 clear(print_given).
% 0.45/1.07
% 0.45/1.07 % formulas(sos). % not echoed (5 formulas)
% 0.45/1.07
% 0.45/1.07 ============================== end of input ==========================
% 0.45/1.07
% 0.45/1.07 % From the command line: assign(max_seconds, 300).
% 0.45/1.07
% 0.45/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.07
% 0.45/1.07 % Formulas that are not ordinary clauses:
% 0.45/1.07
% 0.45/1.07 ============================== end of process non-clausal formulas ===
% 0.45/1.07
% 0.45/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.07
% 0.45/1.07 ============================== PREDICATE ELIMINATION =================
% 0.45/1.07
% 0.45/1.07 ============================== end predicate elimination =============
% 0.45/1.07
% 0.45/1.07 Auto_denials:
% 0.45/1.07 % copying label prove_result to answer in negative clause
% 0.45/1.07
% 0.45/1.07 Term ordering decisions:
% 0.45/1.07
% 0.45/1.07 % Assigning unary symbol negate kb_weight 0 and highest precedence (6).
% 0.45/1.07 Function symbol KB weights: a=1. b=1. c=1. add=1. negate=0.
% 0.45/1.07
% 0.45/1.07 ============================== end of process initial clauses ========
% 0.45/1.07
% 0.45/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.07
% 0.45/1.07 ============================== end of clauses for search =============
% 0.45/1.07
% 0.45/1.07 ============================== SEARCH ================================
% 0.45/1.07
% 0.45/1.07 % Starting search at 0.01 seconds.
% 0.45/1.07
% 0.45/1.07 ============================== PROOF =================================
% 0.45/1.07 % SZS status Unsatisfiable
% 0.45/1.07 % SZS output start Refutation
% 0.45/1.07
% 0.45/1.07 % Proof 1 at 0.01 (+ 0.00) seconds: prove_result.
% 0.45/1.07 % Length of proof is 10.
% 0.45/1.07 % Level of proof is 3.
% 0.45/1.07 % Maximum clause weight is 15.000.
% 0.45/1.07 % Given clauses 4.
% 0.45/1.07
% 0.45/1.07 1 add(A,B) = add(B,A) # label(commutativity_of_add) # label(axiom). [assumption].
% 0.45/1.07 2 add(add(A,B),C) = add(A,add(B,C)) # label(associativity_of_add) # label(axiom). [assumption].
% 0.45/1.07 3 add(A,add(B,C)) = add(C,add(A,B)). [copy(2),rewrite([1(2)]),flip(a)].
% 0.45/1.07 4 negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A # label(robbins_axiom) # label(axiom). [assumption].
% 0.45/1.07 5 negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))) # label(condition) # label(hypothesis). [assumption].
% 0.45/1.07 6 negate(add(b,negate(add(a,c)))) = negate(add(a,negate(add(b,c)))). [copy(5),flip(a)].
% 0.45/1.07 7 a != b # label(prove_result) # label(negated_conjecture) # answer(prove_result). [assumption].
% 0.45/1.07 8 b != a # answer(prove_result). [copy(7),flip(a)].
% 0.45/1.07 17 b = a. [para(6(a,1),4(a,1,1,2)),rewrite([3(5,R),1(4),4(15)]),flip(a)].
% 0.45/1.07 18 $F # answer(prove_result). [resolve(17,a,8,a)].
% 0.45/1.07
% 0.45/1.07 % SZS output end Refutation
% 0.45/1.07 ============================== end of proof ==========================
% 0.45/1.07
% 0.45/1.07 ============================== STATISTICS ============================
% 0.45/1.07
% 0.45/1.07 Given=4. Generated=45. Kept=14. proofs=1.
% 0.45/1.07 Usable=4. Sos=7. Demods=12. Limbo=2, Disabled=5. Hints=0.
% 0.45/1.07 Megabytes=0.04.
% 0.45/1.07 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.07
% 0.45/1.07 ============================== end of statistics =====================
% 0.45/1.07
% 0.45/1.07 ============================== end of search =========================
% 0.45/1.07
% 0.45/1.07 THEOREM PROVED
% 0.45/1.07 % SZS status Unsatisfiable
% 0.45/1.07
% 0.45/1.07 Exiting with 1 proof.
% 0.45/1.07
% 0.45/1.07 Process 22406 exit (max_proofs) Thu Jun 9 14:55:23 2022
% 0.45/1.07 Prover9 interrupted
%------------------------------------------------------------------------------