TSTP Solution File: SYN116-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN116-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:36 EDT 2022
% Result : Unsatisfiable 1.43s 1.73s
% Output : Refutation 1.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN116-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 19:42:27 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.43/1.73 ============================== Prover9 ===============================
% 1.43/1.73 Prover9 (32) version 2009-11A, November 2009.
% 1.43/1.73 Process 21669 was started by sandbox on n011.cluster.edu,
% 1.43/1.73 Mon Jul 11 19:42:28 2022
% 1.43/1.73 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21509_n011.cluster.edu".
% 1.43/1.73 ============================== end of head ===========================
% 1.43/1.73
% 1.43/1.73 ============================== INPUT =================================
% 1.43/1.73
% 1.43/1.73 % Reading from file /tmp/Prover9_21509_n011.cluster.edu
% 1.43/1.73
% 1.43/1.73 set(prolog_style_variables).
% 1.43/1.73 set(auto2).
% 1.43/1.73 % set(auto2) -> set(auto).
% 1.43/1.73 % set(auto) -> set(auto_inference).
% 1.43/1.73 % set(auto) -> set(auto_setup).
% 1.43/1.73 % set(auto_setup) -> set(predicate_elim).
% 1.43/1.73 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.43/1.73 % set(auto) -> set(auto_limits).
% 1.43/1.73 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.43/1.73 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.43/1.73 % set(auto) -> set(auto_denials).
% 1.43/1.73 % set(auto) -> set(auto_process).
% 1.43/1.73 % set(auto2) -> assign(new_constants, 1).
% 1.43/1.73 % set(auto2) -> assign(fold_denial_max, 3).
% 1.43/1.73 % set(auto2) -> assign(max_weight, "200.000").
% 1.43/1.73 % set(auto2) -> assign(max_hours, 1).
% 1.43/1.73 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.43/1.73 % set(auto2) -> assign(max_seconds, 0).
% 1.43/1.73 % set(auto2) -> assign(max_minutes, 5).
% 1.43/1.73 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.43/1.73 % set(auto2) -> set(sort_initial_sos).
% 1.43/1.73 % set(auto2) -> assign(sos_limit, -1).
% 1.43/1.73 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.43/1.73 % set(auto2) -> assign(max_megs, 400).
% 1.43/1.73 % set(auto2) -> assign(stats, some).
% 1.43/1.73 % set(auto2) -> clear(echo_input).
% 1.43/1.73 % set(auto2) -> set(quiet).
% 1.43/1.73 % set(auto2) -> clear(print_initial_clauses).
% 1.43/1.73 % set(auto2) -> clear(print_given).
% 1.43/1.73 assign(lrs_ticks,-1).
% 1.43/1.73 assign(sos_limit,10000).
% 1.43/1.73 assign(order,kbo).
% 1.43/1.73 set(lex_order_vars).
% 1.43/1.73 clear(print_given).
% 1.43/1.73
% 1.43/1.73 % formulas(sos). % not echoed (363 formulas)
% 1.43/1.73
% 1.43/1.73 ============================== end of input ==========================
% 1.43/1.73
% 1.43/1.73 % From the command line: assign(max_seconds, 300).
% 1.43/1.73
% 1.43/1.73 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.43/1.73
% 1.43/1.73 % Formulas that are not ordinary clauses:
% 1.43/1.73
% 1.43/1.73 ============================== end of process non-clausal formulas ===
% 1.43/1.73
% 1.43/1.73 ============================== PROCESS INITIAL CLAUSES ===============
% 1.43/1.73
% 1.43/1.73 ============================== PREDICATE ELIMINATION =================
% 1.43/1.73
% 1.43/1.73 ============================== end predicate elimination =============
% 1.43/1.73
% 1.43/1.73 Auto_denials:
% 1.43/1.73 % copying label prove_this to answer in negative clause
% 1.43/1.73
% 1.43/1.73 Term ordering decisions:
% 1.43/1.73 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.43/1.73
% 1.43/1.73 ============================== end of process initial clauses ========
% 1.43/1.73
% 1.43/1.73 ============================== CLAUSES FOR SEARCH ====================
% 1.43/1.73
% 1.43/1.73 ============================== end of clauses for search =============
% 1.43/1.73
% 1.43/1.73 ============================== SEARCH ================================
% 1.43/1.73
% 1.43/1.73 % Starting search at 0.07 seconds.
% 1.43/1.73
% 1.43/1.73 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 30 (0.00 of 0.42 sec).
% 1.43/1.73
% 1.43/1.73 ============================== PROOF =================================
% 1.43/1.73 % SZS status Unsatisfiable
% 1.43/1.73 % SZS output start Refutation
% 1.43/1.73
% 1.43/1.73 % Proof 1 at 0.51 (+ 0.01) seconds: prove_this.
% 1.43/1.73 % Length of proof is 72.
% 1.43/1.73 % Level of proof is 16.
% 1.43/1.73 % Maximum clause weight is 22.000.
% 1.43/1.73 % Given clauses 764.
% 1.43/1.73
% 1.43/1.73 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 1.43/1.73 2 s0(d) = true # label(axiom_1) # label(axiom). [assumption].
% 1.43/1.73 3 true = s0(d). [copy(2),flip(a)].
% 1.43/1.73 10 s0(b) = true # label(axiom_5) # label(axiom). [assumption].
% 1.43/1.73 11 s0(d) = s0(b). [copy(10),rewrite([3(3)]),flip(a)].
% 1.43/1.73 18 r0(b) = true # label(axiom_9) # label(axiom). [assumption].
% 1.43/1.73 19 s0(b) = r0(b). [copy(18),rewrite([3(3),11(4)]),flip(a)].
% 1.43/1.73 22 n0(e,b) = true # label(axiom_11) # label(axiom). [assumption].
% 1.43/1.73 23 n0(e,b) = r0(b). [copy(22),rewrite([3(4),11(5),19(5)])].
% 1.43/1.73 28 p0(b,A) = true # label(axiom_14) # label(axiom). [assumption].
% 1.43/1.73 29 p0(b,A) = r0(b). [copy(28),rewrite([3(3),11(4),19(4)])].
% 1.43/1.73 34 q0(A,d) = true # label(axiom_17) # label(axiom). [assumption].
% 1.43/1.73 35 q0(A,d) = r0(b). [copy(34),rewrite([3(3),11(4),19(4)])].
% 1.43/1.73 38 m0(A,d,B) = true # label(axiom_19) # label(axiom). [assumption].
% 1.43/1.73 39 m0(A,d,B) = r0(b). [copy(38),rewrite([3(3),11(4),19(4)])].
% 1.43/1.73 58 n0(e,e) = true # label(axiom_30) # label(axiom). [assumption].
% 1.43/1.73 59 n0(e,e) = r0(b). [copy(58),rewrite([3(4),11(5),19(5)])].
% 1.43/1.73 76 ifeq(n0(A,B),true,k1(B),true) = true # label(rule_001) # label(axiom). [assumption].
% 1.43/1.73 77 ifeq(n0(A,B),r0(b),k1(B),r0(b)) = r0(b). [copy(76),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 1.43/1.73 78 ifeq(n0(A,B),true,l1(B,B),true) = true # label(rule_002) # label(axiom). [assumption].
% 1.43/1.73 79 ifeq(n0(A,B),r0(b),l1(B,B),r0(b)) = r0(b). [copy(78),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 1.43/1.73 157 ifeq(p0(A,A),true,ifeq(k1(A),true,n1(A,A,A),true),true) = true # label(rule_043) # label(axiom). [assumption].
% 1.43/1.73 158 ifeq(p0(A,A),r0(b),ifeq(k1(A),r0(b),n1(A,A,A),r0(b)),r0(b)) = r0(b). [copy(157),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.43/1.73 237 ifeq(p0(A,B),true,p1(B,B,B),true) = true # label(rule_085) # label(axiom). [assumption].
% 1.43/1.73 238 ifeq(p0(A,B),r0(b),p1(B,B,B),r0(b)) = r0(b). [copy(237),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 1.43/1.73 285 ifeq(m0(A,B,C),true,q1(C,C,C),true) = true # label(rule_110) # label(axiom). [assumption].
% 1.43/1.73 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.43/1.73 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.43/1.73 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.43/1.73 335 ifeq(p1(A,B,C),true,n2(C),true) = true # label(rule_137) # label(axiom). [assumption].
% 1.43/1.73 336 ifeq(p1(A,B,C),r0(b),n2(C),r0(b)) = r0(b). [copy(335),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 1.43/1.73 545 ifeq(n2(A),true,p3(A,A,A),true) = true # label(rule_244) # label(axiom). [assumption].
% 1.43/1.73 546 ifeq(n2(A),r0(b),p3(A,A,A),r0(b)) = r0(b). [copy(545),rewrite([3(2),11(3),19(3),3(5),11(6),19(6),3(8),11(9),19(9)])].
% 1.43/1.73 651 ifeq(p3(A,B,C),true,ifeq(l1(D,B),true,s4(D),true),true) = true # label(rule_299) # label(axiom). [assumption].
% 1.43/1.73 652 ifeq(p3(A,B,C),r0(b),ifeq(l1(D,B),r0(b),s4(D),r0(b)),r0(b)) = r0(b). [copy(651),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.43/1.73 655 ifeq(s4(e),true,ifeq(n1(b,b,b),true,k5(b),true),true) = true # label(rule_301) # label(axiom). [assumption].
% 1.43/1.73 656 ifeq(s4(e),r0(b),ifeq(n1(b,b,b),r0(b),k5(b),r0(b)),r0(b)) = r0(b). [copy(655),rewrite([3(3),11(4),19(4),3(9),11(10),19(10),3(13),11(14),19(14),3(16),11(17),19(17),3(19),11(20),19(20)])].
% 1.43/1.73 715 k5(b) != true # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.43/1.73 716 k5(b) != r0(b) # answer(prove_this). [copy(715),rewrite([3(3),11(4),19(4)])].
% 1.43/1.73 724 k5(b) = c_0. [new_symbol(716)].
% 1.43/1.73 725 r0(b) != c_0 # answer(prove_this). [back_rewrite(716),rewrite([724(2)]),flip(a)].
% 1.43/1.73 727 ifeq(s4(e),r0(b),ifeq(n1(b,b,b),r0(b),c_0,r0(b)),r0(b)) = r0(b). [back_rewrite(656),rewrite([724(12)])].
% 1.43/1.73 728 k1(b) = r0(b). [para(23(a,1),77(a,1,1)),rewrite([1(9)])].
% 1.43/1.73 741 l1(e,e) = r0(b). [para(59(a,1),79(a,1,1)),rewrite([1(10)])].
% 1.43/1.73 825 n1(b,b,b) = r0(b). [para(29(a,1),158(a,1,1)),rewrite([728(6),1(15),1(11)])].
% 1.43/1.73 827 ifeq(s4(e),r0(b),c_0,r0(b)) = r0(b). [back_rewrite(727),rewrite([825(8),1(12)])].
% 1.43/1.73 917 p1(A,A,A) = r0(b). [para(29(a,1),238(a,1,1)),rewrite([1(8)])].
% 1.43/1.73 967 q1(A,A,A) = r0(b). [para(39(a,1),286(a,1,1)),rewrite([1(8)])].
% 1.43/1.73 988 r1(A) = r0(b). [para(35(a,1),312(a,1,3,1)),rewrite([967(4),1(12),1(8)])].
% 1.43/1.73 1315 ifeq(p1(A,B,C),r1(D),n2(C),r0(b)) = r0(b). [para(988(a,2),336(a,1,2))].
% 1.43/1.73 1547 ifeq(n2(A),r1(B),p3(A,A,A),r0(b)) = r0(b). [para(988(a,2),546(a,1,2))].
% 1.43/1.73 1758 ifeq(p3(A,B,C),r1(D),ifeq(l1(E,B),r0(b),s4(E),r0(b)),r0(b)) = r0(b). [para(988(a,2),652(a,1,2))].
% 1.43/1.73 1877 r1(A) != c_0 # answer(prove_this). [para(988(a,2),725(a,1))].
% 1.43/1.73 1882 r1(A) = r1(B). [para(988(a,2),988(a,2))].
% 1.43/1.73 1883 r1(A) = c_1. [new_symbol(1882)].
% 1.43/1.73 1888 c_1 != c_0 # answer(prove_this). [back_rewrite(1877),rewrite([1883(1)])].
% 1.43/1.73 2007 ifeq(p3(A,B,C),c_1,ifeq(l1(D,B),r0(b),s4(D),r0(b)),r0(b)) = r0(b). [back_rewrite(1758),rewrite([1883(2)])].
% 1.43/1.73 2216 ifeq(n2(A),c_1,p3(A,A,A),r0(b)) = r0(b). [back_rewrite(1547),rewrite([1883(2)])].
% 1.43/1.73 2444 ifeq(p1(A,B,C),c_1,n2(C),r0(b)) = r0(b). [back_rewrite(1315),rewrite([1883(2)])].
% 1.43/1.73 2627 r0(b) = c_1. [back_rewrite(988),rewrite([1883(1)]),flip(a)].
% 1.43/1.73 2681 ifeq(p1(A,B,C),c_1,n2(C),c_1) = c_1. [back_rewrite(2444),rewrite([2627(5),2627(7)])].
% 1.43/1.73 2737 ifeq(n2(A),c_1,p3(A,A,A),c_1) = c_1. [back_rewrite(2216),rewrite([2627(5),2627(7)])].
% 1.43/1.73 2786 ifeq(p3(A,B,C),c_1,ifeq(l1(D,B),c_1,s4(D),c_1),c_1) = c_1. [back_rewrite(2007),rewrite([2627(5),2627(7),2627(9),2627(11)])].
% 1.43/1.73 3000 p1(A,A,A) = c_1. [back_rewrite(917),rewrite([2627(3)])].
% 1.43/1.73 3037 ifeq(s4(e),c_1,c_0,c_1) = c_1. [back_rewrite(827),rewrite([2627(4),2627(6),2627(8)])].
% 1.43/1.73 3094 l1(e,e) = c_1. [back_rewrite(741),rewrite([2627(5)])].
% 1.43/1.73 3227 n2(A) = c_1. [para(3000(a,1),2681(a,1,1)),rewrite([1(5)])].
% 1.43/1.73 3232 p3(A,A,A) = c_1. [back_rewrite(2737),rewrite([3227(1),1(5)])].
% 1.43/1.73 3736 ifeq(l1(A,B),c_1,s4(A),c_1) = c_1. [para(3232(a,1),2786(a,1,1)),rewrite([1(9)])].
% 1.43/1.73 3739 s4(e) = c_1. [para(3094(a,1),3736(a,1,1)),rewrite([1(6)])].
% 1.43/1.73 3743 c_1 = c_0. [back_rewrite(3037),rewrite([3739(2),1(5)]),flip(a)].
% 1.43/1.73 3744 $F # answer(prove_this). [resolve(3743,a,1888,a)].
% 1.43/1.73
% 1.43/1.73 % SZS output end Refutation
% 1.43/1.73 ============================== end of proof ==========================
% 1.43/1.73
% 1.43/1.73 ============================== STATISTICS ============================
% 1.43/1.73
% 1.43/1.73 Given=764. Generated=7118. Kept=3381. proofs=1.
% 1.43/1.73 Usable=383. Sos=358. Demods=744. Limbo=4, Disabled=2998. Hints=0.
% 1.43/1.73 Megabytes=2.93.
% 1.43/1.73 User_CPU=0.52, System_CPU=0.01, Wall_clock=1.
% 1.43/1.73
% 1.43/1.73 ============================== end of statistics =====================
% 1.43/1.73
% 1.43/1.73 ============================== end of search =========================
% 1.43/1.73
% 1.43/1.73 THEOREM PROVED
% 1.43/1.73 % SZS status Unsatisfiable
% 1.43/1.73
% 1.43/1.73 Exiting with 1 proof.
% 1.43/1.73
% 1.43/1.73 Process 21669 exit (max_proofs) Mon Jul 11 19:42:29 2022
% 1.43/1.73 Prover9 interrupted
%------------------------------------------------------------------------------