TSTP Solution File: FLD064-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD064-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:29 EDT 2022
% Result : Unsatisfiable 0.51s 0.82s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : FLD064-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Tue Jun 7 03:41:20 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.51/0.82 ============================== Prover9 ===============================
% 0.51/0.82 Prover9 (32) version 2009-11A, November 2009.
% 0.51/0.82 Process 11218 was started by sandbox2 on n032.cluster.edu,
% 0.51/0.82 Tue Jun 7 03:41:20 2022
% 0.51/0.82 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11065_n032.cluster.edu".
% 0.51/0.82 ============================== end of head ===========================
% 0.51/0.82
% 0.51/0.82 ============================== INPUT =================================
% 0.51/0.82
% 0.51/0.82 % Reading from file /tmp/Prover9_11065_n032.cluster.edu
% 0.51/0.82
% 0.51/0.82 set(prolog_style_variables).
% 0.51/0.82 set(auto2).
% 0.51/0.82 % set(auto2) -> set(auto).
% 0.51/0.82 % set(auto) -> set(auto_inference).
% 0.51/0.82 % set(auto) -> set(auto_setup).
% 0.51/0.82 % set(auto_setup) -> set(predicate_elim).
% 0.51/0.82 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/0.82 % set(auto) -> set(auto_limits).
% 0.51/0.82 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/0.82 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/0.82 % set(auto) -> set(auto_denials).
% 0.51/0.82 % set(auto) -> set(auto_process).
% 0.51/0.82 % set(auto2) -> assign(new_constants, 1).
% 0.51/0.82 % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/0.82 % set(auto2) -> assign(max_weight, "200.000").
% 0.51/0.82 % set(auto2) -> assign(max_hours, 1).
% 0.51/0.82 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/0.82 % set(auto2) -> assign(max_seconds, 0).
% 0.51/0.82 % set(auto2) -> assign(max_minutes, 5).
% 0.51/0.82 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/0.82 % set(auto2) -> set(sort_initial_sos).
% 0.51/0.82 % set(auto2) -> assign(sos_limit, -1).
% 0.51/0.82 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/0.82 % set(auto2) -> assign(max_megs, 400).
% 0.51/0.82 % set(auto2) -> assign(stats, some).
% 0.51/0.82 % set(auto2) -> clear(echo_input).
% 0.51/0.82 % set(auto2) -> set(quiet).
% 0.51/0.82 % set(auto2) -> clear(print_initial_clauses).
% 0.51/0.82 % set(auto2) -> clear(print_given).
% 0.51/0.82 assign(lrs_ticks,-1).
% 0.51/0.82 assign(sos_limit,10000).
% 0.51/0.82 assign(order,kbo).
% 0.51/0.82 set(lex_order_vars).
% 0.51/0.82 clear(print_given).
% 0.51/0.82
% 0.51/0.82 % formulas(sos). % not echoed (29 formulas)
% 0.51/0.82
% 0.51/0.82 ============================== end of input ==========================
% 0.51/0.82
% 0.51/0.82 % From the command line: assign(max_seconds, 300).
% 0.51/0.82
% 0.51/0.82 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/0.82
% 0.51/0.82 % Formulas that are not ordinary clauses:
% 0.51/0.82
% 0.51/0.82 ============================== end of process non-clausal formulas ===
% 0.51/0.82
% 0.51/0.82 ============================== PROCESS INITIAL CLAUSES ===============
% 0.51/0.82
% 0.51/0.82 ============================== PREDICATE ELIMINATION =================
% 0.51/0.82
% 0.51/0.82 ============================== end predicate elimination =============
% 0.51/0.82
% 0.51/0.82 Auto_denials: (non-Horn, no changes).
% 0.51/0.82
% 0.51/0.82 Term ordering decisions:
% 0.51/0.82 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.51/0.82
% 0.51/0.82 ============================== end of process initial clauses ========
% 0.51/0.82
% 0.51/0.82 ============================== CLAUSES FOR SEARCH ====================
% 0.51/0.82
% 0.51/0.82 ============================== end of clauses for search =============
% 0.51/0.82
% 0.51/0.82 ============================== SEARCH ================================
% 0.51/0.82
% 0.51/0.82 % Starting search at 0.01 seconds.
% 0.51/0.82
% 0.51/0.82 ============================== PROOF =================================
% 0.51/0.82 % SZS status Unsatisfiable
% 0.51/0.82 % SZS output start Refutation
% 0.51/0.82
% 0.51/0.82 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.51/0.82 % Length of proof is 13.
% 0.51/0.82 % Level of proof is 3.
% 0.51/0.82 % Maximum clause weight is 14.000.
% 0.51/0.82 % Given clauses 133.
% 0.51/0.82
% 0.51/0.82 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.51/0.82 4 less_or_equal(additive_identity,a) # label(less_or_equal_2) # label(negated_conjecture). [assumption].
% 0.51/0.82 6 -less_or_equal(additive_inverse(a),additive_identity) # label(not_less_or_equal_3) # label(negated_conjecture). [assumption].
% 0.51/0.82 7 defined(additive_inverse(A)) | -defined(A) # label(well_definedness_of_additive_inverse) # label(axiom). [assumption].
% 0.51/0.82 8 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.51/0.82 10 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.51/0.82 11 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.51/0.82 23 less_or_equal(A,B) | -less_or_equal(C,D) | -sum(C,E,A) | -sum(D,E,B) # label(compatibility_of_order_relation_and_addition) # label(axiom). [assumption].
% 0.51/0.82 53 defined(additive_inverse(a)). [resolve(7,b,3,a)].
% 0.51/0.82 62 sum(additive_inverse(a),a,additive_identity). [resolve(10,b,3,a)].
% 0.51/0.82 133 sum(additive_identity,additive_inverse(a),additive_inverse(a)). [resolve(53,a,8,b)].
% 0.51/0.82 357 sum(a,additive_inverse(a),additive_identity). [resolve(62,a,11,b)].
% 0.51/0.82 1039 $F. [ur(23,a,6,a,b,4,a,d,357,a),unit_del(a,133)].
% 0.51/0.82
% 0.51/0.82 % SZS output end Refutation
% 0.51/0.82 ============================== end of proof ==========================
% 0.51/0.82
% 0.51/0.82 ============================== STATISTICS ============================
% 0.51/0.82
% 0.51/0.82 Given=133. Generated=1681. Kept=1038. proofs=1.
% 0.51/0.82 Usable=130. Sos=882. Demods=0. Limbo=14, Disabled=41. Hints=0.
% 0.51/0.82 Megabytes=0.69.
% 0.51/0.82 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.51/0.82
% 0.51/0.82 ============================== end of statistics =====================
% 0.51/0.82
% 0.51/0.82 ============================== end of search =========================
% 0.51/0.82
% 0.51/0.82 THEOREM PROVED
% 0.51/0.82 % SZS status Unsatisfiable
% 0.51/0.82
% 0.51/0.82 Exiting with 1 proof.
% 0.51/0.82
% 0.51/0.82 Process 11218 exit (max_proofs) Tue Jun 7 03:41:20 2022
% 0.51/0.82 Prover9 interrupted
%------------------------------------------------------------------------------