TSTP Solution File: FLD001-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD001-3 : 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:05 EDT 2022
% Result : Unsatisfiable 0.71s 1.03s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD001-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/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 14:30:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.03 ============================== Prover9 ===============================
% 0.71/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.03 Process 15868 was started by sandbox2 on n019.cluster.edu,
% 0.71/1.03 Mon Jun 6 14:30:26 2022
% 0.71/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15715_n019.cluster.edu".
% 0.71/1.03 ============================== end of head ===========================
% 0.71/1.03
% 0.71/1.03 ============================== INPUT =================================
% 0.71/1.03
% 0.71/1.03 % Reading from file /tmp/Prover9_15715_n019.cluster.edu
% 0.71/1.03
% 0.71/1.03 set(prolog_style_variables).
% 0.71/1.03 set(auto2).
% 0.71/1.03 % set(auto2) -> set(auto).
% 0.71/1.03 % set(auto) -> set(auto_inference).
% 0.71/1.03 % set(auto) -> set(auto_setup).
% 0.71/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.03 % set(auto) -> set(auto_limits).
% 0.71/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.03 % set(auto) -> set(auto_denials).
% 0.71/1.03 % set(auto) -> set(auto_process).
% 0.71/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.03 % set(auto2) -> assign(stats, some).
% 0.71/1.03 % set(auto2) -> clear(echo_input).
% 0.71/1.03 % set(auto2) -> set(quiet).
% 0.71/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.03 % set(auto2) -> clear(print_given).
% 0.71/1.03 assign(lrs_ticks,-1).
% 0.71/1.03 assign(sos_limit,10000).
% 0.71/1.03 assign(order,kbo).
% 0.71/1.03 set(lex_order_vars).
% 0.71/1.03 clear(print_given).
% 0.71/1.03
% 0.71/1.03 % formulas(sos). % not echoed (30 formulas)
% 0.71/1.03
% 0.71/1.03 ============================== end of input ==========================
% 0.71/1.03
% 0.71/1.03 % From the command line: assign(max_seconds, 300).
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.03
% 0.71/1.03 % Formulas that are not ordinary clauses:
% 0.71/1.03
% 0.71/1.03 ============================== end of process non-clausal formulas ===
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.03
% 0.71/1.03 ============================== PREDICATE ELIMINATION =================
% 0.71/1.03
% 0.71/1.03 ============================== end predicate elimination =============
% 0.71/1.03
% 0.71/1.03 Auto_denials: (non-Horn, no changes).
% 0.71/1.03
% 0.71/1.03 Term ordering decisions:
% 0.71/1.03 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.71/1.03
% 0.71/1.03 ============================== end of process initial clauses ========
% 0.71/1.03
% 0.71/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.03
% 0.71/1.03 ============================== end of clauses for search =============
% 0.71/1.03
% 0.71/1.03 ============================== SEARCH ================================
% 0.71/1.03
% 0.71/1.03 % Starting search at 0.01 seconds.
% 0.71/1.03
% 0.71/1.03 ============================== PROOF =================================
% 0.71/1.03 % SZS status Unsatisfiable
% 0.71/1.03 % SZS output start Refutation
% 0.71/1.03
% 0.71/1.03 % Proof 1 at 0.07 (+ 0.01) seconds.
% 0.71/1.03 % Length of proof is 21.
% 0.71/1.03 % Level of proof is 4.
% 0.71/1.03 % Maximum clause weight is 20.000.
% 0.71/1.03 % Given clauses 114.
% 0.71/1.03
% 0.71/1.03 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 0.71/1.03 2 defined(multiplicative_identity) # label(well_definedness_of_multiplicative_identity) # label(axiom). [assumption].
% 0.71/1.03 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.71/1.03 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 0.71/1.03 5 sum(additive_identity,a,b) # label(sum_3) # label(hypothesis). [assumption].
% 0.71/1.03 7 -product(multiplicative_identity,a,b) # label(not_product_4) # label(negated_conjecture). [assumption].
% 0.71/1.03 9 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.71/1.03 10 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.71/1.03 13 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 0.71/1.03 27 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom). [assumption].
% 0.71/1.03 30 product(A,B,C) | -sum(D,E,A) | -product(D,B,F) | -product(E,B,V6) | -sum(F,V6,C) # label(distributivity_2) # label(axiom). [assumption].
% 0.71/1.03 59 sum(additive_identity,a,a). [resolve(9,b,3,a)].
% 0.71/1.03 62 product(multiplicative_identity,b,b). [resolve(10,b,4,a)].
% 0.71/1.03 63 product(multiplicative_identity,a,a). [resolve(10,b,3,a)].
% 0.71/1.03 64 product(multiplicative_identity,multiplicative_identity,multiplicative_identity). [resolve(10,b,2,a)].
% 0.71/1.03 65 product(multiplicative_identity,additive_identity,additive_identity). [resolve(10,b,1,a)].
% 0.71/1.03 339 product(a,multiplicative_identity,a). [resolve(63,a,13,b)].
% 0.71/1.03 366 -product(multiplicative_identity,b,a). [ur(27,a,7,a,b,64,a,d,62,a)].
% 0.71/1.03 369 -product(b,multiplicative_identity,a). [ur(13,a,366,a)].
% 0.71/1.03 391 product(additive_identity,multiplicative_identity,additive_identity). [resolve(65,a,13,b)].
% 0.71/1.03 837 $F. [ur(30,a,369,a,b,5,a,d,339,a,e,59,a),unit_del(a,391)].
% 0.71/1.03
% 0.71/1.03 % SZS output end Refutation
% 0.71/1.03 ============================== end of proof ==========================
% 0.71/1.03
% 0.71/1.03 ============================== STATISTICS ============================
% 0.71/1.03
% 0.71/1.03 Given=114. Generated=1310. Kept=836. proofs=1.
% 0.71/1.03 Usable=113. Sos=688. Demods=0. Limbo=24, Disabled=41. Hints=0.
% 0.71/1.03 Megabytes=0.58.
% 0.71/1.03 User_CPU=0.07, System_CPU=0.01, Wall_clock=0.
% 0.71/1.03
% 0.71/1.03 ============================== end of statistics =====================
% 0.71/1.03
% 0.71/1.03 ============================== end of search =========================
% 0.71/1.03
% 0.71/1.03 THEOREM PROVED
% 0.71/1.03 % SZS status Unsatisfiable
% 0.71/1.03
% 0.71/1.03 Exiting with 1 proof.
% 0.71/1.03
% 0.71/1.03 Process 15868 exit (max_proofs) Mon Jun 6 14:30:26 2022
% 0.71/1.04 Prover9 interrupted
%------------------------------------------------------------------------------