TSTP Solution File: FLD013-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD013-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:09 EDT 2022
% Result : Unsatisfiable 0.79s 1.07s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : FLD013-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.08/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 6 18:37:01 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.79/1.07 ============================== Prover9 ===============================
% 0.79/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.07 Process 4431 was started by sandbox2 on n017.cluster.edu,
% 0.79/1.07 Mon Jun 6 18:37:02 2022
% 0.79/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4278_n017.cluster.edu".
% 0.79/1.07 ============================== end of head ===========================
% 0.79/1.07
% 0.79/1.07 ============================== INPUT =================================
% 0.79/1.07
% 0.79/1.07 % Reading from file /tmp/Prover9_4278_n017.cluster.edu
% 0.79/1.07
% 0.79/1.07 set(prolog_style_variables).
% 0.79/1.07 set(auto2).
% 0.79/1.07 % set(auto2) -> set(auto).
% 0.79/1.07 % set(auto) -> set(auto_inference).
% 0.79/1.07 % set(auto) -> set(auto_setup).
% 0.79/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.07 % set(auto) -> set(auto_limits).
% 0.79/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.07 % set(auto) -> set(auto_denials).
% 0.79/1.07 % set(auto) -> set(auto_process).
% 0.79/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.07 % set(auto2) -> assign(stats, some).
% 0.79/1.07 % set(auto2) -> clear(echo_input).
% 0.79/1.07 % set(auto2) -> set(quiet).
% 0.79/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.07 % set(auto2) -> clear(print_given).
% 0.79/1.07 assign(lrs_ticks,-1).
% 0.79/1.07 assign(sos_limit,10000).
% 0.79/1.07 assign(order,kbo).
% 0.79/1.07 set(lex_order_vars).
% 0.79/1.07 clear(print_given).
% 0.79/1.07
% 0.79/1.07 % formulas(sos). % not echoed (35 formulas)
% 0.79/1.07
% 0.79/1.07 ============================== end of input ==========================
% 0.79/1.07
% 0.79/1.07 % From the command line: assign(max_seconds, 300).
% 0.79/1.07
% 0.79/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.07
% 0.79/1.07 % Formulas that are not ordinary clauses:
% 0.79/1.07
% 0.79/1.07 ============================== end of process non-clausal formulas ===
% 0.79/1.07
% 0.79/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.79/1.07
% 0.79/1.07 ============================== PREDICATE ELIMINATION =================
% 0.79/1.07
% 0.79/1.07 ============================== end predicate elimination =============
% 0.79/1.07
% 0.79/1.07 Auto_denials: (non-Horn, no changes).
% 0.79/1.07
% 0.79/1.07 Term ordering decisions:
% 0.79/1.07 Function symbol KB weights: additive_identity=1. a=1. c=1. multiplicative_identity=1. b=1. d=1. u=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.79/1.07
% 0.79/1.07 ============================== end of process initial clauses ========
% 0.79/1.07
% 0.79/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.79/1.07
% 0.79/1.07 ============================== end of clauses for search =============
% 0.79/1.07
% 0.79/1.07 ============================== SEARCH ================================
% 0.79/1.07
% 0.79/1.07 % Starting search at 0.01 seconds.
% 0.79/1.07
% 0.79/1.07 ============================== PROOF =================================
% 0.79/1.07 % SZS status Unsatisfiable
% 0.79/1.07 % SZS output start Refutation
% 0.79/1.07
% 0.79/1.07 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.79/1.07 % Length of proof is 16.
% 0.79/1.07 % Level of proof is 4.
% 0.79/1.07 % Maximum clause weight is 16.000.
% 0.79/1.07 % Given clauses 75.
% 0.79/1.07
% 0.79/1.07 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.79/1.07 7 defined(u) # label(u_is_defined) # label(hypothesis). [assumption].
% 0.79/1.07 8 sum(additive_identity,a,b) # label(sum_6) # label(negated_conjecture). [assumption].
% 0.79/1.07 9 sum(additive_identity,c,d) # label(sum_7) # label(negated_conjecture). [assumption].
% 0.79/1.07 10 sum(a,c,u) # label(sum_8) # label(negated_conjecture). [assumption].
% 0.79/1.07 12 -sum(d,b,u) # label(not_sum_9) # label(negated_conjecture). [assumption].
% 0.79/1.07 14 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.79/1.07 17 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.79/1.07 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.79/1.07 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.79/1.07 66 sum(additive_identity,u,u). [resolve(14,b,7,a)].
% 0.79/1.07 70 sum(additive_identity,a,a). [resolve(14,b,3,a)].
% 0.79/1.07 90 -sum(b,d,u). [ur(17,a,12,a)].
% 0.79/1.07 385 -sum(a,d,u). [ur(31,a,90,a,b,8,a,d,66,a)].
% 0.79/1.07 387 -sum(a,additive_identity,a). [ur(30,a,385,a,c,9,a,d,10,a)].
% 0.79/1.07 390 $F. [ur(17,a,387,a),unit_del(a,70)].
% 0.79/1.07
% 0.79/1.07 % SZS output end Refutation
% 0.79/1.07 ============================== end of proof ==========================
% 0.79/1.07
% 0.79/1.07 ============================== STATISTICS ============================
% 0.79/1.07
% 0.79/1.07 Given=75. Generated=469. Kept=389. proofs=1.
% 0.79/1.07 Usable=75. Sos=314. Demods=0. Limbo=0, Disabled=35. Hints=0.
% 0.79/1.07 Megabytes=0.29.
% 0.79/1.07 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.79/1.07
% 0.79/1.07 ============================== end of statistics =====================
% 0.79/1.07
% 0.79/1.07 ============================== end of search =========================
% 0.79/1.07
% 0.79/1.07 THEOREM PROVED
% 0.79/1.07 % SZS status Unsatisfiable
% 0.79/1.07
% 0.79/1.07 Exiting with 1 proof.
% 0.79/1.07
% 0.79/1.07 Process 4431 exit (max_proofs) Mon Jun 6 18:37:02 2022
% 0.79/1.07 Prover9 interrupted
%------------------------------------------------------------------------------