TSTP Solution File: FLD013-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD013-5 : 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:10 EDT 2022
% Result : Unsatisfiable 0.66s 0.93s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : FLD013-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.12/0.13 % 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.34 % DateTime : Mon Jun 6 23:44:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.66/0.93 ============================== Prover9 ===============================
% 0.66/0.93 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.93 Process 8620 was started by sandbox on n024.cluster.edu,
% 0.66/0.93 Mon Jun 6 23:44:50 2022
% 0.66/0.93 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8466_n024.cluster.edu".
% 0.66/0.93 ============================== end of head ===========================
% 0.66/0.93
% 0.66/0.93 ============================== INPUT =================================
% 0.66/0.93
% 0.66/0.93 % Reading from file /tmp/Prover9_8466_n024.cluster.edu
% 0.66/0.93
% 0.66/0.93 set(prolog_style_variables).
% 0.66/0.93 set(auto2).
% 0.66/0.93 % set(auto2) -> set(auto).
% 0.66/0.93 % set(auto) -> set(auto_inference).
% 0.66/0.93 % set(auto) -> set(auto_setup).
% 0.66/0.93 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.93 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.93 % set(auto) -> set(auto_limits).
% 0.66/0.93 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.93 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.93 % set(auto) -> set(auto_denials).
% 0.66/0.93 % set(auto) -> set(auto_process).
% 0.66/0.93 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.93 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.93 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.93 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.93 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.93 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.93 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.93 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.93 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.93 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.93 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.93 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.93 % set(auto2) -> assign(stats, some).
% 0.66/0.93 % set(auto2) -> clear(echo_input).
% 0.66/0.93 % set(auto2) -> set(quiet).
% 0.66/0.93 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.93 % set(auto2) -> clear(print_given).
% 0.66/0.93 assign(lrs_ticks,-1).
% 0.66/0.93 assign(sos_limit,10000).
% 0.66/0.93 assign(order,kbo).
% 0.66/0.93 set(lex_order_vars).
% 0.66/0.93 clear(print_given).
% 0.66/0.93
% 0.66/0.93 % formulas(sos). % not echoed (37 formulas)
% 0.66/0.93
% 0.66/0.93 ============================== end of input ==========================
% 0.66/0.93
% 0.66/0.93 % From the command line: assign(max_seconds, 300).
% 0.66/0.93
% 0.66/0.93 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.93
% 0.66/0.93 % Formulas that are not ordinary clauses:
% 0.66/0.93
% 0.66/0.93 ============================== end of process non-clausal formulas ===
% 0.66/0.93
% 0.66/0.93 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.93
% 0.66/0.93 ============================== PREDICATE ELIMINATION =================
% 0.66/0.93
% 0.66/0.93 ============================== end predicate elimination =============
% 0.66/0.93
% 0.66/0.93 Auto_denials: (non-Horn, no changes).
% 0.66/0.93
% 0.66/0.93 Term ordering decisions:
% 0.66/0.93 Function symbol KB weights: additive_identity=1. a=1. b=1. c=1. d=1. multiplicative_identity=1. u=1. v=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.66/0.93
% 0.66/0.93 ============================== end of process initial clauses ========
% 0.66/0.93
% 0.66/0.93 ============================== CLAUSES FOR SEARCH ====================
% 0.66/0.93
% 0.66/0.93 ============================== end of clauses for search =============
% 0.66/0.93
% 0.66/0.93 ============================== SEARCH ================================
% 0.66/0.93
% 0.66/0.93 % Starting search at 0.01 seconds.
% 0.66/0.93
% 0.66/0.93 ============================== PROOF =================================
% 0.66/0.93 % SZS status Unsatisfiable
% 0.66/0.93 % SZS output start Refutation
% 0.66/0.93
% 0.66/0.93 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.66/0.93 % Length of proof is 14.
% 0.66/0.93 % Level of proof is 3.
% 0.66/0.93 % Maximum clause weight is 16.000.
% 0.66/0.93 % Given clauses 65.
% 0.66/0.93
% 0.66/0.93 7 defined(u) # label(u_is_defined) # label(hypothesis). [assumption].
% 0.66/0.93 9 sum(additive_identity,a,b) # label(sum_7) # label(negated_conjecture). [assumption].
% 0.66/0.93 10 sum(additive_identity,c,d) # label(sum_8) # label(negated_conjecture). [assumption].
% 0.66/0.93 11 sum(a,c,u) # label(sum_9) # label(negated_conjecture). [assumption].
% 0.66/0.93 12 sum(d,b,v) # label(sum_10) # label(negated_conjecture). [assumption].
% 0.66/0.93 14 -sum(additive_identity,u,v) # label(not_sum_11) # label(negated_conjecture). [assumption].
% 0.66/0.93 16 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.66/0.93 19 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.66/0.93 32 sum(A,B,C) | -sum(A,D,E) | -sum(D,F,B) | -sum(E,F,C) # label(associativity_addition_1) # label(axiom). [assumption].
% 0.66/0.93 33 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 0.66/0.93 70 sum(additive_identity,u,u). [resolve(16,b,7,a)].
% 0.66/0.93 212 -sum(c,b,u). [ur(32,a,14,a,b,10,a,d,12,a)].
% 0.66/0.93 286 -sum(b,c,u). [ur(19,a,212,a)].
% 0.66/0.93 288 $F. [ur(33,a,286,a,b,9,a,c,11,a),unit_del(a,70)].
% 0.66/0.93
% 0.66/0.93 % SZS output end Refutation
% 0.66/0.93 ============================== end of proof ==========================
% 0.66/0.93
% 0.66/0.93 ============================== STATISTICS ============================
% 0.66/0.93
% 0.66/0.93 Given=65. Generated=340. Kept=287. proofs=1.
% 0.66/0.93 Usable=65. Sos=222. Demods=0. Limbo=0, Disabled=37. Hints=0.
% 0.66/0.93 Megabytes=0.23.
% 0.66/0.93 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.66/0.93
% 0.66/0.93 ============================== end of statistics =====================
% 0.66/0.93
% 0.66/0.93 ============================== end of search =========================
% 0.66/0.93
% 0.66/0.93 THEOREM PROVED
% 0.66/0.93 % SZS status Unsatisfiable
% 0.66/0.93
% 0.66/0.93 Exiting with 1 proof.
% 0.66/0.93
% 0.66/0.93 Process 8620 exit (max_proofs) Mon Jun 6 23:44:50 2022
% 0.66/0.93 Prover9 interrupted
%------------------------------------------------------------------------------