TSTP Solution File: FLD005-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD005-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 : Sat Jul 16 02:24:06 EDT 2022
% Result : Unsatisfiable 0.81s 1.11s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : FLD005-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 6 11:17:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.81/1.11 ============================== Prover9 ===============================
% 0.81/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.11 Process 2237 was started by sandbox2 on n024.cluster.edu,
% 0.81/1.11 Mon Jun 6 11:17:20 2022
% 0.81/1.11 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2076_n024.cluster.edu".
% 0.81/1.11 ============================== end of head ===========================
% 0.81/1.11
% 0.81/1.11 ============================== INPUT =================================
% 0.81/1.11
% 0.81/1.11 % Reading from file /tmp/Prover9_2076_n024.cluster.edu
% 0.81/1.11
% 0.81/1.11 set(prolog_style_variables).
% 0.81/1.11 set(auto2).
% 0.81/1.11 % set(auto2) -> set(auto).
% 0.81/1.11 % set(auto) -> set(auto_inference).
% 0.81/1.11 % set(auto) -> set(auto_setup).
% 0.81/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.11 % set(auto) -> set(auto_limits).
% 0.81/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.11 % set(auto) -> set(auto_denials).
% 0.81/1.11 % set(auto) -> set(auto_process).
% 0.81/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.11 % set(auto2) -> assign(stats, some).
% 0.81/1.11 % set(auto2) -> clear(echo_input).
% 0.81/1.11 % set(auto2) -> set(quiet).
% 0.81/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.11 % set(auto2) -> clear(print_given).
% 0.81/1.11 assign(lrs_ticks,-1).
% 0.81/1.11 assign(sos_limit,10000).
% 0.81/1.11 assign(order,kbo).
% 0.81/1.11 set(lex_order_vars).
% 0.81/1.11 clear(print_given).
% 0.81/1.11
% 0.81/1.11 % formulas(sos). % not echoed (29 formulas)
% 0.81/1.11
% 0.81/1.11 ============================== end of input ==========================
% 0.81/1.11
% 0.81/1.11 % From the command line: assign(max_seconds, 300).
% 0.81/1.11
% 0.81/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.11
% 0.81/1.11 % Formulas that are not ordinary clauses:
% 0.81/1.11
% 0.81/1.11 ============================== end of process non-clausal formulas ===
% 0.81/1.11
% 0.81/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.11
% 0.81/1.11 ============================== PREDICATE ELIMINATION =================
% 0.81/1.11
% 0.81/1.11 ============================== end predicate elimination =============
% 0.81/1.11
% 0.81/1.11 Auto_denials: (non-Horn, no changes).
% 0.81/1.11
% 0.81/1.11 Term ordering decisions:
% 0.81/1.11 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. b=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.81/1.11
% 0.81/1.11 ============================== end of process initial clauses ========
% 0.81/1.11
% 0.81/1.11 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.11
% 0.81/1.11 ============================== end of clauses for search =============
% 0.81/1.11
% 0.81/1.11 ============================== SEARCH ================================
% 0.81/1.11
% 0.81/1.11 % Starting search at 0.01 seconds.
% 0.81/1.11
% 0.81/1.11 ============================== PROOF =================================
% 0.81/1.11 % SZS status Unsatisfiable
% 0.81/1.11 % SZS output start Refutation
% 0.81/1.11
% 0.81/1.11 % Proof 1 at 0.15 (+ 0.01) seconds.
% 0.81/1.11 % Length of proof is 16.
% 0.81/1.11 % Level of proof is 4.
% 0.81/1.11 % Maximum clause weight is 16.000.
% 0.81/1.11 % Given clauses 202.
% 0.81/1.11
% 0.81/1.11 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.81/1.11 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 0.81/1.11 6 -sum(a,A,b) # label(not_sum_3) # label(negated_conjecture). [assumption].
% 0.81/1.11 7 defined(additive_inverse(A)) | -defined(A) # label(well_definedness_of_additive_inverse) # label(axiom). [assumption].
% 0.81/1.11 8 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.81/1.11 10 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.81/1.11 11 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.81/1.11 17 sum(A,B,add(A,B)) | -defined(A) | -defined(B) # label(totality_of_addition) # label(axiom). [assumption].
% 0.81/1.11 25 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 0.81/1.11 54 defined(additive_inverse(a)). [resolve(7,b,3,a)].
% 0.81/1.11 57 sum(additive_identity,b,b). [resolve(8,b,4,a)].
% 0.81/1.11 66 sum(additive_inverse(a),a,additive_identity). [resolve(10,b,3,a)].
% 0.81/1.11 69 -sum(A,a,b). [ur(11,a,6,a)].
% 0.81/1.11 223 sum(b,additive_identity,b). [resolve(57,a,11,b)].
% 0.81/1.11 726 -sum(b,additive_inverse(a),A). [ur(25,a,69,a,c,66,a,d,223,a)].
% 0.81/1.11 2110 $F. [ur(17,a,726,a,c,54,a),unit_del(a,4)].
% 0.81/1.11
% 0.81/1.11 % SZS output end Refutation
% 0.81/1.11 ============================== end of proof ==========================
% 0.81/1.11
% 0.81/1.11 ============================== STATISTICS ============================
% 0.81/1.11
% 0.81/1.11 Given=202. Generated=3655. Kept=2109. proofs=1.
% 0.81/1.11 Usable=193. Sos=1878. Demods=0. Limbo=7, Disabled=60. Hints=0.
% 0.81/1.11 Megabytes=1.24.
% 0.81/1.11 User_CPU=0.15, System_CPU=0.01, Wall_clock=0.
% 0.81/1.11
% 0.81/1.11 ============================== end of statistics =====================
% 0.81/1.11
% 0.81/1.11 ============================== end of search =========================
% 0.81/1.11
% 0.81/1.11 THEOREM PROVED
% 0.81/1.11 % SZS status Unsatisfiable
% 0.81/1.11
% 0.81/1.11 Exiting with 1 proof.
% 0.81/1.11
% 0.81/1.11 Process 2237 exit (max_proofs) Mon Jun 6 11:17:20 2022
% 0.81/1.11 Prover9 interrupted
%------------------------------------------------------------------------------