TSTP Solution File: FLD010-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD010-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:08 EDT 2022
% Result : Unsatisfiable 0.76s 1.11s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD010-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 6 15:12:43 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.76/1.10 ============================== Prover9 ===============================
% 0.76/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.10 Process 2929 was started by sandbox on n028.cluster.edu,
% 0.76/1.10 Mon Jun 6 15:12:44 2022
% 0.76/1.10 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2776_n028.cluster.edu".
% 0.76/1.10 ============================== end of head ===========================
% 0.76/1.10
% 0.76/1.10 ============================== INPUT =================================
% 0.76/1.10
% 0.76/1.10 % Reading from file /tmp/Prover9_2776_n028.cluster.edu
% 0.76/1.10
% 0.76/1.10 set(prolog_style_variables).
% 0.76/1.10 set(auto2).
% 0.76/1.10 % set(auto2) -> set(auto).
% 0.76/1.10 % set(auto) -> set(auto_inference).
% 0.76/1.10 % set(auto) -> set(auto_setup).
% 0.76/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.10 % set(auto) -> set(auto_limits).
% 0.76/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.10 % set(auto) -> set(auto_denials).
% 0.76/1.10 % set(auto) -> set(auto_process).
% 0.76/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.11 % set(auto2) -> assign(stats, some).
% 0.76/1.11 % set(auto2) -> clear(echo_input).
% 0.76/1.11 % set(auto2) -> set(quiet).
% 0.76/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.11 % set(auto2) -> clear(print_given).
% 0.76/1.11 assign(lrs_ticks,-1).
% 0.76/1.11 assign(sos_limit,10000).
% 0.76/1.11 assign(order,kbo).
% 0.76/1.11 set(lex_order_vars).
% 0.76/1.11 clear(print_given).
% 0.76/1.11
% 0.76/1.11 % formulas(sos). % not echoed (28 formulas)
% 0.76/1.11
% 0.76/1.11 ============================== end of input ==========================
% 0.76/1.11
% 0.76/1.11 % From the command line: assign(max_seconds, 300).
% 0.76/1.11
% 0.76/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.11
% 0.76/1.11 % Formulas that are not ordinary clauses:
% 0.76/1.11
% 0.76/1.11 ============================== end of process non-clausal formulas ===
% 0.76/1.11
% 0.76/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.11
% 0.76/1.11 ============================== PREDICATE ELIMINATION =================
% 0.76/1.11
% 0.76/1.11 ============================== end predicate elimination =============
% 0.76/1.11
% 0.76/1.11 Auto_denials: (non-Horn, no changes).
% 0.76/1.11
% 0.76/1.11 Term ordering decisions:
% 0.76/1.11 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.76/1.11
% 0.76/1.11 ============================== end of process initial clauses ========
% 0.76/1.11
% 0.76/1.11 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.11
% 0.76/1.11 ============================== end of clauses for search =============
% 0.76/1.11
% 0.76/1.11 ============================== SEARCH ================================
% 0.76/1.11
% 0.76/1.11 % Starting search at 0.01 seconds.
% 0.76/1.11
% 0.76/1.11 ============================== PROOF =================================
% 0.76/1.11 % SZS status Unsatisfiable
% 0.76/1.11 % SZS output start Refutation
% 0.76/1.11
% 0.76/1.11 % Proof 1 at 0.09 (+ 0.00) seconds.
% 0.76/1.11 % Length of proof is 24.
% 0.76/1.11 % Level of proof is 4.
% 0.76/1.11 % Maximum clause weight is 20.000.
% 0.76/1.11 % Given clauses 141.
% 0.76/1.11
% 0.76/1.11 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 0.76/1.11 2 defined(multiplicative_identity) # label(well_definedness_of_multiplicative_identity) # label(axiom). [assumption].
% 0.76/1.11 4 -sum(additive_identity,multiplicative_identity,additive_identity) # label(not_sum_1) # label(negated_conjecture). [assumption].
% 0.76/1.11 5 -sum(additive_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity) # label(not_sum_2) # label(negated_conjecture). [assumption].
% 0.76/1.11 7 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.76/1.11 8 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.76/1.11 10 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.76/1.11 11 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 0.76/1.11 14 defined(multiplicative_inverse(A)) | -defined(A) | sum(additive_identity,A,additive_identity) # label(well_definedness_of_multiplicative_inverse) # label(axiom). [assumption].
% 0.76/1.11 20 product(multiplicative_inverse(A),A,multiplicative_identity) | sum(additive_identity,A,additive_identity) | -defined(A) # label(existence_of_inverse_multiplication) # label(axiom). [assumption].
% 0.76/1.11 25 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom). [assumption].
% 0.76/1.11 27 sum(A,B,C) | -sum(D,E,F) | -product(F,V6,C) | -product(D,V6,A) | -product(E,V6,B) # label(distributivity_1) # label(axiom). [assumption].
% 0.76/1.11 54 sum(additive_identity,multiplicative_identity,multiplicative_identity). [resolve(7,b,2,a)].
% 0.76/1.11 56 product(multiplicative_identity,multiplicative_identity,multiplicative_identity). [resolve(8,b,2,a)].
% 0.76/1.11 57 product(multiplicative_identity,additive_identity,additive_identity). [resolve(8,b,1,a)].
% 0.76/1.11 60 -sum(multiplicative_inverse(multiplicative_identity),additive_identity,multiplicative_identity). [ur(10,a,5,a)].
% 0.76/1.11 70 defined(multiplicative_inverse(multiplicative_identity)). [resolve(14,b,2,a),unit_del(b,4)].
% 0.76/1.11 83 product(multiplicative_inverse(multiplicative_identity),multiplicative_identity,multiplicative_identity). [resolve(20,c,2,a),unit_del(b,4)].
% 0.76/1.11 149 product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_inverse(multiplicative_identity)). [resolve(70,a,8,b)].
% 0.76/1.11 163 sum(multiplicative_identity,additive_identity,multiplicative_identity). [resolve(54,a,10,b)].
% 0.76/1.11 223 product(additive_identity,multiplicative_identity,additive_identity). [resolve(57,a,11,b)].
% 0.76/1.11 463 -product(multiplicative_identity,multiplicative_identity,multiplicative_inverse(multiplicative_identity)). [ur(27,a,60,a,b,163,a,c,56,a,e,223,a)].
% 0.76/1.11 541 product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity). [resolve(83,a,11,b)].
% 0.76/1.11 1146 $F. [ur(25,a,463,a,b,56,a,c,541,a),unit_del(a,149)].
% 0.76/1.11
% 0.76/1.11 % SZS output end Refutation
% 0.76/1.11 ============================== end of proof ==========================
% 0.76/1.11
% 0.76/1.11 ============================== STATISTICS ============================
% 0.76/1.11
% 0.76/1.11 Given=141. Generated=1969. Kept=1145. proofs=1.
% 0.76/1.11 Usable=140. Sos=968. Demods=0. Limbo=28, Disabled=37. Hints=0.
% 0.76/1.11 Megabytes=0.75.
% 0.76/1.11 User_CPU=0.09, System_CPU=0.00, Wall_clock=0.
% 0.76/1.11
% 0.76/1.11 ============================== end of statistics =====================
% 0.76/1.11
% 0.76/1.11 ============================== end of search =========================
% 0.76/1.11
% 0.76/1.11 THEOREM PROVED
% 0.76/1.11 % SZS status Unsatisfiable
% 0.76/1.11
% 0.76/1.11 Exiting with 1 proof.
% 0.76/1.11
% 0.76/1.11 Process 2929 exit (max_proofs) Mon Jun 6 15:12:44 2022
% 0.76/1.11 Prover9 interrupted
%------------------------------------------------------------------------------