TSTP Solution File: NUM004-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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 13:24:33 EDT 2022
% Result : Unsatisfiable 0.74s 1.01s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n008.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 Jul 5 22:38:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.01 ============================== Prover9 ===============================
% 0.74/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.01 Process 18656 was started by sandbox on n008.cluster.edu,
% 0.74/1.01 Tue Jul 5 22:38:54 2022
% 0.74/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18503_n008.cluster.edu".
% 0.74/1.01 ============================== end of head ===========================
% 0.74/1.01
% 0.74/1.01 ============================== INPUT =================================
% 0.74/1.01
% 0.74/1.01 % Reading from file /tmp/Prover9_18503_n008.cluster.edu
% 0.74/1.01
% 0.74/1.01 set(prolog_style_variables).
% 0.74/1.01 set(auto2).
% 0.74/1.01 % set(auto2) -> set(auto).
% 0.74/1.01 % set(auto) -> set(auto_inference).
% 0.74/1.01 % set(auto) -> set(auto_setup).
% 0.74/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.01 % set(auto) -> set(auto_limits).
% 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.01 % set(auto) -> set(auto_denials).
% 0.74/1.01 % set(auto) -> set(auto_process).
% 0.74/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.01 % set(auto2) -> assign(stats, some).
% 0.74/1.01 % set(auto2) -> clear(echo_input).
% 0.74/1.01 % set(auto2) -> set(quiet).
% 0.74/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.01 % set(auto2) -> clear(print_given).
% 0.74/1.01 assign(lrs_ticks,-1).
% 0.74/1.01 assign(sos_limit,10000).
% 0.74/1.01 assign(order,kbo).
% 0.74/1.01 set(lex_order_vars).
% 0.74/1.01 clear(print_given).
% 0.74/1.01
% 0.74/1.01 % formulas(sos). % not echoed (13 formulas)
% 0.74/1.01
% 0.74/1.01 ============================== end of input ==========================
% 0.74/1.01
% 0.74/1.01 % From the command line: assign(max_seconds, 300).
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.01
% 0.74/1.01 % Formulas that are not ordinary clauses:
% 0.74/1.01
% 0.74/1.01 ============================== end of process non-clausal formulas ===
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.01
% 0.74/1.01 ============================== PREDICATE ELIMINATION =================
% 0.74/1.01
% 0.74/1.01 ============================== end predicate elimination =============
% 0.74/1.01
% 0.74/1.01 Auto_denials:
% 0.74/1.01 % copying label prove_equation to answer in negative clause
% 0.74/1.01
% 0.74/1.01 Term ordering decisions:
% 0.74/1.01 Function symbol KB weights: a=1. b=1. c=1. add=1. subtract=1.
% 0.74/1.01
% 0.74/1.01 ============================== end of process initial clauses ========
% 0.74/1.01
% 0.74/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.01
% 0.74/1.01 ============================== end of clauses for search =============
% 0.74/1.01
% 0.74/1.01 ============================== SEARCH ================================
% 0.74/1.01
% 0.74/1.01 % Starting search at 0.01 seconds.
% 0.74/1.01
% 0.74/1.01 ============================== PROOF =================================
% 0.74/1.01 % SZS status Unsatisfiable
% 0.74/1.01 % SZS output start Refutation
% 0.74/1.01
% 0.74/1.01 % Proof 1 at 0.02 (+ 0.00) seconds: prove_equation.
% 0.74/1.01 % Length of proof is 10.
% 0.74/1.01 % Level of proof is 3.
% 0.74/1.01 % Maximum clause weight is 13.000.
% 0.74/1.01 % Given clauses 15.
% 0.74/1.01
% 0.74/1.01 1 equalish(A,A) # label(reflexivity) # label(axiom). [assumption].
% 0.74/1.01 2 equalish(add(A,B),add(B,A)) # label(commutativity_of_addition) # label(axiom). [assumption].
% 0.74/1.01 7 equalish(subtract(add(A,B),C),add(subtract(A,C),B)) # label(commutativity2) # label(axiom). [assumption].
% 0.74/1.01 8 -equalish(subtract(add(a,b),c),add(a,subtract(b,c))) # label(prove_equation) # label(negated_conjecture) # answer(prove_equation). [assumption].
% 0.74/1.01 9 -equalish(A,B) | -equalish(B,C) | equalish(A,C) # label(transitivity) # label(axiom). [assumption].
% 0.74/1.01 12 -equalish(A,B) | -equalish(C,subtract(A,D)) | equalish(C,subtract(B,D)) # label(subtract_substitution1) # label(axiom). [assumption].
% 0.74/1.01 35 -equalish(subtract(add(a,b),c),add(subtract(b,c),a)) # answer(prove_equation). [ur(9,b,2,a,c,8,a)].
% 0.74/1.01 116 equalish(subtract(add(A,B),C),subtract(add(B,A),C)). [ur(12,a,2,a,b,1,a)].
% 0.74/1.01 153 -equalish(subtract(add(a,b),c),subtract(add(b,a),c)) # answer(prove_equation). [ur(9,b,7,a,c,35,a)].
% 0.74/1.01 154 $F # answer(prove_equation). [resolve(153,a,116,a)].
% 0.74/1.01
% 0.74/1.01 % SZS output end Refutation
% 0.74/1.01 ============================== end of proof ==========================
% 0.74/1.01
% 0.74/1.01 ============================== STATISTICS ============================
% 0.74/1.01
% 0.74/1.01 Given=15. Generated=207. Kept=153. proofs=1.
% 0.74/1.01 Usable=15. Sos=132. Demods=0. Limbo=5, Disabled=13. Hints=0.
% 0.74/1.01 Megabytes=0.16.
% 0.74/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.74/1.01
% 0.74/1.01 ============================== end of statistics =====================
% 0.74/1.01
% 0.74/1.01 ============================== end of search =========================
% 0.74/1.01
% 0.74/1.01 THEOREM PROVED
% 0.74/1.01 % SZS status Unsatisfiable
% 0.74/1.01
% 0.74/1.01 Exiting with 1 proof.
% 0.74/1.01
% 0.74/1.01 Process 18656 exit (max_proofs) Tue Jul 5 22:38:54 2022
% 0.74/1.01 Prover9 interrupted
%------------------------------------------------------------------------------