TSTP Solution File: SYN037-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN037-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:15:36 EDT 2022
% Result : Unsatisfiable 0.69s 0.95s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN037-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 19:22:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.95 ============================== Prover9 ===============================
% 0.69/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.95 Process 9947 was started by sandbox2 on n028.cluster.edu,
% 0.69/0.95 Mon Jul 11 19:22:44 2022
% 0.69/0.95 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9794_n028.cluster.edu".
% 0.69/0.95 ============================== end of head ===========================
% 0.69/0.95
% 0.69/0.95 ============================== INPUT =================================
% 0.69/0.95
% 0.69/0.95 % Reading from file /tmp/Prover9_9794_n028.cluster.edu
% 0.69/0.95
% 0.69/0.95 set(prolog_style_variables).
% 0.69/0.95 set(auto2).
% 0.69/0.95 % set(auto2) -> set(auto).
% 0.69/0.95 % set(auto) -> set(auto_inference).
% 0.69/0.95 % set(auto) -> set(auto_setup).
% 0.69/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.95 % set(auto) -> set(auto_limits).
% 0.69/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.95 % set(auto) -> set(auto_denials).
% 0.69/0.95 % set(auto) -> set(auto_process).
% 0.69/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.95 % set(auto2) -> assign(stats, some).
% 0.69/0.95 % set(auto2) -> clear(echo_input).
% 0.69/0.95 % set(auto2) -> set(quiet).
% 0.69/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.95 % set(auto2) -> clear(print_given).
% 0.69/0.95 assign(lrs_ticks,-1).
% 0.69/0.95 assign(sos_limit,10000).
% 0.69/0.95 assign(order,kbo).
% 0.69/0.95 set(lex_order_vars).
% 0.69/0.95 clear(print_given).
% 0.69/0.95
% 0.69/0.95 % formulas(sos). % not echoed (22 formulas)
% 0.69/0.95
% 0.69/0.95 ============================== end of input ==========================
% 0.69/0.95
% 0.69/0.95 % From the command line: assign(max_seconds, 300).
% 0.69/0.95
% 0.69/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.95
% 0.69/0.95 % Formulas that are not ordinary clauses:
% 0.69/0.95
% 0.69/0.95 ============================== end of process non-clausal formulas ===
% 0.69/0.95
% 0.69/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.95
% 0.69/0.95 ============================== PREDICATE ELIMINATION =================
% 0.69/0.95
% 0.69/0.95 ============================== end predicate elimination =============
% 0.69/0.95
% 0.69/0.95 Auto_denials: (non-Horn, no changes).
% 0.69/0.95
% 0.69/0.95 Term ordering decisions:
% 0.69/0.95 Function symbol KB weights: cw=1. cx=1. cu=1. cuu=1. cv=1. cvv=1. fy3=1. fz2=1. fz5=1. fy=1.
% 0.69/0.95
% 0.69/0.95 ============================== end of process initial clauses ========
% 0.69/0.95
% 0.69/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.95
% 0.69/0.95 ============================== end of clauses for search =============
% 0.69/0.95
% 0.69/0.95 ============================== SEARCH ================================
% 0.69/0.95
% 0.69/0.95 % Starting search at 0.01 seconds.
% 0.69/0.95
% 0.69/0.95 ============================== PROOF =================================
% 0.69/0.95 % SZS status Unsatisfiable
% 0.69/0.95 % SZS output start Refutation
% 0.69/0.95
% 0.69/0.95 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.69/0.95 % Length of proof is 69.
% 0.69/0.95 % Level of proof is 27.
% 0.69/0.95 % Maximum clause weight is 7.000.
% 0.69/0.95 % Given clauses 65.
% 0.69/0.95
% 0.69/0.95 1 m2 | p(cv) # label(clause_21) # label(negated_conjecture). [assumption].
% 0.69/0.95 2 m1 | q(cu) # label(clause_22) # label(negated_conjecture). [assumption].
% 0.69/0.95 3 m1 | m3 | p(A) | p(fy3(A)) # label(clause_16) # label(negated_conjecture). [assumption].
% 0.69/0.95 4 -m1 | -m3 | -p(A) | -p(fy(A)) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.69/0.95 5 -p(cvv) | m2 # label(clause_19) # label(negated_conjecture). [assumption].
% 0.69/0.95 6 -q(cuu) | m1 # label(clause_20) # label(negated_conjecture). [assumption].
% 0.69/0.95 7 -m1 | -q(A) | q(B) # label(clause_17) # label(negated_conjecture). [assumption].
% 0.69/0.95 8 -m2 | -p(A) | p(B) # label(clause_18) # label(negated_conjecture). [assumption].
% 0.69/0.95 9 -m1 | -p(cx) | m3 | p(A) # label(clause_3) # label(negated_conjecture). [assumption].
% 0.69/0.95 10 -m1 | -p(A) | m3 | p(cx) # label(clause_4) # label(negated_conjecture). [assumption].
% 0.69/0.95 11 -m2 | -m3 | -q(cw) | q(A) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.69/0.95 12 -m2 | -m3 | -q(A) | q(cw) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.69/0.95 13 -m3 | -p(cx) | m1 | p(A) # label(clause_9) # label(negated_conjecture). [assumption].
% 0.69/0.95 14 -m3 | -p(A) | m1 | p(cx) # label(clause_10) # label(negated_conjecture). [assumption].
% 0.69/0.95 15 -q(cw) | m2 | m3 | q(A) # label(clause_14) # label(negated_conjecture). [assumption].
% 0.69/0.95 16 -q(A) | m2 | m3 | q(cw) # label(clause_15) # label(negated_conjecture). [assumption].
% 0.69/0.95 17 -m1 | -m3 | p(A) | p(fy(A)) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.69/0.95 18 -m2 | -q(A) | -q(fz5(A)) | m3 # label(clause_7) # label(negated_conjecture). [assumption].
% 0.69/0.95 19 -m2 | m3 | q(A) | q(fz5(A)) # label(clause_8) # label(negated_conjecture). [assumption].
% 0.69/0.95 20 -m3 | -q(A) | -q(fz2(A)) | m2 # label(clause_11) # label(negated_conjecture). [assumption].
% 0.69/0.95 21 -m3 | m2 | q(A) | q(fz2(A)) # label(clause_12) # label(negated_conjecture). [assumption].
% 0.69/0.95 22 -p(A) | -p(fy3(A)) | m1 | m3 # label(clause_13) # label(negated_conjecture). [assumption].
% 0.69/0.95 23 -m2 | p(A) | m1 | m3 | p(B). [resolve(8,b,3,d)].
% 0.69/0.95 24 -m2 | p(A) | m1 | m3. [factor(23,b,e)].
% 0.69/0.95 25 -m1 | m3 | p(cx) | m2. [resolve(10,b,1,b)].
% 0.69/0.95 26 -m2 | -m3 | q(cw) | m1. [resolve(12,c,2,b)].
% 0.69/0.95 27 -m3 | m1 | p(cx) | m2. [resolve(14,b,1,b)].
% 0.69/0.95 28 m2 | m3 | q(cw) | m1. [resolve(16,a,2,b)].
% 0.69/0.95 29 m2 | m3 | m1 | q(A). [resolve(28,c,15,a),merge(d),merge(e)].
% 0.69/0.95 30 m2 | m3 | m1. [resolve(29,d,6,a),merge(d)].
% 0.69/0.95 31 m2 | m3 | p(cx). [resolve(30,c,25,a),merge(c),merge(e)].
% 0.69/0.95 32 m2 | m3 | -m1 | p(A). [resolve(31,c,9,b),merge(d)].
% 0.69/0.95 33 m2 | m3 | p(A). [resolve(32,c,30,c),merge(d),merge(e)].
% 0.69/0.95 34 m2 | m3. [resolve(33,c,5,a),merge(c)].
% 0.69/0.95 35 m3 | p(A) | m1. [resolve(34,a,24,a),merge(d)].
% 0.69/0.95 36 m3 | q(A) | q(fz5(A)). [resolve(34,a,19,a),merge(b)].
% 0.69/0.95 37 m3 | m1 | -p(A). [resolve(35,b,22,b),merge(d),merge(e)].
% 0.69/0.95 38 m3 | m1. [resolve(37,c,35,b),merge(c),merge(d)].
% 0.69/0.95 39 m3 | q(A) | -m1 | q(B). [resolve(36,c,7,b)].
% 0.69/0.95 40 m3 | q(A) | -m1. [factor(39,b,d)].
% 0.69/0.95 41 m3 | q(A). [resolve(40,c,38,b),merge(c)].
% 0.69/0.95 42 m3 | -m2 | -q(A). [resolve(41,b,18,c),merge(d)].
% 0.69/0.95 43 m3 | -m2. [resolve(42,c,41,b),merge(c)].
% 0.69/0.95 44 m3. [resolve(43,b,34,a),merge(b)].
% 0.69/0.95 45 m1 | p(cx) | m2. [back_unit_del(27),unit_del(a,44)].
% 0.69/0.95 46 -m2 | q(cw) | m1. [back_unit_del(26),unit_del(b,44)].
% 0.69/0.95 47 m2 | q(A) | q(fz2(A)). [back_unit_del(21),unit_del(a,44)].
% 0.69/0.95 48 -q(A) | -q(fz2(A)) | m2. [back_unit_del(20),unit_del(a,44)].
% 0.69/0.95 49 -m1 | p(A) | p(fy(A)). [back_unit_del(17),unit_del(b,44)].
% 0.69/0.95 51 -p(cx) | m1 | p(A). [back_unit_del(13),unit_del(a,44)].
% 0.69/0.95 53 -m2 | -q(cw) | q(A). [back_unit_del(11),unit_del(b,44)].
% 0.69/0.95 54 -m1 | -p(A) | -p(fy(A)). [back_unit_del(4),unit_del(b,44)].
% 0.69/0.95 55 m1 | p(A) | m2. [resolve(51,a,45,b),merge(c)].
% 0.69/0.95 56 m1 | m2. [resolve(55,b,5,a),merge(c)].
% 0.69/0.95 57 m2 | q(A) | -m1 | q(B). [resolve(47,c,7,b)].
% 0.69/0.95 58 m2 | q(A) | -m1. [factor(57,b,d)].
% 0.69/0.95 59 m2 | q(A). [resolve(58,c,56,a),merge(c)].
% 0.69/0.95 60 -q(A) | m2. [resolve(48,b,59,b),merge(c)].
% 0.69/0.95 61 m2. [resolve(60,a,59,b),merge(b)].
% 0.69/0.95 62 -q(cw) | q(A). [back_unit_del(53),unit_del(a,61)].
% 0.69/0.95 64 q(cw) | m1. [back_unit_del(46),unit_del(a,61)].
% 0.69/0.95 65 -p(A) | p(B). [back_unit_del(8),unit_del(a,61)].
% 0.69/0.95 66 q(A) | m1. [resolve(62,a,64,a)].
% 0.69/0.95 67 m1. [resolve(66,a,6,a),merge(b)].
% 0.69/0.95 68 -p(A) | -p(fy(A)). [back_unit_del(54),unit_del(a,67)].
% 0.69/0.95 69 p(A) | p(fy(A)). [back_unit_del(49),unit_del(a,67)].
% 0.69/0.95 71 p(A) | p(B). [resolve(69,b,65,a)].
% 0.69/0.95 72 p(A). [factor(71,a,b)].
% 0.69/0.95 73 $F. [back_unit_del(68),unit_del(a,72),unit_del(b,72)].
% 0.69/0.95
% 0.69/0.95 % SZS output end Refutation
% 0.69/0.95 ============================== end of proof ==========================
% 0.69/0.95
% 0.69/0.95 ============================== STATISTICS ============================
% 0.69/0.95
% 0.69/0.95 Given=65. Generated=135. Kept=72. proofs=1.
% 0.69/0.95 Usable=4. Sos=0. Demods=0. Limbo=1, Disabled=89. Hints=0.
% 0.69/0.95 Megabytes=0.06.
% 0.69/0.95 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.69/0.95
% 0.69/0.95 ============================== end of statistics =====================
% 0.69/0.95
% 0.69/0.95 ============================== end of search =========================
% 0.69/0.95
% 0.69/0.95 THEOREM PROVED
% 0.69/0.95 % SZS status Unsatisfiable
% 0.69/0.95
% 0.69/0.95 Exiting with 1 proof.
% 0.69/0.95
% 0.69/0.95 Process 9947 exit (max_proofs) Mon Jul 11 19:22:44 2022
% 0.69/0.95 Prover9 interrupted
%------------------------------------------------------------------------------