TSTP Solution File: ALG011-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ALG011-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 14 17:53:35 EDT 2022
% Result : Unsatisfiable 0.43s 1.01s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : ALG011-1 : TPTP v8.1.0. Released v2.7.0.
% 0.02/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 8 03:25:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 29157 was started by sandbox2 on n022.cluster.edu,
% 0.43/1.01 Wed Jun 8 03:25:05 2022
% 0.43/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28864_n022.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_28864_n022.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (7 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01
% 0.43/1.01 ============================== end predicate elimination =============
% 0.43/1.01
% 0.43/1.01 Auto_denials: (non-Horn, no changes).
% 0.43/1.01
% 0.43/1.01 Term ordering decisions:
% 0.43/1.01 Function symbol KB weights: a1=1. a2=1. f=1.
% 0.43/1.01
% 0.43/1.01 ============================== end of process initial clauses ========
% 0.43/1.01
% 0.43/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.01
% 0.43/1.01 ============================== end of clauses for search =============
% 0.43/1.01
% 0.43/1.01 ============================== SEARCH ================================
% 0.43/1.01
% 0.43/1.01 % Starting search at 0.01 seconds.
% 0.43/1.01
% 0.43/1.01 ============================== PROOF =================================
% 0.43/1.01 % SZS status Unsatisfiable
% 0.43/1.01 % SZS output start Refutation
% 0.43/1.01
% 0.43/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/1.01 % Length of proof is 21.
% 0.43/1.01 % Level of proof is 6.
% 0.43/1.01 % Maximum clause weight is 11.000.
% 0.43/1.01 % Given clauses 34.
% 0.43/1.01
% 0.43/1.01 1 c(a1) # label(partition_c_not_empty) # label(hypothesis). [assumption].
% 0.43/1.01 2 d(a2) # label(partition_d_not_empty) # label(hypothesis). [assumption].
% 0.43/1.01 3 c(A) | d(A) # label(partitions_union) # label(axiom). [assumption].
% 0.43/1.01 4 f(A,f(B,C)) = f(f(A,B),C) # label(f_is_associative) # label(axiom). [assumption].
% 0.43/1.01 5 f(f(A,B),C) = f(A,f(B,C)). [copy(4),flip(a)].
% 0.43/1.01 6 -c(A) | -d(A) # label(partitions_exclusive) # label(hypothesis). [assumption].
% 0.43/1.01 7 d(f(A,B)) | -c(A) | -c(B) # label(conjecture_1) # label(negated_conjecture). [assumption].
% 0.43/1.01 8 c(f(A,B)) | -d(A) | -d(B) # label(conjecture_2) # label(negated_conjecture). [assumption].
% 0.43/1.01 9 d(f(A,A)) | -c(A). [factor(7,b,c)].
% 0.43/1.01 10 c(f(A,A)) | -d(A). [factor(8,b,c)].
% 0.43/1.01 14 d(f(A,a1)) | -c(A). [resolve(7,c,1,a)].
% 0.43/1.01 16 c(f(a2,A)) | -d(A). [resolve(8,b,2,a)].
% 0.43/1.01 19 d(f(a1,a1)). [resolve(9,b,1,a)].
% 0.43/1.01 21 c(f(a2,a2)). [resolve(10,b,2,a)].
% 0.43/1.01 31 d(f(a2,f(a2,a1))). [resolve(14,b,21,a),rewrite([5(5)])].
% 0.43/1.01 35 c(f(a2,f(a1,a1))). [resolve(16,b,19,a)].
% 0.43/1.01 36 c(f(a2,A)) | c(A). [resolve(16,b,3,b)].
% 0.43/1.01 60 -c(f(a2,f(a2,a1))). [resolve(31,a,6,b)].
% 0.43/1.01 72 -d(f(a2,f(a1,a1))). [ur(6,a,35,a)].
% 0.43/1.01 83 c(f(a2,a1)). [resolve(60,a,36,a)].
% 0.43/1.01 86 $F. [resolve(83,a,14,b),rewrite([5(5)]),unit_del(a,72)].
% 0.43/1.01
% 0.43/1.01 % SZS output end Refutation
% 0.43/1.01 ============================== end of proof ==========================
% 0.43/1.01
% 0.43/1.01 ============================== STATISTICS ============================
% 0.43/1.01
% 0.43/1.01 Given=34. Generated=119. Kept=84. proofs=1.
% 0.43/1.01 Usable=34. Sos=50. Demods=1. Limbo=0, Disabled=7. Hints=0.
% 0.43/1.01 Megabytes=0.08.
% 0.43/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/1.01
% 0.43/1.01 ============================== end of statistics =====================
% 0.43/1.01
% 0.43/1.01 ============================== end of search =========================
% 0.43/1.01
% 0.43/1.01 THEOREM PROVED
% 0.43/1.01 % SZS status Unsatisfiable
% 0.43/1.01
% 0.43/1.01 Exiting with 1 proof.
% 0.43/1.01
% 0.43/1.01 Process 29157 exit (max_proofs) Wed Jun 8 03:25:05 2022
% 0.43/1.01 Prover9 interrupted
%------------------------------------------------------------------------------