TSTP Solution File: FLD043-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD043-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:20 EDT 2022
% Result : Unsatisfiable 3.91s 4.21s
% Output : Refutation 3.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD043-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 6 15:29:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.91/4.21 ============================== Prover9 ===============================
% 3.91/4.21 Prover9 (32) version 2009-11A, November 2009.
% 3.91/4.21 Process 22232 was started by sandbox2 on n023.cluster.edu,
% 3.91/4.21 Mon Jun 6 15:29:54 2022
% 3.91/4.21 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22079_n023.cluster.edu".
% 3.91/4.21 ============================== end of head ===========================
% 3.91/4.21
% 3.91/4.21 ============================== INPUT =================================
% 3.91/4.21
% 3.91/4.21 % Reading from file /tmp/Prover9_22079_n023.cluster.edu
% 3.91/4.21
% 3.91/4.21 set(prolog_style_variables).
% 3.91/4.21 set(auto2).
% 3.91/4.21 % set(auto2) -> set(auto).
% 3.91/4.21 % set(auto) -> set(auto_inference).
% 3.91/4.21 % set(auto) -> set(auto_setup).
% 3.91/4.21 % set(auto_setup) -> set(predicate_elim).
% 3.91/4.21 % set(auto_setup) -> assign(eq_defs, unfold).
% 3.91/4.21 % set(auto) -> set(auto_limits).
% 3.91/4.21 % set(auto_limits) -> assign(max_weight, "100.000").
% 3.91/4.21 % set(auto_limits) -> assign(sos_limit, 20000).
% 3.91/4.21 % set(auto) -> set(auto_denials).
% 3.91/4.21 % set(auto) -> set(auto_process).
% 3.91/4.21 % set(auto2) -> assign(new_constants, 1).
% 3.91/4.21 % set(auto2) -> assign(fold_denial_max, 3).
% 3.91/4.21 % set(auto2) -> assign(max_weight, "200.000").
% 3.91/4.21 % set(auto2) -> assign(max_hours, 1).
% 3.91/4.21 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 3.91/4.21 % set(auto2) -> assign(max_seconds, 0).
% 3.91/4.21 % set(auto2) -> assign(max_minutes, 5).
% 3.91/4.21 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 3.91/4.21 % set(auto2) -> set(sort_initial_sos).
% 3.91/4.21 % set(auto2) -> assign(sos_limit, -1).
% 3.91/4.21 % set(auto2) -> assign(lrs_ticks, 3000).
% 3.91/4.21 % set(auto2) -> assign(max_megs, 400).
% 3.91/4.21 % set(auto2) -> assign(stats, some).
% 3.91/4.21 % set(auto2) -> clear(echo_input).
% 3.91/4.21 % set(auto2) -> set(quiet).
% 3.91/4.21 % set(auto2) -> clear(print_initial_clauses).
% 3.91/4.21 % set(auto2) -> clear(print_given).
% 3.91/4.21 assign(lrs_ticks,-1).
% 3.91/4.21 assign(sos_limit,10000).
% 3.91/4.21 assign(order,kbo).
% 3.91/4.21 set(lex_order_vars).
% 3.91/4.21 clear(print_given).
% 3.91/4.21
% 3.91/4.21 % formulas(sos). % not echoed (28 formulas)
% 3.91/4.21
% 3.91/4.21 ============================== end of input ==========================
% 3.91/4.21
% 3.91/4.21 % From the command line: assign(max_seconds, 300).
% 3.91/4.21
% 3.91/4.21 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 3.91/4.21
% 3.91/4.21 % Formulas that are not ordinary clauses:
% 3.91/4.21
% 3.91/4.21 ============================== end of process non-clausal formulas ===
% 3.91/4.21
% 3.91/4.21 ============================== PROCESS INITIAL CLAUSES ===============
% 3.91/4.21
% 3.91/4.21 ============================== PREDICATE ELIMINATION =================
% 3.91/4.21
% 3.91/4.21 ============================== end predicate elimination =============
% 3.91/4.21
% 3.91/4.21 Auto_denials: (non-Horn, no changes).
% 3.91/4.21
% 3.91/4.21 Term ordering decisions:
% 3.91/4.21 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 3.91/4.21
% 3.91/4.21 ============================== end of process initial clauses ========
% 3.91/4.21
% 3.91/4.21 ============================== CLAUSES FOR SEARCH ====================
% 3.91/4.21
% 3.91/4.21 ============================== end of clauses for search =============
% 3.91/4.21
% 3.91/4.21 ============================== SEARCH ================================
% 3.91/4.21
% 3.91/4.21 % Starting search at 0.01 seconds.
% 3.91/4.21
% 3.91/4.21 Low Water (keep): wt=18.000, iters=3697
% 3.91/4.21
% 3.91/4.21 Low Water (keep): wt=14.000, iters=3449
% 3.91/4.21
% 3.91/4.21 Low Water (keep): wt=13.000, iters=3452
% 3.91/4.21
% 3.91/4.21 Low Water (keep): wt=12.000, iters=3354
% 3.91/4.21
% 3.91/4.21 Low Water (keep): wt=11.000, iters=3342
% 3.91/4.21
% 3.91/4.21 Low Water (keep): wt=10.000, iters=3337
% 3.91/4.21
% 3.91/4.21 Low Water (keep): wt=9.000, iters=3427
% 3.91/4.21
% 3.91/4.21 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 910 (0.00 of 0.34 sec).
% 3.91/4.21
% 3.91/4.21 Low Water (keep): wt=8.000, iters=3336
% 3.91/4.21
% 3.91/4.21 Low Water (displace): id=3626, wt=18.000
% 3.91/4.21
% 3.91/4.21 Low Water (displace): id=7707, wt=12.000
% 3.91/4.21
% 3.91/4.21 Low Water (displace): id=7708, wt=11.000
% 3.91/4.21
% 3.91/4.21 Low Water (displace): id=10380, wt=10.000
% 3.91/4.21
% 3.91/4.21 ============================== PROOF =================================
% 3.91/4.21 % SZS status Unsatisfiable
% 3.91/4.21 % SZS output start Refutation
% 3.91/4.21
% 3.91/4.21 % Proof 1 at 3.13 (+ 0.08) seconds.
% 3.91/4.21 % Length of proof is 41.
% 3.91/4.21 % Level of proof is 6.
% 3.91/4.21 % Maximum clause weight is 20.000.
% 3.91/4.21 % Given clauses 2046.
% 3.91/4.21
% 3.91/4.21 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 3.91/4.21 2 defined(multiplicative_identity) # label(well_definedness_of_multiplicative_identity) # label(axiom). [assumption].
% 3.91/4.21 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 3.91/4.21 5 -product(additive_identity,a,additive_identity) # label(not_product_2) # label(negated_conjecture). [assumption].
% 3.91/4.21 7 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 3.91/4.21 8 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 3.91/4.21 9 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 3.91/4.21 10 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 3.91/4.21 11 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 3.91/4.21 13 defined(multiply(A,B)) | -defined(A) | -defined(B) # label(well_definedness_of_multiplication) # label(axiom). [assumption].
% 3.91/4.21 17 product(A,B,multiply(A,B)) | -defined(A) | -defined(B) # label(totality_of_multiplication) # label(axiom). [assumption].
% 3.91/4.21 23 sum(A,B,C) | -sum(A,D,E) | -sum(D,F,B) | -sum(E,F,C) # label(associativity_addition_1) # label(axiom). [assumption].
% 3.91/4.21 24 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 3.91/4.21 25 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom). [assumption].
% 3.91/4.21 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].
% 3.91/4.21 28 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].
% 3.91/4.21 39 sum(A,B,A) | -sum(C,D,A) | -sum(D,B,D). [factor(24,b,d)].
% 3.91/4.21 45 sum(A,B,A) | -sum(C,D,C) | -product(C,E,A) | -product(D,E,B). [factor(27,c,d)].
% 3.91/4.21 49 product(A,B,C) | -sum(D,D,A) | -product(D,B,E) | -sum(E,E,C). [factor(28,c,d)].
% 3.91/4.21 56 sum(additive_identity,multiplicative_identity,multiplicative_identity). [resolve(7,b,2,a)].
% 3.91/4.21 57 sum(additive_identity,additive_identity,additive_identity). [resolve(7,b,1,a)].
% 3.91/4.21 58 product(multiplicative_identity,a,a). [resolve(8,b,3,a)].
% 3.91/4.21 60 product(multiplicative_identity,additive_identity,additive_identity). [resolve(8,b,1,a)].
% 3.91/4.21 61 sum(additive_inverse(a),a,additive_identity). [resolve(9,b,3,a)].
% 3.91/4.21 64 -product(a,additive_identity,additive_identity). [ur(11,a,5,a)].
% 3.91/4.21 71 defined(multiply(a,A)) | -defined(A). [resolve(13,b,3,a)].
% 3.91/4.21 85 product(a,A,multiply(a,A)) | -defined(A). [resolve(17,b,3,a)].
% 3.91/4.21 194 sum(multiplicative_identity,additive_identity,multiplicative_identity). [resolve(56,a,10,b)].
% 3.91/4.21 204 sum(additive_identity,A,B) | -sum(additive_identity,C,A) | -sum(additive_identity,C,B). [resolve(57,a,23,b)].
% 3.91/4.21 237 sum(a,A,a) | -sum(multiplicative_identity,B,multiplicative_identity) | -product(B,a,A). [resolve(58,a,45,c)].
% 3.91/4.21 300 product(additive_identity,multiplicative_identity,additive_identity). [resolve(60,a,11,b)].
% 3.91/4.21 345 sum(additive_identity,A,additive_identity) | -sum(a,A,a). [resolve(61,a,39,b)].
% 3.91/4.21 1334 defined(multiply(a,additive_identity)). [resolve(71,b,1,a)].
% 3.91/4.21 1395 sum(additive_identity,multiply(a,additive_identity),multiply(a,additive_identity)). [resolve(1334,a,7,b)].
% 3.91/4.21 3753 product(a,additive_identity,multiply(a,additive_identity)). [resolve(85,b,1,a)].
% 3.91/4.21 8198 product(additive_identity,a,multiply(a,additive_identity)). [resolve(3753,a,11,b)].
% 3.91/4.21 8237 -product(multiply(a,additive_identity),multiplicative_identity,additive_identity). [ur(25,a,64,a,b,3753,a,c,300,a)].
% 3.91/4.21 9056 -sum(additive_identity,additive_identity,multiply(a,additive_identity)). [ur(49,a,8237,a,c,300,a,d,57,a)].
% 3.91/4.21 9754 sum(a,multiply(a,additive_identity),a). [resolve(8198,a,237,c),unit_del(b,194)].
% 3.91/4.21 12109 sum(additive_identity,multiply(a,additive_identity),additive_identity). [resolve(345,b,9754,a)].
% 3.91/4.21 12119 $F. [ur(204,a,9056,a,b,12109,a),unit_del(a,1395)].
% 3.91/4.21
% 3.91/4.21 % SZS output end Refutation
% 3.91/4.21 ============================== end of proof ==========================
% 3.91/4.21
% 3.91/4.21 ============================== STATISTICS ============================
% 3.91/4.21
% 3.91/4.21 Given=2046. Generated=133841. Kept=12118. proofs=1.
% 3.91/4.21 Usable=2045. Sos=9794. Demods=0. Limbo=5, Disabled=302. Hints=0.
% 3.91/4.21 Megabytes=6.46.
% 3.91/4.21 User_CPU=3.13, System_CPU=0.08, Wall_clock=4.
% 3.91/4.21
% 3.91/4.21 ============================== end of statistics =====================
% 3.91/4.21
% 3.91/4.21 ============================== end of search =========================
% 3.91/4.21
% 3.91/4.21 THEOREM PROVED
% 3.91/4.21 % SZS status Unsatisfiable
% 3.91/4.21
% 3.91/4.21 Exiting with 1 proof.
% 3.91/4.21
% 3.91/4.21 Process 22232 exit (max_proofs) Mon Jun 6 15:29:58 2022
% 3.91/4.21 Prover9 interrupted
%------------------------------------------------------------------------------