TSTP Solution File: FLD023-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD023-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:13 EDT 2022
% Result : Unsatisfiable 0.70s 1.11s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : FLD023-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.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 22:00:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.11 ============================== Prover9 ===============================
% 0.70/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.11 Process 3166 was started by sandbox on n019.cluster.edu,
% 0.70/1.11 Mon Jun 6 22:00:25 2022
% 0.70/1.11 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3013_n019.cluster.edu".
% 0.70/1.11 ============================== end of head ===========================
% 0.70/1.11
% 0.70/1.11 ============================== INPUT =================================
% 0.70/1.11
% 0.70/1.11 % Reading from file /tmp/Prover9_3013_n019.cluster.edu
% 0.70/1.11
% 0.70/1.11 set(prolog_style_variables).
% 0.70/1.11 set(auto2).
% 0.70/1.11 % set(auto2) -> set(auto).
% 0.70/1.11 % set(auto) -> set(auto_inference).
% 0.70/1.11 % set(auto) -> set(auto_setup).
% 0.70/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.11 % set(auto) -> set(auto_limits).
% 0.70/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.11 % set(auto) -> set(auto_denials).
% 0.70/1.11 % set(auto) -> set(auto_process).
% 0.70/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.11 % set(auto2) -> assign(stats, some).
% 0.70/1.11 % set(auto2) -> clear(echo_input).
% 0.70/1.11 % set(auto2) -> set(quiet).
% 0.70/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.11 % set(auto2) -> clear(print_given).
% 0.70/1.11 assign(lrs_ticks,-1).
% 0.70/1.11 assign(sos_limit,10000).
% 0.70/1.11 assign(order,kbo).
% 0.70/1.11 set(lex_order_vars).
% 0.70/1.11 clear(print_given).
% 0.70/1.11
% 0.70/1.11 % formulas(sos). % not echoed (31 formulas)
% 0.70/1.11
% 0.70/1.11 ============================== end of input ==========================
% 0.70/1.11
% 0.70/1.11 % From the command line: assign(max_seconds, 300).
% 0.70/1.11
% 0.70/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.11
% 0.70/1.11 % Formulas that are not ordinary clauses:
% 0.70/1.11
% 0.70/1.11 ============================== end of process non-clausal formulas ===
% 0.70/1.11
% 0.70/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.11
% 0.70/1.11 ============================== PREDICATE ELIMINATION =================
% 0.70/1.11
% 0.70/1.11 ============================== end predicate elimination =============
% 0.70/1.11
% 0.70/1.11 Auto_denials: (non-Horn, no changes).
% 0.70/1.11
% 0.70/1.11 Term ordering decisions:
% 0.70/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.70/1.11
% 0.70/1.11 ============================== end of process initial clauses ========
% 0.70/1.11
% 0.70/1.11 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.11
% 0.70/1.11 ============================== end of clauses for search =============
% 0.70/1.11
% 0.70/1.11 ============================== SEARCH ================================
% 0.70/1.11
% 0.70/1.11 % Starting search at 0.01 seconds.
% 0.70/1.11
% 0.70/1.11 ============================== PROOF =================================
% 0.70/1.11 % SZS status Unsatisfiable
% 0.70/1.11 % SZS output start Refutation
% 0.70/1.11
% 0.70/1.11 % Proof 1 at 0.16 (+ 0.01) seconds.
% 0.70/1.11 % Length of proof is 14.
% 0.70/1.11 % Level of proof is 3.
% 0.70/1.11 % Maximum clause weight is 12.000.
% 0.70/1.11 % Given clauses 179.
% 0.70/1.11
% 0.70/1.11 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.70/1.11 5 equalish(a,b) # label(a_equals_b_3) # label(negated_conjecture). [assumption].
% 0.70/1.11 7 -equalish(additive_identity,add(b,additive_inverse(a))) # label(additive_identity_not_equal_to_add_4) # label(negated_conjecture). [assumption].
% 0.70/1.11 8 defined(additive_inverse(A)) | -defined(A) # label(well_definedness_of_additive_inverse) # label(axiom). [assumption].
% 0.70/1.11 10 equalish(A,B) | -equalish(B,A) # label(symmetry_of_equality) # label(axiom). [assumption].
% 0.70/1.11 13 equalish(add(A,additive_inverse(A)),additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.70/1.11 19 equalish(A,B) | -equalish(A,C) | -equalish(C,B) # label(transitivity_of_equality) # label(axiom). [assumption].
% 0.70/1.11 27 equalish(add(A,B),add(C,B)) | -defined(B) | -equalish(A,C) # label(compatibility_of_equality_and_addition) # label(axiom). [assumption].
% 0.70/1.11 52 defined(additive_inverse(a)). [resolve(8,b,3,a)].
% 0.70/1.11 59 equalish(b,a). [resolve(10,b,5,a)].
% 0.70/1.11 60 -equalish(add(b,additive_inverse(a)),additive_identity). [ur(10,a,7,a)].
% 0.70/1.11 71 equalish(add(a,additive_inverse(a)),additive_identity). [resolve(13,b,3,a)].
% 0.70/1.11 1277 -equalish(add(b,additive_inverse(a)),add(a,additive_inverse(a))). [ur(19,a,60,a,c,71,a)].
% 0.70/1.11 2664 $F. [ur(27,a,1277,a,c,59,a),unit_del(a,52)].
% 0.70/1.11
% 0.70/1.11 % SZS output end Refutation
% 0.70/1.11 ============================== end of proof ==========================
% 0.70/1.11
% 0.70/1.11 ============================== STATISTICS ============================
% 0.70/1.11
% 0.70/1.11 Given=179. Generated=3361. Kept=2663. proofs=1.
% 0.70/1.11 Usable=179. Sos=2482. Demods=0. Limbo=0, Disabled=33. Hints=0.
% 0.70/1.11 Megabytes=2.20.
% 0.70/1.11 User_CPU=0.16, System_CPU=0.01, Wall_clock=1.
% 0.70/1.11
% 0.70/1.11 ============================== end of statistics =====================
% 0.70/1.11
% 0.70/1.11 ============================== end of search =========================
% 0.70/1.11
% 0.70/1.11 THEOREM PROVED
% 0.70/1.11 % SZS status Unsatisfiable
% 0.70/1.11
% 0.70/1.11 Exiting with 1 proof.
% 0.70/1.11
% 0.70/1.11 Process 3166 exit (max_proofs) Mon Jun 6 22:00:26 2022
% 0.70/1.11 Prover9 interrupted
%------------------------------------------------------------------------------