TSTP Solution File: LAT394-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Sun Jul 17 06:28:36 EDT 2022
% Result : Unsatisfiable 1.66s 1.95s
% Output : Refutation 1.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 28 19:47:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.66/1.95 ============================== Prover9 ===============================
% 1.66/1.95 Prover9 (32) version 2009-11A, November 2009.
% 1.66/1.95 Process 24027 was started by sandbox2 on n021.cluster.edu,
% 1.66/1.95 Tue Jun 28 19:47:57 2022
% 1.66/1.95 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23874_n021.cluster.edu".
% 1.66/1.95 ============================== end of head ===========================
% 1.66/1.95
% 1.66/1.95 ============================== INPUT =================================
% 1.66/1.95
% 1.66/1.95 % Reading from file /tmp/Prover9_23874_n021.cluster.edu
% 1.66/1.95
% 1.66/1.95 set(prolog_style_variables).
% 1.66/1.95 set(auto2).
% 1.66/1.95 % set(auto2) -> set(auto).
% 1.66/1.95 % set(auto) -> set(auto_inference).
% 1.66/1.95 % set(auto) -> set(auto_setup).
% 1.66/1.95 % set(auto_setup) -> set(predicate_elim).
% 1.66/1.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.66/1.95 % set(auto) -> set(auto_limits).
% 1.66/1.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.66/1.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.66/1.95 % set(auto) -> set(auto_denials).
% 1.66/1.95 % set(auto) -> set(auto_process).
% 1.66/1.95 % set(auto2) -> assign(new_constants, 1).
% 1.66/1.95 % set(auto2) -> assign(fold_denial_max, 3).
% 1.66/1.95 % set(auto2) -> assign(max_weight, "200.000").
% 1.66/1.95 % set(auto2) -> assign(max_hours, 1).
% 1.66/1.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.66/1.95 % set(auto2) -> assign(max_seconds, 0).
% 1.66/1.95 % set(auto2) -> assign(max_minutes, 5).
% 1.66/1.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.66/1.95 % set(auto2) -> set(sort_initial_sos).
% 1.66/1.95 % set(auto2) -> assign(sos_limit, -1).
% 1.66/1.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.66/1.95 % set(auto2) -> assign(max_megs, 400).
% 1.66/1.95 % set(auto2) -> assign(stats, some).
% 1.66/1.95 % set(auto2) -> clear(echo_input).
% 1.66/1.95 % set(auto2) -> set(quiet).
% 1.66/1.95 % set(auto2) -> clear(print_initial_clauses).
% 1.66/1.95 % set(auto2) -> clear(print_given).
% 1.66/1.95 assign(lrs_ticks,-1).
% 1.66/1.95 assign(sos_limit,10000).
% 1.66/1.95 assign(order,kbo).
% 1.66/1.95 set(lex_order_vars).
% 1.66/1.95 clear(print_given).
% 1.66/1.95
% 1.66/1.95 % formulas(sos). % not echoed (5 formulas)
% 1.66/1.95
% 1.66/1.95 ============================== end of input ==========================
% 1.66/1.95
% 1.66/1.95 % From the command line: assign(max_seconds, 300).
% 1.66/1.95
% 1.66/1.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.66/1.95
% 1.66/1.95 % Formulas that are not ordinary clauses:
% 1.66/1.95
% 1.66/1.95 ============================== end of process non-clausal formulas ===
% 1.66/1.95
% 1.66/1.95 ============================== PROCESS INITIAL CLAUSES ===============
% 1.66/1.95
% 1.66/1.95 ============================== PREDICATE ELIMINATION =================
% 1.66/1.95
% 1.66/1.95 ============================== end predicate elimination =============
% 1.66/1.95
% 1.66/1.95 Auto_denials:
% 1.66/1.95 % copying label goals to answer in negative clause
% 1.66/1.95
% 1.66/1.95 Term ordering decisions:
% 1.66/1.95
% 1.66/1.95 % Assigning unary symbol neg kb_weight 0 and highest precedence (7).
% 1.66/1.95 Function symbol KB weights: x0=1. x1=1. f=1. and=1. or=1. neg=0.
% 1.66/1.95
% 1.66/1.95 ============================== end of process initial clauses ========
% 1.66/1.95
% 1.66/1.95 ============================== CLAUSES FOR SEARCH ====================
% 1.66/1.95
% 1.66/1.95 ============================== end of clauses for search =============
% 1.66/1.95
% 1.66/1.95 ============================== SEARCH ================================
% 1.66/1.95
% 1.66/1.95 % Starting search at 0.01 seconds.
% 1.66/1.95
% 1.66/1.95 ============================== PROOF =================================
% 1.66/1.95 % SZS status Unsatisfiable
% 1.66/1.95 % SZS output start Refutation
% 1.66/1.95
% 1.66/1.95 % Proof 1 at 0.99 (+ 0.00) seconds: goals.
% 1.66/1.95 % Length of proof is 52.
% 1.66/1.95 % Level of proof is 23.
% 1.66/1.95 % Maximum clause weight is 149.000.
% 1.66/1.95 % Given clauses 61.
% 1.66/1.95
% 1.66/1.95 2 or(A,B) = f(f(A,A),f(B,B)) # label(sos_001) # label(axiom). [assumption].
% 1.66/1.95 4 f(f(f(f(A,B),f(B,C)),D),f(B,f(f(B,f(f(A,A),A)),C))) = B # label(sos) # label(axiom). [assumption].
% 1.66/1.95 5 f(x0,f(x0,x0)) != f(x1,f(x1,x1)) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 1.66/1.95 6 f(x1,f(x1,x1)) != f(x0,f(x0,x0)) # answer(goals). [copy(5),flip(a)].
% 1.66/1.95 7 f(f(f(A,f(f(A,f(f(A,f(f(B,B),B)),C)),D)),E),f(f(A,f(f(A,f(f(B,B),B)),C)),f(f(f(A,f(f(A,f(f(B,B),B)),C)),f(f(f(f(f(B,A),f(A,C)),F),f(f(f(B,A),f(A,C)),F)),f(f(f(B,A),f(A,C)),F))),D))) = f(A,f(f(A,f(f(B,B),B)),C)). [para(4(a,1),4(a,1,1,1,1))].
% 1.66/1.95 8 f(f(f(f(A,f(f(f(B,C),f(C,D)),E)),C),F),f(f(f(f(B,C),f(C,D)),E),f(f(f(f(f(B,C),f(C,D)),E),f(f(A,A),A)),f(C,f(f(C,f(f(B,B),B)),D))))) = f(f(f(B,C),f(C,D)),E). [para(4(a,1),4(a,1,1,1,2))].
% 1.66/1.95 10 f(A,f(f(A,B),f(f(f(A,B),f(f(f(C,A),f(C,A)),f(C,A))),D))) = f(A,B). [para(4(a,1),4(a,1,1))].
% 1.66/1.95 12 f(f(f(f(A,f(f(B,f(f(B,f(f(B,f(f(C,C),C)),D)),E)),F)),f(B,f(f(B,f(f(C,C),C)),D))),V6),f(f(f(B,f(f(B,f(f(B,f(f(C,C),C)),D)),E)),F),f(f(f(f(B,f(f(B,f(f(B,f(f(C,C),C)),D)),E)),F),f(f(A,A),A)),f(f(B,f(f(B,f(f(C,C),C)),D)),f(f(f(B,f(f(B,f(f(C,C),C)),D)),f(f(f(f(f(C,B),f(B,D)),V7),f(f(f(C,B),f(B,D)),V7)),f(f(f(C,B),f(B,D)),V7))),E))))) = f(f(B,f(f(B,f(f(B,f(f(C,C),C)),D)),E)),F). [para(7(a,1),4(a,1,1,1,2))].
% 1.66/1.95 23 f(f(f(f(A,B),f(B,f(f(f(B,f(f(A,A),A)),C),f(f(f(f(B,f(f(A,A),A)),C),f(f(f(D,f(B,f(f(A,A),A))),f(D,f(B,f(f(A,A),A)))),f(D,f(B,f(f(A,A),A))))),E)))),F),f(B,f(f(B,f(f(A,A),A)),C))) = B. [para(10(a,1),4(a,1,2,2))].
% 1.66/1.95 24 f(f(f(f(A,B),f(B,f(f(f(B,f(f(A,A),A)),f(f(f(C,B),f(C,B)),f(C,B))),D))),E),f(B,f(f(A,A),A))) = B. [para(10(a,1),4(a,1,2))].
% 1.66/1.95 26 f(f(A,B),f(f(f(A,B),f(B,C)),B)) = f(f(A,B),f(B,C)). [para(4(a,1),10(a,1,2,2))].
% 1.66/1.95 40 f(f(f(f(A,B),f(B,C)),B),f(B,B)) = B. [para(4(a,1),26(a,1,2,1)),rewrite([4(16)])].
% 1.66/1.95 54 f(f(A,A),f(A,A)) = A. [para(4(a,1),40(a,1,1,1))].
% 1.66/1.95 65 f(f(A,B),f(A,f(f(A,f(f(A,A),A)),A))) = A. [para(54(a,1),4(a,1,1,1))].
% 1.66/1.95 105 f(f(f(f(A,f(B,C)),B),D),f(f(B,C),f(f(f(B,C),f(f(A,A),A)),f(B,f(f(B,f(f(B,B),B)),B))))) = f(B,C). [para(54(a,1),8(a,1,1,1,1,2,1)),rewrite([54(7),54(8),54(20)])].
% 1.66/1.95 140 f(A,f(f(A,B),f(A,B))) = f(A,B). [para(65(a,1),10(a,1,2,2))].
% 1.66/1.95 141 f(A,f(f(A,f(f(A,f(f(A,A),A)),A)),B)) = f(A,A). [para(65(a,1),26(a,1,1)),rewrite([65(7),65(13),65(8)]),flip(a)].
% 1.66/1.95 143 f(A,f(f(A,f(f(A,A),A)),A)) = f(A,A). [para(65(a,1),40(a,1,1,1,1)),rewrite([141(7),65(7),65(11)]),flip(a)].
% 1.66/1.95 166 f(A,f(f(A,A),B)) = f(A,A). [back_rewrite(141),rewrite([143(5)])].
% 1.66/1.95 175 f(f(f(f(A,f(B,C)),B),D),f(f(B,C),f(f(f(B,C),f(f(A,A),A)),f(B,B)))) = f(B,C). [back_rewrite(105),rewrite([166(12),166(12)])].
% 1.66/1.95 176 f(f(A,B),f(A,A)) = A. [back_rewrite(65),rewrite([166(4),166(4)])].
% 1.66/1.95 192 f(f(f(A,A),B),A) = f(A,A). [para(176(a,1),176(a,1,2))].
% 1.66/1.95 223 f(f(A,A),f(A,B)) = A. [para(176(a,1),166(a,1,2,1)),rewrite([176(6)])].
% 1.66/1.95 289 f(f(f(A,B),f(A,B)),A) = f(A,B). [para(176(a,1),223(a,1,2))].
% 1.66/1.95 366 f(f(f(f(A,B),f(B,C)),D),f(B,B)) = B. [para(4(a,1),140(a,1,2,1)),rewrite([4(14),4(16)])].
% 1.66/1.95 384 f(f(A,A),f(f(f(B,A),f(A,C)),D)) = A. [para(4(a,1),289(a,1,1,1)),rewrite([4(10),4(16)])].
% 1.66/1.95 449 f(f(A,B),f(B,B)) = B. [para(176(a,1),366(a,1,1))].
% 1.66/1.95 483 f(A,f(f(B,A),f(B,A))) = f(B,A). [para(449(a,1),176(a,1,1))].
% 1.66/1.95 484 f(f(A,f(B,B)),B) = f(B,B). [para(176(a,1),449(a,1,2))].
% 1.66/1.95 486 f(f(A,A),f(B,A)) = A. [para(449(a,1),289(a,1,1,1)),rewrite([449(3),449(6)])].
% 1.66/1.95 516 f(A,f(B,f(A,A))) = f(A,A). [para(486(a,1),8(a,2)),rewrite([223(3),223(9),223(12),166(18),166(18),175(19)])].
% 1.66/1.95 530 f(f(A,f(f(A,f(f(B,B),B)),C)),f(A,f(f(A,f(f(B,B),B)),C))) = A. [para(484(a,1),4(a,1))].
% 1.66/1.95 671 f(f(f(f(A,B),f(C,B)),D),f(B,B)) = B. [para(483(a,1),366(a,1,1,1,2))].
% 1.66/1.95 695 f(A,f(f(A,f(f(A,f(f(B,B),B)),C)),D)) = f(A,f(f(A,f(f(B,B),B)),C)). [para(7(a,1),384(a,1,2,1)),rewrite([530(11)])].
% 1.66/1.95 710 f(f(A,B),f(A,f(f(A,f(f(C,C),C)),D))) = A. [para(384(a,1),12(a,1,2,2,1)),rewrite([695(7),695(12),530(11),695(7),695(12),530(11),223(7),695(8),695(13),530(12),695(8),695(35),695(14),695(19),530(18)])].
% 1.66/1.95 716 f(f(A,A),f(f(f(B,A),f(C,A)),D)) = A. [para(483(a,1),384(a,1,2,1,2))].
% 1.66/1.95 924 f(A,f(f(A,f(f(B,B),B)),C)) = f(A,A). [para(23(a,1),449(a,1,1)),rewrite([710(11)]),flip(a)].
% 1.66/1.95 1020 f(A,f(f(f(B,f(A,A)),f(C,f(A,A))),D)) = f(A,A). [para(176(a,1),716(a,1,1))].
% 1.66/1.95 1102 f(f(f(f(A,f(B,f(f(f(A,A),A),f(f(A,A),A)))),f(f(B,f(f(f(A,A),A),f(f(A,A),A))),f(f(f(f(f(A,A),A),f(f(A,A),A)),f(f(f(C,f(B,f(f(f(A,A),A),f(f(A,A),A)))),f(C,f(B,f(f(f(A,A),A),f(f(A,A),A))))),f(C,f(B,f(f(f(A,A),A),f(f(A,A),A)))))),D))),E),f(f(f(A,A),A),f(f(A,A),A))) = f(B,f(f(f(A,A),A),f(f(A,A),A))). [para(484(a,1),24(a,1,1,1,2,2,1,1)),rewrite([484(55)])].
% 1.66/1.95 1105 f(f(A,B),f(A,f(f(C,C),C))) = A. [para(516(a,1),24(a,1,1,1,2)),rewrite([449(3)])].
% 1.66/1.95 1108 f(A,f(f(B,B),B)) = f(A,A). [para(24(a,1),384(a,1,2,1,1)),rewrite([1105(7),924(5),166(3)]),flip(a)].
% 1.66/1.95 1115 f(f(A,B),f(f(f(C,C),C),f(f(C,C),C))) = f(f(C,C),C). [para(24(a,1),671(a,1,1,1))].
% 1.66/1.95 1122 f(f(f(f(A,A),A),f(f(A,A),A)),f(B,C)) = f(f(A,A),A). [para(24(a,1),716(a,1,2,1))].
% 1.66/1.95 1131 f(f(f(f(A,A),A),f(f(A,A),A)),B) = f(f(A,A),A). [para(24(a,1),24(a,1,1,1,2,2,1,1)),rewrite([483(8),1122(17),1020(32),1122(16),166(9),483(11),1122(20),1020(35),1122(19),483(22),1122(31),1020(46),1122(30),483(29),1122(38),1020(53),1122(37),483(37),1122(46),1020(61),1122(45),1122(40),1122(16),483(9),1122(18),1020(33),1122(17),1122(17),192(12),176(9),483(8),1122(17),1020(32),1122(16)]),flip(a)].
% 1.66/1.95 1134 f(A,f(f(f(B,B),B),f(f(B,B),B))) = f(f(B,B),B). [back_rewrite(1102),rewrite([1131(42),1115(25)]),flip(a)].
% 1.66/1.95 1152 f(f(f(A,A),A),B) = f(B,B). [para(1108(a,1),483(a,2)),rewrite([1105(9)])].
% 1.66/1.95 1276 f(f(f(A,A),A),f(f(A,A),A)) = f(f(f(B,B),B),f(f(B,B),B)). [para(1152(a,1),1108(a,1))].
% 1.66/1.95 1288 f(f(f(A,A),A),f(f(A,A),A)) = c_0. [new_symbol(1276)].
% 1.66/1.95 1290 f(f(A,A),A) = f(B,c_0). [back_rewrite(1134),rewrite([1288(5)]),flip(a)].
% 1.66/1.95 1628 f(A,f(A,A)) = f(B,c_0). [para(1290(a,1),2(a,2)),rewrite([2(2),223(3)])].
% 1.66/1.95 2008 f(x0,f(x0,x0)) != f(A,c_0) # answer(goals). [para(1628(a,1),6(a,1)),flip(a)].
% 1.66/1.95 2009 $F # answer(goals). [resolve(2008,a,1628,a)].
% 1.66/1.95
% 1.66/1.95 % SZS output end Refutation
% 1.66/1.95 ============================== end of proof ==========================
% 1.66/1.95
% 1.66/1.95 ============================== STATISTICS ============================
% 1.66/1.95
% 1.66/1.95 Given=61. Generated=9776. Kept=2007. proofs=1.
% 1.66/1.95 Usable=42. Sos=910. Demods=779. Limbo=3, Disabled=1056. Hints=0.
% 1.66/1.95 Megabytes=4.44.
% 1.66/1.95 User_CPU=0.99, System_CPU=0.00, Wall_clock=1.
% 1.66/1.95
% 1.66/1.95 ============================== end of statistics =====================
% 1.66/1.95
% 1.66/1.95 ============================== end of search =========================
% 1.66/1.95
% 1.66/1.95 THEOREM PROVED
% 1.66/1.95 % SZS status Unsatisfiable
% 1.66/1.95
% 1.66/1.95 Exiting with 1 proof.
% 1.66/1.95
% 1.66/1.95 Process 24027 exit (max_proofs) Tue Jun 28 19:47:58 2022
% 1.66/1.95 Prover9 interrupted
%------------------------------------------------------------------------------