TSTP Solution File: SYN654-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SYN654-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n018.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:21:41 EDT 2022

% Result   : Unsatisfiable 0.89s 1.22s
% Output   : Refutation 19.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN654-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n018.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 : Tue Jul 12 08:17:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.89/1.22  ============================== Prover9 ===============================
% 0.89/1.22  Prover9 (32) version 2009-11A, November 2009.
% 0.89/1.22  Process 1752 was started by sandbox on n018.cluster.edu,
% 0.89/1.22  Tue Jul 12 08:17:30 2022
% 0.89/1.22  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1589_n018.cluster.edu".
% 0.89/1.22  ============================== end of head ===========================
% 0.89/1.22  
% 0.89/1.22  ============================== INPUT =================================
% 0.89/1.22  
% 0.89/1.22  % Reading from file /tmp/Prover9_1589_n018.cluster.edu
% 0.89/1.22  
% 0.89/1.22  set(prolog_style_variables).
% 0.89/1.22  set(auto2).
% 0.89/1.22      % set(auto2) -> set(auto).
% 0.89/1.22      % set(auto) -> set(auto_inference).
% 0.89/1.22      % set(auto) -> set(auto_setup).
% 0.89/1.22      % set(auto_setup) -> set(predicate_elim).
% 0.89/1.22      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.89/1.22      % set(auto) -> set(auto_limits).
% 0.89/1.22      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.89/1.22      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.89/1.22      % set(auto) -> set(auto_denials).
% 0.89/1.22      % set(auto) -> set(auto_process).
% 0.89/1.22      % set(auto2) -> assign(new_constants, 1).
% 0.89/1.22      % set(auto2) -> assign(fold_denial_max, 3).
% 0.89/1.22      % set(auto2) -> assign(max_weight, "200.000").
% 0.89/1.22      % set(auto2) -> assign(max_hours, 1).
% 0.89/1.22      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.89/1.22      % set(auto2) -> assign(max_seconds, 0).
% 0.89/1.22      % set(auto2) -> assign(max_minutes, 5).
% 0.89/1.22      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.89/1.22      % set(auto2) -> set(sort_initial_sos).
% 0.89/1.22      % set(auto2) -> assign(sos_limit, -1).
% 0.89/1.22      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.89/1.22      % set(auto2) -> assign(max_megs, 400).
% 0.89/1.22      % set(auto2) -> assign(stats, some).
% 0.89/1.22      % set(auto2) -> clear(echo_input).
% 0.89/1.22      % set(auto2) -> set(quiet).
% 0.89/1.22      % set(auto2) -> clear(print_initial_clauses).
% 0.89/1.22      % set(auto2) -> clear(print_given).
% 0.89/1.22  assign(lrs_ticks,-1).
% 0.89/1.22  assign(sos_limit,10000).
% 0.89/1.22  assign(order,kbo).
% 0.89/1.22  set(lex_order_vars).
% 0.89/1.22  clear(print_given).
% 0.89/1.22  
% 0.89/1.22  % formulas(sos).  % not echoed (48 formulas)
% 0.89/1.22  
% 0.89/1.22  ============================== end of input ==========================
% 0.89/1.22  
% 0.89/1.22  % From the command line: assign(max_seconds, 300).
% 0.89/1.22  
% 0.89/1.22  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.89/1.22  
% 0.89/1.22  % Formulas that are not ordinary clauses:
% 0.89/1.22  
% 0.89/1.22  ============================== end of process non-clausal formulas ===
% 0.89/1.22  
% 0.89/1.22  ============================== PROCESS INITIAL CLAUSES ===============
% 0.89/1.22  
% 0.89/1.22  ============================== PREDICATE ELIMINATION =================
% 0.89/1.22  
% 0.89/1.22  ============================== end predicate elimination =============
% 0.89/1.22  
% 0.89/1.22  Auto_denials:
% 0.89/1.22    % copying label not_p8_10 to answer in negative clause
% 0.89/1.22    % copying label not_p3_25 to answer in negative clause
% 0.89/1.22    % assign(max_proofs, 2).  % (Horn set with more than one neg. clause)
% 0.89/1.22  
% 0.89/1.22  Term ordering decisions:
% 0.89/1.22  Function symbol KB weights:  c22=1. c23=1. c24=1. c25=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. c32=1. c33=1. f4=1. f13=1. f11=1. f15=1. f16=1. f17=1. f14=1. f18=1. f19=1. f20=1.
% 0.89/1.22  
% 0.89/1.22  ============================== end of process initial clauses ========
% 0.89/1.22  
% 0.89/1.22  ============================== CLAUSES FOR SEARCH ====================
% 0.89/1.22  
% 0.89/1.22  ============================== end of clauses for search =============
% 0.89/1.22  
% 0.89/1.22  ============================== SEARCH ================================
% 0.89/1.22  
% 0.89/1.22  % Starting search at 0.02 seconds.
% 0.89/1.22  
% 0.89/1.22  ============================== PROOF =================================
% 0.89/1.22  % SZS status Unsatisfiable
% 0.89/1.22  % SZS output start Refutation
% 0.89/1.22  
% 0.89/1.22  % Proof 1 at 0.25 (+ 0.01) seconds: not_p8_10.
% 0.89/1.22  % Length of proof is 17.
% 0.89/1.22  % Level of proof is 7.
% 0.89/1.22  % Maximum clause weight is 99.000.
% 0.89/1.22  % Given clauses 83.
% 0.89/1.22  
% 0.89/1.22  3 p8(A,A) # label(p8_3) # label(negated_conjecture).  [assumption].
% 0.89/1.22  10 p21(f11(c24,c25,c26,c22,c27,c28),f11(c29,c30,c31,c23,c32,c33)) # label(p21_27) # label(negated_conjecture).  [assumption].
% 0.89/1.22  11 -p8(c22,c23) # label(not_p8_10) # label(negated_conjecture) # answer(not_p8_10).  [assumption].
% 0.89/1.22  19 p8(A,B) | -p8(C,A) | -p8(C,B) # label(p8_18) # label(negated_conjecture).  [assumption].
% 0.89/1.22  30 p8(A,B) | -p3(f11(C,D,E,A,F,V6),f11(V7,V8,V9,B,V10,V11)) # label(p8_31) # label(negated_conjecture).  [assumption].
% 0.89/1.22  35 p8(A,f16(B,C,D,E,F,V6,A,V7)) | -p21(f11(C,D,V6,A,V7,E),F) # label(p8_36) # label(negated_conjecture).  [assumption].
% 0.89/1.22  46 p3(A,f11(f19(B,C,D,E,A,F,V6,V7),f18(
% 19.19/19.47  Fatal error:  renum_vars_recurse: too many variables
% 19.19/19.47  
% 19.19/19.47  B,C,D,E,A,F,V6,V7),f17(B,C,D,E,A,F,V6,V7),f16(B,C,D,E,A,F,V6,V7),f15(B,C,D,E,A,F,V6,V7),f14(B,C,D,E,A,F,V6,V7))) | -p21(f11(C,D,F,V6,V7,E),A) # label(p3_48) # label(negated_conjecture).  [assumption].
% 19.19/19.47  48 -p8(A,c22) | -p8(A,c23) # answer(not_p8_10).  [resolve(19,a,11,a)].
% 19.19/19.47  55 p8(c22,f16(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27)).  [ur(35,b,10,a)].
% 19.19/19.47  58 p3(f11(c29,c30,c31,c23,c32,c33),f11(f19(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27),f18(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27),f17(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27),f16(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27),f15(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27),f14(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27))).  [ur(46,b,10,a)].
% 19.19/19.47  62 -p8(A,c23) | -p8(B,A) | -p8(B,c22) # answer(not_p8_10).  [resolve(48,a,19,a)].
% 19.19/19.47  73 -p8(A,c23) | -p8(c22,A) # answer(not_p8_10).  [resolve(62,c,3,a)].
% 19.19/19.47  75 -p8(c22,A) | -p8(B,A) | -p8(B,c23) # answer(not_p8_10).  [resolve(73,a,19,a)].
% 19.19/19.47  166 -p8(c22,A) | -p8(c23,A) # answer(not_p8_10).  [resolve(75,c,3,a)].
% 19.19/19.47  242 -p8(c23,f16(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27)) # answer(not_p8_10).  [resolve(55,a,166,a)].
% 19.19/19.47  2508 p8(c23,f16(A,c24,c25,c28,f11(c29,c30,c31,c23,c32,c33),c26,c22,c27)).  [ur(30,b,58,a)].
% 19.19/19.47  2509 $F # answer(not_p8_10).  [resolve(2508,a,242,a)].
% 19.19/19.47  
% 19.19/19.47  % SZS output end Refutation
% 19.19/19.47  ============================== end of proof ==========================
% 19.19/19.47  
% 19.19/19.47  % Disable descendants (x means already disabled):
% 19.19/19.47   11 48 49 53 60 61 62 63 64 65
% 19.19/19.47   66 67 68 69 70 71 72 73 74 75
% 19.19/19.47   76 77 147 148 149 150 151 152 153 154
% 19.19/19.47   155 156 157 158 159 160 161 162 163 164
% 19.19/19.47   165 166 167 168 169 170 242 243 244 377
% 19.19/19.47   378 379 380 381 382 383 384 520 521 522
% 19.19/19.47   523 524 525 526 527 528 529 532 533 534
% 19.19/19.47   535 536 537 538 539 540 541 542 543 544
% 19.19/19.47   545 942 943 944 1207 1208 1209 1210 1211 1212
% 19.19/19.47   1213 1214 1215 1216 1217 1218 1219 1482 1483 1484
% 19.19/19.47   1485 1486 1487 1488 1489 1490 1491 1492 1493 1494
% 19.19/19.47   1495 1496 1497 1498 1499 1500 1501 1502 1503 1504
% 19.19/19.47   1505 1506 1507 1508 1509 1510 1511 1512 1513 1514
% 19.19/19.47   1515 1516 1517 1518 1519 1520 1521 1522 1523 1524
% 19.19/19.47   1525 1526 1527 1528 1529 1530 1531 1532 1533 1534
% 19.19/19.47   1535 1536 1537 1538 1539 1540 1541 1542 1543 1544
% 19.19/19.47   1545 1546 1547 1548 1549 1550 1551
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=109.000, iters=5427
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=95.000, iters=5420
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=81.000, iters=4851
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=70.000, iters=3631
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=69.000, iters=4101
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=67.000, iters=4236
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=61.000, iters=3478
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=58.000, iters=3368
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=57.000, iters=3336
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=56.000, iters=3393
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2515, wt=183.000
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2467, wt=152.000
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2468, wt=143.000
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2482, wt=138.000
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=47.000, iters=3645
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2483, wt=129.000
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2485, wt=124.000
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2486, wt=115.000
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2488, wt=113.000
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=2531, wt=99.000
% 19.19/19.47  
% 19.19/19.47  Low Water (displace): id=11243, wt=39.000
% 19.19/19.47  
% 19.19/19.47  Low Water (keep): wt=46.000, iters=3535
% 19.19/19.47  
% 19.19/19.47  Fatal error:  renum_vars_recurse: too many variables
% 19.19/19.47  
% 19.19/19.47  Prover9 interrupted
%------------------------------------------------------------------------------