TSTP Solution File: FLD016-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD016-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:11 EDT 2022
% Result : Unsatisfiable 0.80s 1.14s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD016-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.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 : Mon Jun 6 17:36:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.80/1.14 ============================== Prover9 ===============================
% 0.80/1.14 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.14 Process 8921 was started by sandbox2 on n028.cluster.edu,
% 0.80/1.14 Mon Jun 6 17:36:59 2022
% 0.80/1.14 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8768_n028.cluster.edu".
% 0.80/1.14 ============================== end of head ===========================
% 0.80/1.14
% 0.80/1.14 ============================== INPUT =================================
% 0.80/1.14
% 0.80/1.14 % Reading from file /tmp/Prover9_8768_n028.cluster.edu
% 0.80/1.14
% 0.80/1.14 set(prolog_style_variables).
% 0.80/1.14 set(auto2).
% 0.80/1.14 % set(auto2) -> set(auto).
% 0.80/1.14 % set(auto) -> set(auto_inference).
% 0.80/1.14 % set(auto) -> set(auto_setup).
% 0.80/1.14 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.14 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.14 % set(auto) -> set(auto_limits).
% 0.80/1.14 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.14 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.14 % set(auto) -> set(auto_denials).
% 0.80/1.14 % set(auto) -> set(auto_process).
% 0.80/1.14 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.14 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.14 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.14 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.14 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.14 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.14 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.14 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.14 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.14 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.14 % set(auto2) -> assign(stats, some).
% 0.80/1.14 % set(auto2) -> clear(echo_input).
% 0.80/1.14 % set(auto2) -> set(quiet).
% 0.80/1.14 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.14 % set(auto2) -> clear(print_given).
% 0.80/1.14 assign(lrs_ticks,-1).
% 0.80/1.14 assign(sos_limit,10000).
% 0.80/1.14 assign(order,kbo).
% 0.80/1.14 set(lex_order_vars).
% 0.80/1.14 clear(print_given).
% 0.80/1.14
% 0.80/1.14 % formulas(sos). % not echoed (35 formulas)
% 0.80/1.14
% 0.80/1.14 ============================== end of input ==========================
% 0.80/1.14
% 0.80/1.14 % From the command line: assign(max_seconds, 300).
% 0.80/1.14
% 0.80/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.14
% 0.80/1.14 % Formulas that are not ordinary clauses:
% 0.80/1.14
% 0.80/1.14 ============================== end of process non-clausal formulas ===
% 0.80/1.14
% 0.80/1.14 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.14
% 0.80/1.14 ============================== PREDICATE ELIMINATION =================
% 0.80/1.14
% 0.80/1.14 ============================== end predicate elimination =============
% 0.80/1.14
% 0.80/1.14 Auto_denials: (non-Horn, no changes).
% 0.80/1.14
% 0.80/1.14 Term ordering decisions:
% 0.80/1.14 Function symbol KB weights: additive_identity=1. a=1. multiplicative_identity=1. q=1. r=1. u=1. v=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.80/1.14
% 0.80/1.14 ============================== end of process initial clauses ========
% 0.80/1.14
% 0.80/1.14 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.14
% 0.80/1.14 ============================== end of clauses for search =============
% 0.80/1.14
% 0.80/1.14 ============================== SEARCH ================================
% 0.80/1.14
% 0.80/1.14 % Starting search at 0.01 seconds.
% 0.80/1.14
% 0.80/1.14 ============================== PROOF =================================
% 0.80/1.14 % SZS status Unsatisfiable
% 0.80/1.14 % SZS output start Refutation
% 0.80/1.14
% 0.80/1.14 % Proof 1 at 0.14 (+ 0.01) seconds.
% 0.80/1.14 % Length of proof is 21.
% 0.80/1.14 % Level of proof is 5.
% 0.80/1.14 % Maximum clause weight is 16.000.
% 0.80/1.14 % Given clauses 194.
% 0.80/1.14
% 0.80/1.14 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 0.80/1.14 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.80/1.14 4 defined(u) # label(u_is_defined) # label(hypothesis). [assumption].
% 0.80/1.14 5 defined(v) # label(v_is_defined) # label(hypothesis). [assumption].
% 0.80/1.14 8 sum(a,u,q) # label(sum_6) # label(negated_conjecture). [assumption].
% 0.80/1.14 9 sum(a,v,r) # label(sum_7) # label(negated_conjecture). [assumption].
% 0.80/1.14 10 sum(additive_identity,q,r) # label(sum_8) # label(negated_conjecture). [assumption].
% 0.80/1.14 12 -sum(additive_identity,u,v) # label(not_sum_9) # label(negated_conjecture). [assumption].
% 0.80/1.14 14 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.80/1.14 16 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.80/1.14 30 sum(A,B,C) | -sum(A,D,E) | -sum(D,F,B) | -sum(E,F,C) # label(associativity_addition_1) # label(axiom). [assumption].
% 0.80/1.14 31 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 0.80/1.14 68 sum(additive_identity,v,v). [resolve(14,b,5,a)].
% 0.80/1.14 69 sum(additive_identity,u,u). [resolve(14,b,4,a)].
% 0.80/1.14 70 sum(additive_identity,a,a). [resolve(14,b,3,a)].
% 0.80/1.14 72 sum(additive_identity,additive_identity,additive_identity). [resolve(14,b,1,a)].
% 0.80/1.14 84 sum(additive_inverse(a),a,additive_identity). [resolve(16,b,3,a)].
% 0.80/1.14 454 -sum(additive_identity,v,u). [ur(30,a,12,a,b,72,a,d,68,a)].
% 0.80/1.14 1041 -sum(additive_inverse(a),r,u). [ur(31,a,454,a,b,84,a,c,9,a)].
% 0.80/1.14 1741 -sum(a,u,r). [ur(30,a,1041,a,b,84,a,d,69,a)].
% 0.80/1.14 1886 $F. [ur(31,a,1741,a,c,8,a,d,10,a),unit_del(a,70)].
% 0.80/1.14
% 0.80/1.14 % SZS output end Refutation
% 0.80/1.14 ============================== end of proof ==========================
% 0.80/1.14
% 0.80/1.14 ============================== STATISTICS ============================
% 0.80/1.14
% 0.80/1.14 Given=194. Generated=2919. Kept=1885. proofs=1.
% 0.80/1.14 Usable=183. Sos=1677. Demods=0. Limbo=3, Disabled=57. Hints=0.
% 0.80/1.14 Megabytes=1.21.
% 0.80/1.14 User_CPU=0.15, System_CPU=0.01, Wall_clock=0.
% 0.80/1.14
% 0.80/1.14 ============================== end of statistics =====================
% 0.80/1.14
% 0.80/1.14 ============================== end of search =========================
% 0.80/1.14
% 0.80/1.14 THEOREM PROVED
% 0.80/1.14 % SZS status Unsatisfiable
% 0.80/1.14
% 0.80/1.14 Exiting with 1 proof.
% 0.80/1.14
% 0.80/1.14 Process 8921 exit (max_proofs) Mon Jun 6 17:36:59 2022
% 0.80/1.14 Prover9 interrupted
%------------------------------------------------------------------------------