TSTP Solution File: SYN071-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN071-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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 : Thu Jul 21 11:16:06 EDT 2022
% Result : Unsatisfiable 0.49s 1.04s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN071-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jul 12 06:20:30 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.04 ============================== Prover9 ===============================
% 0.49/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.04 Process 2213 was started by sandbox on n010.cluster.edu,
% 0.49/1.04 Tue Jul 12 06:20:30 2022
% 0.49/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2052_n010.cluster.edu".
% 0.49/1.04 ============================== end of head ===========================
% 0.49/1.04
% 0.49/1.04 ============================== INPUT =================================
% 0.49/1.04
% 0.49/1.04 % Reading from file /tmp/Prover9_2052_n010.cluster.edu
% 0.49/1.04
% 0.49/1.04 set(prolog_style_variables).
% 0.49/1.04 set(auto2).
% 0.49/1.04 % set(auto2) -> set(auto).
% 0.49/1.04 % set(auto) -> set(auto_inference).
% 0.49/1.04 % set(auto) -> set(auto_setup).
% 0.49/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.04 % set(auto) -> set(auto_limits).
% 0.49/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.04 % set(auto) -> set(auto_denials).
% 0.49/1.04 % set(auto) -> set(auto_process).
% 0.49/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.04 % set(auto2) -> assign(stats, some).
% 0.49/1.04 % set(auto2) -> clear(echo_input).
% 0.49/1.04 % set(auto2) -> set(quiet).
% 0.49/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.04 % set(auto2) -> clear(print_given).
% 0.49/1.04 assign(lrs_ticks,-1).
% 0.49/1.04 assign(sos_limit,10000).
% 0.49/1.04 assign(order,kbo).
% 0.49/1.04 set(lex_order_vars).
% 0.49/1.04 clear(print_given).
% 0.49/1.04
% 0.49/1.04 % formulas(sos). % not echoed (4 formulas)
% 0.49/1.04
% 0.49/1.04 ============================== end of input ==========================
% 0.49/1.04
% 0.49/1.04 % From the command line: assign(max_seconds, 300).
% 0.49/1.04
% 0.49/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.04
% 0.49/1.04 % Formulas that are not ordinary clauses:
% 0.49/1.04
% 0.49/1.04 ============================== end of process non-clausal formulas ===
% 0.49/1.04
% 0.49/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.04
% 0.49/1.04 ============================== PREDICATE ELIMINATION =================
% 0.49/1.04
% 0.49/1.04 ============================== end predicate elimination =============
% 0.49/1.04
% 0.49/1.04 Auto_denials: (non-Horn, no changes).
% 0.49/1.04
% 0.49/1.04 Term ordering decisions:
% 0.49/1.04 Function symbol KB weights: a=1. b=1. c=1. d=1.
% 0.49/1.04
% 0.49/1.04 ============================== end of process initial clauses ========
% 0.49/1.04
% 0.49/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.49/1.04
% 0.49/1.04 ============================== end of clauses for search =============
% 0.49/1.04
% 0.49/1.04 ============================== SEARCH ================================
% 0.49/1.04
% 0.49/1.04 % Starting search at 0.01 seconds.
% 0.49/1.04
% 0.49/1.04 ============================== PROOF =================================
% 0.49/1.04 % SZS status Unsatisfiable
% 0.49/1.04 % SZS output start Refutation
% 0.49/1.04
% 0.49/1.04 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.49/1.04 % Length of proof is 13.
% 0.49/1.04 % Level of proof is 5.
% 0.49/1.04 % Maximum clause weight is 6.000.
% 0.49/1.04 % Given clauses 5.
% 0.49/1.04
% 0.49/1.04 1 a = b | c = d # label(clause_1) # label(axiom). [assumption].
% 0.49/1.04 2 b = a | d = c. [copy(1),flip(a),flip(b)].
% 0.49/1.04 3 a = c | b = d # label(clause_2) # label(axiom). [assumption].
% 0.49/1.04 4 c = a | d = b. [copy(3),flip(a),flip(b)].
% 0.49/1.04 5 a != d # label(clause_3) # label(negated_conjecture). [assumption].
% 0.49/1.04 6 d != a. [copy(5),flip(a)].
% 0.49/1.04 7 b != c # label(clause_4) # label(negated_conjecture). [assumption].
% 0.49/1.04 8 c != b. [copy(7),flip(a)].
% 0.49/1.04 9 c = a | b = a. [para(4(b,1),2(b,1)),flip(c),unit_del(c,8)].
% 0.49/1.04 11 c = a | b != a. [para(4(b,1),6(a,1))].
% 0.49/1.04 12 b = a. [para(9(a,1),2(b,2)),merge(b),unit_del(b,6)].
% 0.49/1.04 13 c = a. [back_rewrite(11),rewrite([12(4)]),xx(b)].
% 0.49/1.04 14 $F. [back_rewrite(8),rewrite([13(1),12(2)]),xx(a)].
% 0.49/1.04
% 0.49/1.04 % SZS output end Refutation
% 0.49/1.04 ============================== end of proof ==========================
% 0.49/1.04
% 0.49/1.04 ============================== STATISTICS ============================
% 0.49/1.04
% 0.49/1.04 Given=5. Generated=14. Kept=9. proofs=1.
% 0.49/1.04 Usable=2. Sos=0. Demods=2. Limbo=2, Disabled=9. Hints=0.
% 0.49/1.04 Megabytes=0.02.
% 0.49/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.49/1.04
% 0.49/1.04 ============================== end of statistics =====================
% 0.49/1.04
% 0.49/1.04 ============================== end of search =========================
% 0.49/1.04
% 0.49/1.04 THEOREM PROVED
% 0.49/1.04 % SZS status Unsatisfiable
% 0.49/1.04
% 0.49/1.04 Exiting with 1 proof.
% 0.49/1.04
% 0.49/1.04 Process 2213 exit (max_proofs) Tue Jul 12 06:20:30 2022
% 0.49/1.04 Prover9 interrupted
%------------------------------------------------------------------------------