TSTP Solution File: SYN039-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN039-1 : 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.73s 1.16s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN039-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 16:33:29 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.68/0.96 ============================== Prover9 ===============================
% 0.68/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.96 Process 13176 was started by sandbox on n028.cluster.edu,
% 0.68/0.96 Mon Jul 11 16:33:29 2022
% 0.68/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13022_n028.cluster.edu".
% 0.68/0.96 ============================== end of head ===========================
% 0.68/0.96
% 0.68/0.96 ============================== INPUT =================================
% 0.68/0.96
% 0.68/0.96 % Reading from file /tmp/Prover9_13022_n028.cluster.edu
% 0.68/0.96
% 0.68/0.96 set(prolog_style_variables).
% 0.68/0.96 set(auto2).
% 0.68/0.96 % set(auto2) -> set(auto).
% 0.68/0.96 % set(auto) -> set(auto_inference).
% 0.68/0.96 % set(auto) -> set(auto_setup).
% 0.68/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.96 % set(auto) -> set(auto_limits).
% 0.68/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.96 % set(auto) -> set(auto_denials).
% 0.68/0.96 % set(auto) -> set(auto_process).
% 0.68/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.96 % set(auto2) -> assign(stats, some).
% 0.68/0.96 % set(auto2) -> clear(echo_input).
% 0.68/0.96 % set(auto2) -> set(quiet).
% 0.68/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.96 % set(auto2) -> clear(print_given).
% 0.68/0.96 assign(lrs_ticks,-1).
% 0.68/0.96 assign(sos_limit,10000).
% 0.68/0.96 assign(order,kbo).
% 0.68/0.96 set(lex_order_vars).
% 0.68/0.96 clear(print_given).
% 0.68/0.96
% 0.68/0.96 % formulas(sos). % not echoed (27 formulas)
% 0.68/0.96
% 0.68/0.96 ============================== end of input ==========================
% 0.68/0.96
% 0.68/0.96 % From the command line: assign(max_seconds, 300).
% 0.68/0.96
% 0.68/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.96
% 0.68/0.96 % Formulas that are not ordinary clauses:
% 0.68/0.96
% 0.68/0.96 ============================== end of process non-clausal formulas ===
% 0.68/0.96
% 0.68/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.96
% 0.68/0.96 ============================== PREDICATE ELIMINATION =================
% 0.68/0.96 1 -p(A,A) | -q(B,B) | -s(C,C) # label(c_18) # label(negated_conjecture). [assumption].
% 0.68/0.96 2 p(f1(A,B),f1(A,B)) | s(f1(A,B),C) | q(f1(A,B),D) # label(c_5) # label(negated_conjecture). [assumption].
% 0.68/0.96 3 -p(A,A) | -s(A,f1(A,B)) | -s(B,B) # label(c_12) # label(negated_conjecture). [assumption].
% 0.68/0.96 Derived: -s(f1(A,B),f1(f1(A,B),C)) | -s(C,C) | s(f1(A,B),D) | q(f1(A,B),E). [resolve(3,a,2,a)].
% 0.68/0.96 4 -p(A,A) | -q(B,B) | -q(C,f1(A,C)) # label(c_16) # label(negated_conjecture). [assumption].
% 0.68/0.96 Derived: -q(A,A) | -q(B,f1(f1(C,D),B)) | s(f1(C,D),E) | q(f1(C,D),F). [resolve(4,a,2,a)].
% 0.68/0.96 5 -p(A,A) | -s(A,f1(A,B)) | -q(B,f1(A,B)) # label(c_10) # label(negated_conjecture). [assumption].
% 0.68/0.96 Derived: -s(f1(A,B),f1(f1(A,B),C)) | -q(C,f1(f1(A,B),C)) | s(f1(A,B),D) | q(f1(A,B),E). [resolve(5,a,2,a)].
% 0.68/0.96 6 -p(A,A) | s(f1(A,B),C) | -s(B,B) # label(c_15) # label(negated_conjecture). [assumption].
% 0.68/0.96 Derived: s(f1(f1(A,B),C),D) | -s(C,C) | s(f1(A,B),E) | q(f1(A,B),F). [resolve(6,a,2,a)].
% 0.68/0.96 7 -p(A,A) | -q(B,B) | q(f1(A,C),B) # label(c_17) # label(negated_conjecture). [assumption].
% 0.68/0.96 Derived: -q(A,A) | q(f1(f1(B,C),D),A) | s(f1(B,C),E) | q(f1(B,C),F). [resolve(7,a,2,a)].
% 0.68/0.96 8 p(f1(A,B),f1(A,B)) | -q(C,C) | -s(B,B) # label(c_9) # label(negated_conjecture). [assumption].
% 0.68/0.96 Derived: -q(A,A) | -s(B,B) | -q(C,C) | -s(D,D). [resolve(8,a,1,a)].
% 0.68/0.96 9 -p(A,A) | -s(A,f1(A,B)) | q(f1(A,B),C) # label(c_11) # label(negated_conjecture). [assumption].
% 0.68/0.96 Derived: -s(f1(A,B),f1(f1(A,B),C)) | q(f1(f1(A,B),C),D) | s(f1(A,B),E) | q(f1(A,B),F). [resolve(9,a,2,a)].
% 0.68/0.96 10 -p(A,A) | s(f1(A,B),C) | -q(B,f1(A,B)) # label(c_13) # label(negated_conjecture). [assumption].
% 0.68/0.96 Derived: s(f1(f1(A,B),C),D) | -q(C,f1(f1(A,B),C)) | s(f1(A,B),E) | q(f1(A,B),F). [resolve(10,a,2,a)].
% 0.68/0.96 11 -p(A,A) | s(f1(A,B),C) | q(f1(A,B),D) # label(c_14) # label(negated_conjecture). [assumption].
% 0.68/0.97 Derived: s(f1(f1(A,B),C),D) | q(f1(f1(A,B),C),E) | s(f1(A,B),F) | q(f1(A,B),V6). [resolve(11,a,2,a)].
% 0.68/0.97 12 p(f1(A,B),f1(A,B)) | -s(A,f1(A,B)) | -s(B,B) # label(c_3) # label(negated_conjecture). [assumption].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -s(B,B) | -s(f1(A,B),f1(f1(A,B),C)) | -s(C,C). [resolve(12,a,3,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -s(B,B) | -s(f1(A,B),f1(f1(A,B),C)) | -q(C,f1(f1(A,B),C)). [resolve(12,a,5,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -s(B,B) | s(f1(f1(A,B),C),D) | -s(C,C). [resolve(12,a,6,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -s(B,B) | -s(f1(A,B),f1(f1(A,B),C)) | q(f1(f1(A,B),C),D). [resolve(12,a,9,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -s(B,B) | s(f1(f1(A,B),C),D) | -q(C,f1(f1(A,B),C)). [resolve(12,a,10,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -s(B,B) | s(f1(f1(A,B),C),D) | q(f1(f1(A,B),C),E). [resolve(12,a,11,a)].
% 0.68/0.97 13 p(f1(A,B),f1(A,B)) | s(f1(A,B),C) | -s(B,B) # label(c_6) # label(negated_conjecture). [assumption].
% 0.68/0.97 Derived: s(f1(A,B),C) | -s(B,B) | -s(f1(A,B),f1(f1(A,B),D)) | -s(D,D). [resolve(13,a,3,a)].
% 0.68/0.97 Derived: s(f1(A,B),C) | -s(B,B) | -s(f1(A,B),f1(f1(A,B),D)) | -q(D,f1(f1(A,B),D)). [resolve(13,a,5,a)].
% 0.68/0.97 Derived: s(f1(A,B),C) | -s(B,B) | s(f1(f1(A,B),D),E) | -s(D,D). [resolve(13,a,6,a)].
% 0.68/0.97 Derived: s(f1(A,B),C) | -s(B,B) | -s(f1(A,B),f1(f1(A,B),D)) | q(f1(f1(A,B),D),E). [resolve(13,a,9,a)].
% 0.68/0.97 Derived: s(f1(A,B),C) | -s(B,B) | s(f1(f1(A,B),D),E) | -q(D,f1(f1(A,B),D)). [resolve(13,a,10,a)].
% 0.68/0.97 Derived: s(f1(A,B),C) | -s(B,B) | s(f1(f1(A,B),D),E) | q(f1(f1(A,B),D),F). [resolve(13,a,11,a)].
% 0.68/0.97 14 p(f1(A,B),f1(A,B)) | -q(C,C) | -q(B,f1(A,B)) # label(c_7) # label(negated_conjecture). [assumption].
% 0.68/0.97 Derived: -q(A,A) | -q(B,f1(C,B)) | -q(D,D) | -q(E,f1(f1(C,B),E)). [resolve(14,a,4,a)].
% 0.68/0.97 Derived: -q(A,A) | -q(B,f1(C,B)) | -q(D,D) | q(f1(f1(C,B),E),D). [resolve(14,a,7,a)].
% 0.68/0.97 Derived: -q(A,A) | -q(B,f1(C,B)) | -s(f1(C,B),f1(f1(C,B),D)) | q(f1(f1(C,B),D),E). [resolve(14,a,9,a)].
% 0.68/0.97 Derived: -q(A,A) | -q(B,f1(C,B)) | s(f1(f1(C,B),D),E) | q(f1(f1(C,B),D),F). [resolve(14,a,11,a)].
% 0.68/0.97 15 p(f1(A,B),f1(A,B)) | -q(C,C) | q(f1(A,B),C) # label(c_8) # label(negated_conjecture). [assumption].
% 0.68/0.97 Derived: -q(A,A) | q(f1(B,C),A) | -q(D,D) | -q(E,f1(f1(B,C),E)). [resolve(15,a,4,a)].
% 0.68/0.97 Derived: -q(A,A) | q(f1(B,C),A) | -q(D,D) | q(f1(f1(B,C),E),D). [resolve(15,a,7,a)].
% 0.68/0.97 Derived: -q(A,A) | q(f1(B,C),A) | -s(f1(B,C),f1(f1(B,C),D)) | q(f1(f1(B,C),D),E). [resolve(15,a,9,a)].
% 0.68/0.97 Derived: -q(A,A) | q(f1(B,C),A) | s(f1(f1(B,C),D),E) | q(f1(f1(B,C),D),F). [resolve(15,a,11,a)].
% 0.68/0.97 16 p(f1(A,B),f1(A,B)) | -s(A,f1(A,B)) | -q(B,f1(A,B)) # label(c_1) # label(negated_conjecture). [assumption].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -q(B,f1(A,B)) | -s(f1(A,B),f1(f1(A,B),C)) | -s(C,C). [resolve(16,a,3,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -q(B,f1(A,B)) | -s(f1(A,B),f1(f1(A,B),C)) | -q(C,f1(f1(A,B),C)). [resolve(16,a,5,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -q(B,f1(A,B)) | s(f1(f1(A,B),C),D) | -s(C,C). [resolve(16,a,6,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -q(B,f1(A,B)) | -s(f1(A,B),f1(f1(A,B),C)) | q(f1(f1(A,B),C),D). [resolve(16,a,9,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -q(B,f1(A,B)) | s(f1(f1(A,B),C),D) | -q(C,f1(f1(A,B),C)). [resolve(16,a,10,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | -q(B,f1(A,B)) | s(f1(f1(A,B),C),D) | q(f1(f1(A,B),C),E). [resolve(16,a,11,a)].
% 0.68/0.97 17 p(f1(A,B),f1(A,B)) | -s(A,f1(A,B)) | q(f1(A,B),C) # label(c_2) # label(negated_conjecture). [assumption].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | q(f1(A,B),C) | -s(f1(A,B),f1(f1(A,B),D)) | -s(D,D). [resolve(17,a,3,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | q(f1(A,B),C) | -q(D,D) | -q(E,f1(f1(A,B),E)). [resolve(17,a,4,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | q(f1(A,B),C) | -s(f1(A,B),f1(f1(A,B),D)) | -q(D,f1(f1(A,B),D)). [resolve(17,a,5,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | q(f1(A,B),C) | s(f1(f1(A,B),D),E) | -s(D,D). [resolve(17,a,6,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | q(f1(A,B),C) | -q(D,D) | q(f1(f1(A,B),E),D). [resolve(17,a,7,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | q(f1(A,B),C) | -s(f1(A,B),f1(f1(A,B),D)) | q(f1(f1(A,B),D),E). [resolve(17,a,9,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | q(f1(A,B),C) | s(f1(f1(A,B),D),E) | -q(D,f1(f1(A,B),D)). [resolve(17,a,10,a)].
% 0.68/0.97 Derived: -s(A,f1(A,B)) | q(f1(A,B),C) | s(f1(f1(A,B),D),E) | q(f1(f1(A,B),D),F). [resolve(17,a,11,a)].
% 0.73/1.16 18 p(f1(A,B),f1(A,B)) | s(f1(A,B),C) | -q(B,f1(A,B)) # label(c_4) # label(negated_conjecture). [assumption].
% 0.73/1.16 Derived: s(f1(A,B),C) | -q(B,f1(A,B)) | -s(f1(A,B),f1(f1(A,B),D)) | -s(D,D). [resolve(18,a,3,a)].
% 0.73/1.16 Derived: s(f1(A,B),C) | -q(B,f1(A,B)) | -s(f1(A,B),f1(f1(A,B),D)) | -q(D,f1(f1(A,B),D)). [resolve(18,a,5,a)].
% 0.73/1.16 Derived: s(f1(A,B),C) | -q(B,f1(A,B)) | s(f1(f1(A,B),D),E) | -s(D,D). [resolve(18,a,6,a)].
% 0.73/1.16 Derived: s(f1(A,B),C) | -q(B,f1(A,B)) | -s(f1(A,B),f1(f1(A,B),D)) | q(f1(f1(A,B),D),E). [resolve(18,a,9,a)].
% 0.73/1.16 Derived: s(f1(A,B),C) | -q(B,f1(A,B)) | s(f1(f1(A,B),D),E) | -q(D,f1(f1(A,B),D)). [resolve(18,a,10,a)].
% 0.73/1.16 Derived: s(f1(A,B),C) | -q(B,f1(A,B)) | s(f1(f1(A,B),D),E) | q(f1(f1(A,B),D),F). [resolve(18,a,11,a)].
% 0.73/1.16
% 0.73/1.16 ============================== end predicate elimination =============
% 0.73/1.16
% 0.73/1.16 Auto_denials: (non-Horn, no changes).
% 0.73/1.16
% 0.73/1.16 Term ordering decisions:
% 0.73/1.16 Function symbol KB weights: f1=1.
% 0.73/1.16
% 0.73/1.16 ============================== end of process initial clauses ========
% 0.73/1.16
% 0.73/1.16 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.16
% 0.73/1.16 ============================== end of clauses for search =============
% 0.73/1.16
% 0.73/1.16 ============================== SEARCH ================================
% 0.73/1.16
% 0.73/1.16 % Starting search at 0.02 seconds.
% 0.73/1.16
% 0.73/1.16 ============================== PROOF =================================
% 0.73/1.16 % SZS status Unsatisfiable
% 0.73/1.16 % SZS output start Refutation
% 0.73/1.16
% 0.73/1.16 % Proof 1 at 0.21 (+ 0.00) seconds.
% 0.73/1.16 % Length of proof is 31.
% 0.73/1.16 % Level of proof is 21.
% 0.73/1.16 % Maximum clause weight is 34.000.
% 0.73/1.16 % Given clauses 100.
% 0.73/1.16
% 0.73/1.16 2 p(f1(A,B),f1(A,B)) | s(f1(A,B),C) | q(f1(A,B),D) # label(c_5) # label(negated_conjecture). [assumption].
% 0.73/1.16 3 -p(A,A) | -s(A,f1(A,B)) | -s(B,B) # label(c_12) # label(negated_conjecture). [assumption].
% 0.73/1.16 11 -p(A,A) | s(f1(A,B),C) | q(f1(A,B),D) # label(c_14) # label(negated_conjecture). [assumption].
% 0.73/1.16 12 p(f1(A,B),f1(A,B)) | -s(A,f1(A,B)) | -s(B,B) # label(c_3) # label(negated_conjecture). [assumption].
% 0.73/1.16 21 s(A,B) | -s(B,f1(B,C)) | -s(C,C) # label(c_21) # label(negated_conjecture). [assumption].
% 0.73/1.16 23 s(A,B) | -q(C,C) | -q(D,f1(B,D)) # label(c_25) # label(negated_conjecture). [assumption].
% 0.73/1.16 36 s(f1(f1(A,B),C),D) | q(f1(f1(A,B),C),E) | s(f1(A,B),F) | q(f1(A,B),V6). [resolve(11,a,2,a)].
% 0.73/1.16 37 -s(A,f1(A,B)) | -s(B,B) | -s(f1(A,B),f1(f1(A,B),C)) | -s(C,C). [resolve(12,a,3,a)].
% 0.73/1.16 79 -s(A,f1(A,B)) | -s(B,B) | -s(f1(A,B),f1(f1(A,B),B)). [factor(37,b,d)].
% 0.73/1.16 112 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | q(f1(A,B),F) | s(V6,V7) | -q(V8,V8). [resolve(36,b,23,c)].
% 0.73/1.16 137 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | q(f1(A,B),F) | -q(V6,V6). [factor(112,a,d)].
% 0.73/1.16 927 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | q(f1(A,B),F) | s(f1(f1(V6,V7),V8),V9) | s(f1(V6,V7),V10) | q(f1(V6,V7),V11). [resolve(137,d,36,b)].
% 0.73/1.16 933 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | q(f1(A,B),F) | s(f1(A,B),V6) | q(f1(A,B),V7). [factor(927,a,d)].
% 0.73/1.16 936 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | q(f1(A,B),F) | q(f1(A,B),V6). [factor(933,b,d)].
% 0.73/1.16 938 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | q(f1(A,B),F). [factor(936,c,d)].
% 0.73/1.16 974 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | s(F,V6) | -q(V7,V7). [resolve(938,c,23,c)].
% 0.73/1.16 989 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | -q(F,F). [factor(974,a,c)].
% 0.73/1.16 1108 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | s(f1(f1(F,V6),V7),V8) | s(f1(F,V6),V9). [resolve(989,c,938,c)].
% 0.73/1.16 1109 s(f1(f1(A,B),C),D) | s(f1(A,B),E) | s(f1(A,B),F). [factor(1108,a,c)].
% 0.73/1.16 1110 s(f1(f1(A,B),C),D) | s(f1(A,B),E). [factor(1109,b,c)].
% 0.73/1.16 1113 s(f1(A,B),C) | -s(f1(A,B),f1(f1(A,B),D)) | -s(D,D). [resolve(1110,a,79,c)].
% 0.73/1.16 1130 s(f1(A,B),C) | s(D,f1(f1(A,B),E)) | -s(F,F). [resolve(1110,a,21,b)].
% 0.73/1.16 1154 s(f1(A,B),f1(f1(A,B),C)) | -s(D,D). [factor(1130,a,b)].
% 0.73/1.16 1160 s(f1(A,B),f1(f1(A,B),C)) | s(f1(D,E),F). [resolve(1154,b,1110,a)].
% 0.73/1.16 1162 s(f1(A,B),f1(f1(A,B),C)). [factor(1160,a,b)].
% 0.73/1.16 1173 s(f1(A,B),C) | -s(D,D). [back_unit_del(1113),unit_del(b,1162)].
% 0.73/1.16 1174 -s(A,f1(A,B)) | -s(B,B). [back_unit_del(79),unit_del(c,1162)].
% 0.73/1.16 1186 s(f1(A,B),C) | s(f1(D,E),F). [resolve(1173,b,1110,a)].
% 0.73/1.16 1188 s(f1(A,B),C). [factor(1186,a,b)].
% 0.73/1.16 1189 -s(A,f1(A,f1(B,C))). [resolve(1188,a,1174,b)].
% 0.73/1.16 1190 $F. [resolve(1189,a,1188,a)].
% 0.73/1.16
% 0.73/1.16 % SZS output end Refutation
% 0.73/1.16 ============================== end of proof ==========================
% 0.73/1.16
% 0.73/1.16 ============================== STATISTICS ============================
% 0.73/1.16
% 0.73/1.16 Given=100. Generated=2782. Kept=1171. proofs=1.
% 0.73/1.16 Usable=11. Sos=6. Demods=0. Limbo=0, Disabled=1229. Hints=0.
% 0.73/1.16 Megabytes=0.97.
% 0.73/1.16 User_CPU=0.21, System_CPU=0.00, Wall_clock=0.
% 0.73/1.16
% 0.73/1.16 ============================== end of statistics =====================
% 0.73/1.16
% 0.73/1.16 ============================== end of search =========================
% 0.73/1.16
% 0.73/1.16 THEOREM PROVED
% 0.73/1.16 % SZS status Unsatisfiable
% 0.73/1.16
% 0.73/1.16 Exiting with 1 proof.
% 0.73/1.16
% 0.73/1.16 Process 13176 exit (max_proofs) Mon Jul 11 16:33:29 2022
% 0.73/1.16 Prover9 interrupted
%------------------------------------------------------------------------------