TSTP Solution File: FLD068-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD068-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:31 EDT 2022
% Result : Unsatisfiable 0.52s 0.94s
% Output : Refutation 0.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : FLD068-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.09/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon Jun 6 19:34:35 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.52/0.94 ============================== Prover9 ===============================
% 0.52/0.94 Prover9 (32) version 2009-11A, November 2009.
% 0.52/0.94 Process 9954 was started by sandbox2 on n032.cluster.edu,
% 0.52/0.94 Mon Jun 6 19:34:35 2022
% 0.52/0.94 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9800_n032.cluster.edu".
% 0.52/0.94 ============================== end of head ===========================
% 0.52/0.94
% 0.52/0.94 ============================== INPUT =================================
% 0.52/0.94
% 0.52/0.94 % Reading from file /tmp/Prover9_9800_n032.cluster.edu
% 0.52/0.94
% 0.52/0.94 set(prolog_style_variables).
% 0.52/0.94 set(auto2).
% 0.52/0.94 % set(auto2) -> set(auto).
% 0.52/0.94 % set(auto) -> set(auto_inference).
% 0.52/0.94 % set(auto) -> set(auto_setup).
% 0.52/0.94 % set(auto_setup) -> set(predicate_elim).
% 0.52/0.94 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.52/0.94 % set(auto) -> set(auto_limits).
% 0.52/0.94 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.52/0.94 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.52/0.94 % set(auto) -> set(auto_denials).
% 0.52/0.94 % set(auto) -> set(auto_process).
% 0.52/0.94 % set(auto2) -> assign(new_constants, 1).
% 0.52/0.94 % set(auto2) -> assign(fold_denial_max, 3).
% 0.52/0.94 % set(auto2) -> assign(max_weight, "200.000").
% 0.52/0.94 % set(auto2) -> assign(max_hours, 1).
% 0.52/0.94 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.52/0.94 % set(auto2) -> assign(max_seconds, 0).
% 0.52/0.94 % set(auto2) -> assign(max_minutes, 5).
% 0.52/0.94 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.52/0.94 % set(auto2) -> set(sort_initial_sos).
% 0.52/0.94 % set(auto2) -> assign(sos_limit, -1).
% 0.52/0.94 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.52/0.94 % set(auto2) -> assign(max_megs, 400).
% 0.52/0.94 % set(auto2) -> assign(stats, some).
% 0.52/0.94 % set(auto2) -> clear(echo_input).
% 0.52/0.94 % set(auto2) -> set(quiet).
% 0.52/0.94 % set(auto2) -> clear(print_initial_clauses).
% 0.52/0.94 % set(auto2) -> clear(print_given).
% 0.52/0.94 assign(lrs_ticks,-1).
% 0.52/0.94 assign(sos_limit,10000).
% 0.52/0.94 assign(order,kbo).
% 0.52/0.94 set(lex_order_vars).
% 0.52/0.94 clear(print_given).
% 0.52/0.94
% 0.52/0.94 % formulas(sos). % not echoed (30 formulas)
% 0.52/0.94
% 0.52/0.94 ============================== end of input ==========================
% 0.52/0.94
% 0.52/0.94 % From the command line: assign(max_seconds, 300).
% 0.52/0.94
% 0.52/0.94 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.52/0.94
% 0.52/0.94 % Formulas that are not ordinary clauses:
% 0.52/0.94
% 0.52/0.94 ============================== end of process non-clausal formulas ===
% 0.52/0.94
% 0.52/0.94 ============================== PROCESS INITIAL CLAUSES ===============
% 0.52/0.94
% 0.52/0.94 ============================== PREDICATE ELIMINATION =================
% 0.52/0.94
% 0.52/0.94 ============================== end predicate elimination =============
% 0.52/0.94
% 0.52/0.94 Auto_denials: (non-Horn, no changes).
% 0.52/0.94
% 0.52/0.94 Term ordering decisions:
% 0.52/0.94 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.52/0.94
% 0.52/0.94 ============================== end of process initial clauses ========
% 0.52/0.94
% 0.52/0.94 ============================== CLAUSES FOR SEARCH ====================
% 0.52/0.94
% 0.52/0.94 ============================== end of clauses for search =============
% 0.52/0.94
% 0.52/0.94 ============================== SEARCH ================================
% 0.52/0.94
% 0.52/0.94 % Starting search at 0.01 seconds.
% 0.52/0.94
% 0.52/0.94 Low Water (keep): wt=18.000, iters=3709
% 0.52/0.94
% 0.52/0.94 Low Water (keep): wt=14.000, iters=3478
% 0.52/0.94
% 0.52/0.94 ============================== PROOF =================================
% 0.52/0.94 % SZS status Unsatisfiable
% 0.52/0.94 % SZS output start Refutation
% 0.52/0.94
% 0.52/0.94 % Proof 1 at 0.15 (+ 0.01) seconds.
% 0.52/0.94 % Length of proof is 20.
% 0.52/0.94 % Level of proof is 4.
% 0.52/0.94 % Maximum clause weight is 16.000.
% 0.52/0.94 % Given clauses 298.
% 0.52/0.94
% 0.52/0.94 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.52/0.94 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 0.52/0.94 5 less_or_equal(additive_identity,add(b,additive_inverse(a))) # label(less_or_equal_3) # label(negated_conjecture). [assumption].
% 0.52/0.94 6 -less_or_equal(a,b) # label(not_less_or_equal_4) # label(negated_conjecture). [assumption].
% 0.52/0.94 8 defined(additive_inverse(A)) | -defined(A) # label(well_definedness_of_additive_inverse) # label(axiom). [assumption].
% 0.52/0.94 9 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.52/0.94 11 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.52/0.94 12 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.52/0.94 18 sum(A,B,add(A,B)) | -defined(A) | -defined(B) # label(totality_of_addition) # label(axiom). [assumption].
% 0.52/0.94 24 less_or_equal(A,B) | -less_or_equal(C,D) | -sum(C,E,A) | -sum(D,E,B) # label(compatibility_of_order_relation_and_addition) # label(axiom). [assumption].
% 0.52/0.94 26 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 0.52/0.94 55 defined(additive_inverse(a)). [resolve(8,b,3,a)].
% 0.52/0.94 58 sum(additive_identity,b,b). [resolve(9,b,4,a)].
% 0.52/0.94 59 sum(additive_identity,a,a). [resolve(9,b,3,a)].
% 0.52/0.94 67 sum(additive_inverse(a),a,additive_identity). [resolve(11,b,3,a)].
% 0.52/0.94 91 sum(b,A,add(b,A)) | -defined(A). [resolve(18,b,4,a)].
% 0.52/0.94 227 sum(b,additive_identity,b). [resolve(58,a,12,b)].
% 0.52/0.94 242 -sum(add(b,additive_inverse(a)),a,b). [ur(24,a,6,a,b,5,a,c,59,a)].
% 0.52/0.94 698 -sum(b,additive_inverse(a),add(b,additive_inverse(a))). [ur(26,a,242,a,c,67,a,d,227,a)].
% 0.52/0.94 3917 $F. [resolve(91,b,55,a),unit_del(a,698)].
% 0.52/0.94
% 0.52/0.94 % SZS output end Refutation
% 0.52/0.94 ============================== end of proof ==========================
% 0.52/0.94
% 0.52/0.94 ============================== STATISTICS ============================
% 0.52/0.94
% 0.52/0.94 Given=298. Generated=5458. Kept=3916. proofs=1.
% 0.52/0.94 Usable=293. Sos=3518. Demods=0. Limbo=86, Disabled=49. Hints=0.
% 0.52/0.94 Megabytes=2.22.
% 0.52/0.94 User_CPU=0.16, System_CPU=0.01, Wall_clock=0.
% 0.52/0.94
% 0.52/0.94 ============================== end of statistics =====================
% 0.52/0.94
% 0.52/0.94 ============================== end of search =========================
% 0.52/0.94
% 0.52/0.94 THEOREM PROVED
% 0.52/0.94 % SZS status Unsatisfiable
% 0.52/0.94
% 0.52/0.94 Exiting with 1 proof.
% 0.52/0.94
% 0.52/0.94 Process 9954 exit (max_proofs) Mon Jun 6 19:34:35 2022
% 0.52/0.94 Prover9 interrupted
%------------------------------------------------------------------------------