TSTP Solution File: SYN170-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN170-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:17:00 EDT 2022
% Result : Unsatisfiable 1.36s 1.67s
% Output : Refutation 1.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN170-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 18:55:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.36/1.67 ============================== Prover9 ===============================
% 1.36/1.67 Prover9 (32) version 2009-11A, November 2009.
% 1.36/1.67 Process 6672 was started by sandbox2 on n014.cluster.edu,
% 1.36/1.67 Mon Jul 11 18:55:20 2022
% 1.36/1.67 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6519_n014.cluster.edu".
% 1.36/1.67 ============================== end of head ===========================
% 1.36/1.67
% 1.36/1.67 ============================== INPUT =================================
% 1.36/1.67
% 1.36/1.67 % Reading from file /tmp/Prover9_6519_n014.cluster.edu
% 1.36/1.67
% 1.36/1.67 set(prolog_style_variables).
% 1.36/1.67 set(auto2).
% 1.36/1.67 % set(auto2) -> set(auto).
% 1.36/1.67 % set(auto) -> set(auto_inference).
% 1.36/1.67 % set(auto) -> set(auto_setup).
% 1.36/1.67 % set(auto_setup) -> set(predicate_elim).
% 1.36/1.67 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.36/1.67 % set(auto) -> set(auto_limits).
% 1.36/1.67 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.36/1.67 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.36/1.67 % set(auto) -> set(auto_denials).
% 1.36/1.67 % set(auto) -> set(auto_process).
% 1.36/1.67 % set(auto2) -> assign(new_constants, 1).
% 1.36/1.67 % set(auto2) -> assign(fold_denial_max, 3).
% 1.36/1.67 % set(auto2) -> assign(max_weight, "200.000").
% 1.36/1.67 % set(auto2) -> assign(max_hours, 1).
% 1.36/1.67 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.36/1.67 % set(auto2) -> assign(max_seconds, 0).
% 1.36/1.67 % set(auto2) -> assign(max_minutes, 5).
% 1.36/1.67 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.36/1.67 % set(auto2) -> set(sort_initial_sos).
% 1.36/1.67 % set(auto2) -> assign(sos_limit, -1).
% 1.36/1.67 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.36/1.67 % set(auto2) -> assign(max_megs, 400).
% 1.36/1.67 % set(auto2) -> assign(stats, some).
% 1.36/1.67 % set(auto2) -> clear(echo_input).
% 1.36/1.67 % set(auto2) -> set(quiet).
% 1.36/1.67 % set(auto2) -> clear(print_initial_clauses).
% 1.36/1.67 % set(auto2) -> clear(print_given).
% 1.36/1.67 assign(lrs_ticks,-1).
% 1.36/1.67 assign(sos_limit,10000).
% 1.36/1.67 assign(order,kbo).
% 1.36/1.67 set(lex_order_vars).
% 1.36/1.67 clear(print_given).
% 1.36/1.67
% 1.36/1.67 % formulas(sos). % not echoed (363 formulas)
% 1.36/1.67
% 1.36/1.67 ============================== end of input ==========================
% 1.36/1.67
% 1.36/1.67 % From the command line: assign(max_seconds, 300).
% 1.36/1.67
% 1.36/1.67 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.36/1.67
% 1.36/1.67 % Formulas that are not ordinary clauses:
% 1.36/1.67
% 1.36/1.67 ============================== end of process non-clausal formulas ===
% 1.36/1.67
% 1.36/1.67 ============================== PROCESS INITIAL CLAUSES ===============
% 1.36/1.67
% 1.36/1.67 ============================== PREDICATE ELIMINATION =================
% 1.36/1.67
% 1.36/1.67 ============================== end predicate elimination =============
% 1.36/1.67
% 1.36/1.67 Auto_denials:
% 1.36/1.67 % copying label prove_this to answer in negative clause
% 1.36/1.67
% 1.36/1.67 Term ordering decisions:
% 1.36/1.67 Function symbol KB weights: true=1. b=1. e=1. d=1. c=1. a=1. p0=1. q0=1. l1=1. n0=1. l2=1. k2=1. l3=1. n5=1. q3=1. n4=1. q4=1. m4=1. q5=1. m5=1. s3=1. r5=1. r0=1. s0=1. l0=1. k1=1. k0=1. s1=1. r2=1. n2=1. s2=1. m2=1. r1=1. n3=1. s4=1. k4=1. l4=1. k5=1. r4=1. s5=1. l5=1. p2=1. m0=1. m1=1. n1=1. q1=1. p1=1. k3=1. q2=1. m3=1. r3=1. p3=1. p4=1. p5=1. ifeq=1.
% 1.36/1.67
% 1.36/1.67 ============================== end of process initial clauses ========
% 1.36/1.67
% 1.36/1.67 ============================== CLAUSES FOR SEARCH ====================
% 1.36/1.67
% 1.36/1.67 ============================== end of clauses for search =============
% 1.36/1.67
% 1.36/1.67 ============================== SEARCH ================================
% 1.36/1.67
% 1.36/1.67 % Starting search at 0.07 seconds.
% 1.36/1.67
% 1.36/1.67 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 30 (0.00 of 0.43 sec).
% 1.36/1.67
% 1.36/1.67 ============================== PROOF =================================
% 1.36/1.67 % SZS status Unsatisfiable
% 1.36/1.67 % SZS output start Refutation
% 1.36/1.67
% 1.36/1.67 % Proof 1 at 0.52 (+ 0.01) seconds: prove_this.
% 1.36/1.67 % Length of proof is 39.
% 1.36/1.67 % Level of proof is 13.
% 1.36/1.67 % Maximum clause weight is 23.000.
% 1.36/1.67 % Given clauses 742.
% 1.36/1.67
% 1.36/1.67 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 1.36/1.67 2 s0(d) = true # label(axiom_1) # label(axiom). [assumption].
% 1.36/1.67 3 true = s0(d). [copy(2),flip(a)].
% 1.36/1.67 10 s0(b) = true # label(axiom_5) # label(axiom). [assumption].
% 1.36/1.67 11 s0(d) = s0(b). [copy(10),rewrite([3(3)]),flip(a)].
% 1.36/1.67 18 r0(b) = true # label(axiom_9) # label(axiom). [assumption].
% 1.36/1.67 19 s0(b) = r0(b). [copy(18),rewrite([3(3),11(4)]),flip(a)].
% 1.36/1.67 34 q0(A,d) = true # label(axiom_17) # label(axiom). [assumption].
% 1.36/1.67 35 q0(A,d) = r0(b). [copy(34),rewrite([3(3),11(4),19(4)])].
% 1.36/1.67 38 m0(A,d,B) = true # label(axiom_19) # label(axiom). [assumption].
% 1.36/1.67 39 m0(A,d,B) = r0(b). [copy(38),rewrite([3(3),11(4),19(4)])].
% 1.36/1.67 285 ifeq(m0(A,B,C),true,q1(C,C,C),true) = true # label(rule_110) # label(axiom). [assumption].
% 1.36/1.67 286 ifeq(m0(A,B,C),r0(b),q1(C,C,C),r0(b)) = r0(b). [copy(285),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 1.36/1.67 311 ifeq(q1(d,A,d),true,ifeq(q0(B,A),true,ifeq(s0(d),true,r1(B),true),true),true) = true # label(rule_124) # label(axiom). [assumption].
% 1.36/1.67 312 ifeq(q1(d,A,d),r0(b),ifeq(q0(B,A),r0(b),r1(B),r0(b)),r0(b)) = r0(b). [copy(311),rewrite([3(4),11(5),19(5),3(7),11(8),19(8),11(10),19(10),3(11),11(12),19(12),3(14),11(15),19(15),1(16),3(10),11(11),19(11),3(13),11(14),19(14),3(16),11(17),19(17)])].
% 1.36/1.67 369 ifeq(q1(A,A,A),true,p2(A,A,A),true) = true # label(rule_154) # label(axiom). [assumption].
% 1.36/1.67 370 ifeq(q1(A,A,A),r0(b),p2(A,A,A),r0(b)) = r0(b). [copy(369),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 1.36/1.67 483 ifeq(p2(A,B,B),true,ifeq(r1(C),true,k3(C,C,C),true),true) = true # label(rule_213) # label(axiom). [assumption].
% 1.36/1.67 484 ifeq(p2(A,B,B),r0(b),ifeq(r1(C),r0(b),k3(C,C,C),r0(b)),r0(b)) = r0(b). [copy(483),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9),3(11),11(12),19(12),3(14),11(15),19(15)])].
% 1.36/1.67 627 ifeq(k3(A,A,B),true,p4(A,B,A),true) = true # label(rule_287) # label(axiom). [assumption].
% 1.36/1.67 628 ifeq(k3(A,A,B),r0(b),p4(A,B,A),r0(b)) = r0(b). [copy(627),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 1.36/1.67 715 p4(A,c,B) != true # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.36/1.67 716 p4(A,c,B) != r0(b) # answer(prove_this). [copy(715),rewrite([3(3),11(4),19(4)])].
% 1.36/1.67 963 q1(A,A,A) = r0(b). [para(39(a,1),286(a,1,1)),rewrite([1(8)])].
% 1.36/1.67 965 p2(A,A,A) = r0(b). [back_rewrite(370),rewrite([963(1),1(8)])].
% 1.36/1.67 984 r1(A) = r0(b). [para(35(a,1),312(a,1,3,1)),rewrite([963(4),1(12),1(8)])].
% 1.36/1.67 1696 ifeq(k3(A,A,B),r1(C),p4(A,B,A),r0(b)) = r0(b). [para(984(a,2),628(a,1,2))].
% 1.36/1.67 1873 p4(A,c,B) != r1(C) # answer(prove_this). [para(984(a,2),716(a,2))].
% 1.36/1.67 1877 r1(A) = r1(B). [para(984(a,2),984(a,2))].
% 1.36/1.67 1878 r1(A) = c_0. [new_symbol(1877)].
% 1.36/1.67 1882 p4(A,c,B) != c_0 # answer(prove_this). [back_rewrite(1873),rewrite([1878(3)])].
% 1.36/1.67 2057 ifeq(k3(A,A,B),c_0,p4(A,B,A),r0(b)) = r0(b). [back_rewrite(1696),rewrite([1878(2)])].
% 1.36/1.67 2622 r0(b) = c_0. [back_rewrite(984),rewrite([1878(1)]),flip(a)].
% 1.36/1.67 2625 ifeq(p2(A,B,B),c_0,k3(C,C,C),c_0) = c_0. [back_rewrite(484),rewrite([2622(3),1878(3),2622(5),2622(7),1(7),2622(5),2622(7)])].
% 1.36/1.67 2770 ifeq(k3(A,A,B),c_0,p4(A,B,A),c_0) = c_0. [back_rewrite(2057),rewrite([2622(5),2622(7)])].
% 1.36/1.67 2959 p2(A,A,A) = c_0. [back_rewrite(965),rewrite([2622(3)])].
% 1.36/1.67 3137 k3(A,A,A) = c_0. [para(2959(a,1),2625(a,1,1)),rewrite([1(5)])].
% 1.36/1.67 3689 p4(A,A,A) = c_0. [para(3137(a,1),2770(a,1,1)),rewrite([1(5)])].
% 1.36/1.67 3690 $F # answer(prove_this). [resolve(3689,a,1882,a)].
% 1.36/1.67
% 1.36/1.67 % SZS output end Refutation
% 1.36/1.67 ============================== end of proof ==========================
% 1.36/1.67
% 1.36/1.67 ============================== STATISTICS ============================
% 1.36/1.67
% 1.36/1.67 Given=742. Generated=6941. Kept=3327. proofs=1.
% 1.36/1.67 Usable=366. Sos=354. Demods=719. Limbo=0, Disabled=2969. Hints=0.
% 1.36/1.67 Megabytes=2.90.
% 1.36/1.67 User_CPU=0.52, System_CPU=0.01, Wall_clock=0.
% 1.36/1.67
% 1.36/1.67 ============================== end of statistics =====================
% 1.36/1.67
% 1.36/1.67 ============================== end of search =========================
% 1.36/1.67
% 1.36/1.67 THEOREM PROVED
% 1.36/1.67 % SZS status Unsatisfiable
% 1.36/1.67
% 1.36/1.67 Exiting with 1 proof.
% 1.36/1.67
% 1.36/1.67 Process 6672 exit (max_proofs) Mon Jul 11 18:55:20 2022
% 1.36/1.67 Prover9 interrupted
%------------------------------------------------------------------------------