TSTP Solution File: FLD017-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD017-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:11 EDT 2022
% Result : Unsatisfiable 0.44s 1.02s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD017-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n019.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 17:35:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.02 ============================== Prover9 ===============================
% 0.44/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.02 Process 14976 was started by sandbox2 on n019.cluster.edu,
% 0.44/1.02 Mon Jun 6 17:35:41 2022
% 0.44/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14822_n019.cluster.edu".
% 0.44/1.02 ============================== end of head ===========================
% 0.44/1.02
% 0.44/1.02 ============================== INPUT =================================
% 0.44/1.02
% 0.44/1.02 % Reading from file /tmp/Prover9_14822_n019.cluster.edu
% 0.44/1.02
% 0.44/1.02 set(prolog_style_variables).
% 0.44/1.02 set(auto2).
% 0.44/1.02 % set(auto2) -> set(auto).
% 0.44/1.02 % set(auto) -> set(auto_inference).
% 0.44/1.02 % set(auto) -> set(auto_setup).
% 0.44/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.02 % set(auto) -> set(auto_limits).
% 0.44/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.02 % set(auto) -> set(auto_denials).
% 0.44/1.02 % set(auto) -> set(auto_process).
% 0.44/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.02 % set(auto2) -> assign(stats, some).
% 0.44/1.02 % set(auto2) -> clear(echo_input).
% 0.44/1.02 % set(auto2) -> set(quiet).
% 0.44/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.02 % set(auto2) -> clear(print_given).
% 0.44/1.02 assign(lrs_ticks,-1).
% 0.44/1.02 assign(sos_limit,10000).
% 0.44/1.02 assign(order,kbo).
% 0.44/1.02 set(lex_order_vars).
% 0.44/1.02 clear(print_given).
% 0.44/1.02
% 0.44/1.02 % formulas(sos). % not echoed (34 formulas)
% 0.44/1.02
% 0.44/1.02 ============================== end of input ==========================
% 0.44/1.02
% 0.44/1.02 % From the command line: assign(max_seconds, 300).
% 0.44/1.02
% 0.44/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.02
% 0.44/1.02 % Formulas that are not ordinary clauses:
% 0.44/1.02
% 0.44/1.02 ============================== end of process non-clausal formulas ===
% 0.44/1.02
% 0.44/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.02
% 0.44/1.02 ============================== PREDICATE ELIMINATION =================
% 0.44/1.02
% 0.44/1.02 ============================== end predicate elimination =============
% 0.44/1.02
% 0.44/1.02 Auto_denials: (non-Horn, no changes).
% 0.44/1.02
% 0.44/1.02 Term ordering decisions:
% 0.44/1.02 Function symbol KB weights: additive_identity=1. a=1. multiplicative_identity=1. b=1. c=1. x=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.44/1.02
% 0.44/1.02 ============================== end of process initial clauses ========
% 0.44/1.02
% 0.44/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.02
% 0.44/1.02 ============================== end of clauses for search =============
% 0.44/1.02
% 0.44/1.02 ============================== SEARCH ================================
% 0.44/1.02
% 0.44/1.02 % Starting search at 0.01 seconds.
% 0.44/1.02
% 0.44/1.02 ============================== PROOF =================================
% 0.44/1.02 % SZS status Unsatisfiable
% 0.44/1.02 % SZS output start Refutation
% 0.44/1.02
% 0.44/1.02 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.44/1.02 % Length of proof is 10.
% 0.44/1.02 % Level of proof is 2.
% 0.44/1.02 % Maximum clause weight is 12.000.
% 0.44/1.02 % Given clauses 57.
% 0.44/1.02
% 0.44/1.02 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 0.44/1.02 7 equalish(a,x) # label(a_equals_x_5) # label(negated_conjecture). [assumption].
% 0.44/1.02 8 equalish(add(a,b),c) # label(add_equals_c_6) # label(negated_conjecture). [assumption].
% 0.44/1.02 10 -equalish(add(x,b),c) # label(add_not_equal_to_c_7) # label(negated_conjecture). [assumption].
% 0.44/1.02 13 equalish(A,B) | -equalish(B,A) # label(symmetry_of_equality) # label(axiom). [assumption].
% 0.44/1.02 22 equalish(A,B) | -equalish(A,C) | -equalish(C,B) # label(transitivity_of_equality) # label(axiom). [assumption].
% 0.44/1.02 30 equalish(add(A,B),add(C,B)) | -defined(B) | -equalish(A,C) # label(compatibility_of_equality_and_addition) # label(axiom). [assumption].
% 0.44/1.02 67 equalish(x,a). [resolve(13,b,7,a)].
% 0.44/1.02 121 -equalish(add(x,b),add(a,b)). [ur(22,a,10,a,c,8,a)].
% 0.44/1.02 422 $F. [ur(30,a,121,a,b,4,a),unit_del(a,67)].
% 0.44/1.02
% 0.44/1.02 % SZS output end Refutation
% 0.44/1.02 ============================== end of proof ==========================
% 0.44/1.02
% 0.44/1.02 ============================== STATISTICS ============================
% 0.44/1.02
% 0.44/1.02 Given=57. Generated=512. Kept=421. proofs=1.
% 0.44/1.02 Usable=57. Sos=364. Demods=0. Limbo=0, Disabled=34. Hints=0.
% 0.44/1.02 Megabytes=0.34.
% 0.44/1.02 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.44/1.02
% 0.44/1.02 ============================== end of statistics =====================
% 0.44/1.02
% 0.44/1.02 ============================== end of search =========================
% 0.44/1.02
% 0.44/1.02 THEOREM PROVED
% 0.44/1.02 % SZS status Unsatisfiable
% 0.44/1.02
% 0.44/1.02 Exiting with 1 proof.
% 0.44/1.02
% 0.44/1.02 Process 14976 exit (max_proofs) Mon Jun 6 17:35:41 2022
% 0.44/1.02 Prover9 interrupted
%------------------------------------------------------------------------------