TSTP Solution File: SYN353-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN353-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:18:29 EDT 2022
% Result : Unsatisfiable 1.89s 2.18s
% Output : Refutation 1.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN353-1 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n015.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 02:24:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.89/2.18 ============================== Prover9 ===============================
% 1.89/2.18 Prover9 (32) version 2009-11A, November 2009.
% 1.89/2.18 Process 23250 was started by sandbox2 on n015.cluster.edu,
% 1.89/2.18 Tue Jul 12 02:24:10 2022
% 1.89/2.18 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23097_n015.cluster.edu".
% 1.89/2.18 ============================== end of head ===========================
% 1.89/2.18
% 1.89/2.18 ============================== INPUT =================================
% 1.89/2.18
% 1.89/2.18 % Reading from file /tmp/Prover9_23097_n015.cluster.edu
% 1.89/2.18
% 1.89/2.18 set(prolog_style_variables).
% 1.89/2.18 set(auto2).
% 1.89/2.18 % set(auto2) -> set(auto).
% 1.89/2.18 % set(auto) -> set(auto_inference).
% 1.89/2.18 % set(auto) -> set(auto_setup).
% 1.89/2.18 % set(auto_setup) -> set(predicate_elim).
% 1.89/2.18 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.89/2.18 % set(auto) -> set(auto_limits).
% 1.89/2.18 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.89/2.18 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.89/2.18 % set(auto) -> set(auto_denials).
% 1.89/2.18 % set(auto) -> set(auto_process).
% 1.89/2.18 % set(auto2) -> assign(new_constants, 1).
% 1.89/2.18 % set(auto2) -> assign(fold_denial_max, 3).
% 1.89/2.18 % set(auto2) -> assign(max_weight, "200.000").
% 1.89/2.18 % set(auto2) -> assign(max_hours, 1).
% 1.89/2.18 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.89/2.18 % set(auto2) -> assign(max_seconds, 0).
% 1.89/2.18 % set(auto2) -> assign(max_minutes, 5).
% 1.89/2.18 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.89/2.18 % set(auto2) -> set(sort_initial_sos).
% 1.89/2.18 % set(auto2) -> assign(sos_limit, -1).
% 1.89/2.18 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.89/2.18 % set(auto2) -> assign(max_megs, 400).
% 1.89/2.18 % set(auto2) -> assign(stats, some).
% 1.89/2.18 % set(auto2) -> clear(echo_input).
% 1.89/2.18 % set(auto2) -> set(quiet).
% 1.89/2.18 % set(auto2) -> clear(print_initial_clauses).
% 1.89/2.18 % set(auto2) -> clear(print_given).
% 1.89/2.18 assign(lrs_ticks,-1).
% 1.89/2.18 assign(sos_limit,10000).
% 1.89/2.18 assign(order,kbo).
% 1.89/2.18 set(lex_order_vars).
% 1.89/2.18 clear(print_given).
% 1.89/2.18
% 1.89/2.18 % formulas(sos). % not echoed (17 formulas)
% 1.89/2.18
% 1.89/2.18 ============================== end of input ==========================
% 1.89/2.18
% 1.89/2.18 % From the command line: assign(max_seconds, 300).
% 1.89/2.18
% 1.89/2.18 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.89/2.18
% 1.89/2.18 % Formulas that are not ordinary clauses:
% 1.89/2.18
% 1.89/2.18 ============================== end of process non-clausal formulas ===
% 1.89/2.18
% 1.89/2.18 ============================== PROCESS INITIAL CLAUSES ===============
% 1.89/2.18
% 1.89/2.18 ============================== PREDICATE ELIMINATION =================
% 1.89/2.18
% 1.89/2.18 ============================== end predicate elimination =============
% 1.89/2.18
% 1.89/2.18 Auto_denials: (non-Horn, no changes).
% 1.89/2.18
% 1.89/2.18 Term ordering decisions:
% 1.89/2.18 Function symbol KB weights: a=1. z=1.
% 1.89/2.18
% 1.89/2.18 ============================== end of process initial clauses ========
% 1.89/2.18
% 1.89/2.18 ============================== CLAUSES FOR SEARCH ====================
% 1.89/2.18
% 1.89/2.18 ============================== end of clauses for search =============
% 1.89/2.18
% 1.89/2.18 ============================== SEARCH ================================
% 1.89/2.18
% 1.89/2.18 % Starting search at 0.01 seconds.
% 1.89/2.18
% 1.89/2.18 ============================== PROOF =================================
% 1.89/2.18 % SZS status Unsatisfiable
% 1.89/2.18 % SZS output start Refutation
% 1.89/2.18
% 1.89/2.18 % Proof 1 at 1.19 (+ 0.01) seconds.
% 1.89/2.18 % Length of proof is 52.
% 1.89/2.18 % Level of proof is 25.
% 1.89/2.18 % Maximum clause weight is 40.000.
% 1.89/2.18 % Given clauses 401.
% 1.89/2.18
% 1.89/2.18 1 f(A,B,C) | f(C,B,z(B,C,A)) # label(clause4) # label(negated_conjecture). [assumption].
% 1.89/2.18 2 f(A,B,C) | f(C,z(C,A,B),A) # label(clause8) # label(negated_conjecture). [assumption].
% 1.89/2.18 6 -f(A,B,C) | -f(B,C,A) | -f(C,A,B) | -f(z(A,B,C),z(A,B,C),z(A,B,C)) # label(clause17) # label(negated_conjecture). [assumption].
% 1.89/2.18 8 -f(A,B,C) | f(B,C,A) | -f(C,B,z(B,C,A)) # label(clause2) # label(negated_conjecture). [assumption].
% 1.89/2.18 9 -f(A,B,C) | f(C,A,B) | -f(C,B,z(B,C,A)) # label(clause3) # label(negated_conjecture). [assumption].
% 1.89/2.18 11 -f(A,B,C) | f(C,A,B) | -f(C,z(C,A,B),A) # label(clause6) # label(negated_conjecture). [assumption].
% 1.89/2.18 12 -f(A,B,C) | f(B,C,A) | -f(C,z(C,A,B),A) # label(clause7) # label(negated_conjecture). [assumption].
% 1.89/2.18 14 f(A,B,C) | f(B,C,A) | -f(z(B,C,A),C,B) # label(clause10) # label(negated_conjecture). [assumption].
% 1.89/2.18 15 f(A,B,C) | f(C,A,B) | -f(z(C,A,B),A,C) # label(clause11) # label(negated_conjecture). [assumption].
% 1.89/2.18 16 -f(A,B,C) | -f(C,A,B) | f(z(B,C,A),C,B) # label(clause12) # label(negated_conjecture). [assumption].
% 1.89/2.18 17 -f(A,B,C) | -f(a,a,z(A,B,C)) | f(B,C,A) | f(C,A,B) # label(clause1) # label(negated_conjecture). [assumption].
% 1.89/2.18 21 f(A,A,A) | -f(z(A,A,A),A,A). [factor(14,a,b)].
% 1.89/2.18 35 -f(A,B,z(B,A,C)) | f(z(z(B,A,C),A,B),A,z(B,A,C)) | f(A,C,B). [resolve(16,a,2,b)].
% 1.89/2.18 37 -f(z(A,B,C),B,A) | f(z(B,A,z(A,B,C)),A,B) | f(B,C,A). [resolve(16,b,2,b)].
% 1.89/2.18 39 -f(a,a,A) | f(a,A,a) | f(A,a,a). [resolve(17,b,1,b),merge(d)].
% 1.89/2.18 53 f(a,z(a,a,A),a) | f(z(a,a,A),a,a) | f(A,a,a). [resolve(39,a,1,b)].
% 1.89/2.18 69 f(a,z(a,a,A),a) | f(A,a,a) | f(a,a,A). [resolve(53,b,14,c),merge(c)].
% 1.89/2.18 80 f(A,a,a) | f(a,a,A) | -f(a,A,a). [resolve(69,a,12,c),merge(d)].
% 1.89/2.18 83 f(z(a,a,A),a,a) | f(a,a,z(a,a,A)) | f(a,A,a). [resolve(80,c,2,b)].
% 1.89/2.18 85 f(a,a,z(a,a,A)) | f(a,A,a) | f(a,a,A). [resolve(83,a,15,c),merge(c)].
% 1.89/2.18 90 f(a,A,a) | f(a,a,A) | -f(A,a,a). [resolve(85,a,9,c),merge(d)].
% 1.89/2.18 155 f(z(a,a,z(a,a,A)),a,a) | f(a,A,a) | f(a,a,z(a,a,A)). [resolve(37,a,83,a),merge(d)].
% 1.89/2.18 214 f(a,A,a) | f(a,a,z(a,a,A)) | f(a,z(a,a,z(a,a,A)),a) | f(a,a,z(a,a,z(a,a,A))). [resolve(155,a,90,c)].
% 1.89/2.18 701 f(a,A,a) | f(a,a,z(a,a,A)) | f(a,a,z(a,a,z(a,a,A))) | -f(a,z(a,a,A),a). [resolve(214,c,11,c),merge(e)].
% 1.89/2.18 709 f(a,A,a) | f(a,a,z(a,a,A)) | f(a,a,z(a,a,z(a,a,A))). [resolve(701,d,2,b),merge(d)].
% 1.89/2.18 719 f(a,A,a) | f(a,a,z(a,a,A)) | -f(z(a,a,A),a,a). [resolve(709,c,8,c),merge(d)].
% 1.89/2.18 725 f(a,A,a) | f(a,a,z(a,a,A)). [resolve(719,c,83,a),merge(c),merge(d)].
% 1.89/2.18 733 f(a,A,a) | -f(A,a,a). [resolve(725,b,9,c),merge(c)].
% 1.89/2.18 738 f(a,z(a,a,A),a) | f(A,a,a). [resolve(733,b,53,b),merge(b)].
% 1.89/2.18 751 f(A,a,a) | -f(a,A,a). [resolve(738,a,12,c),merge(c)].
% 1.89/2.18 754 f(z(a,a,A),a,a) | f(A,a,a). [resolve(751,b,738,a)].
% 1.89/2.18 761 f(A,a,a) | f(a,a,A). [resolve(754,a,14,c),merge(b)].
% 1.89/2.18 786 f(A,a,a) | f(a,A,a). [resolve(761,b,39,a),merge(c)].
% 1.89/2.18 798 f(a,A,a). [resolve(786,a,733,b),merge(b)].
% 1.89/2.18 799 f(A,a,a). [resolve(786,b,751,b),merge(b)].
% 1.89/2.18 804 f(a,a,A). [resolve(798,a,11,c),unit_del(a,798)].
% 1.89/2.18 809 -f(A,B,C) | f(B,C,A) | f(C,A,B). [back_unit_del(17),unit_del(b,804)].
% 1.89/2.18 812 -f(z(a,A,a),z(a,A,a),z(a,A,a)). [ur(6,a,798,a,b,799,a,c,804,a)].
% 1.89/2.18 813 -f(z(A,a,a),z(A,a,a),z(A,a,a)). [ur(6,a,799,a,b,804,a,c,798,a)].
% 1.89/2.18 814 -f(z(a,a,A),z(a,a,A),z(a,a,A)). [ur(6,a,804,a,b,798,a,c,799,a)].
% 1.89/2.18 833 -f(z(z(a,A,a),z(a,A,a),z(a,A,a)),z(a,A,a),z(a,A,a)). [ur(21,a,812,a)].
% 1.89/2.18 834 -f(z(z(A,a,a),z(A,a,a),z(A,a,a)),z(A,a,a),z(A,a,a)). [ur(21,a,813,a)].
% 1.89/2.18 835 -f(z(z(a,a,A),z(a,a,A),z(a,a,A)),z(a,a,A),z(a,a,A)). [ur(21,a,814,a)].
% 1.89/2.18 895 f(z(A,B,C),B,A) | f(B,A,z(A,B,C)) | f(B,C,A). [resolve(809,a,2,b)].
% 1.89/2.18 896 f(A,z(A,B,C),B) | f(z(A,B,C),B,A) | f(C,A,B). [resolve(809,a,1,b)].
% 1.89/2.18 1031 f(z(A,a,a),z(A,a,a),z(z(A,a,a),z(A,a,a),z(A,a,a))). [resolve(895,a,834,a),unit_del(b,813)].
% 1.89/2.18 1032 f(z(a,A,a),z(a,A,a),z(z(a,A,a),z(a,A,a),z(a,A,a))). [resolve(895,a,833,a),unit_del(b,812)].
% 1.89/2.18 1057 f(z(a,a,A),z(z(a,a,A),z(a,a,A),z(a,a,A)),z(a,a,A)). [resolve(896,b,835,a),unit_del(b,814)].
% 1.89/2.18 1457 f(z(z(z(A,a,a),z(A,a,a),z(A,a,a)),z(A,a,a),z(A,a,a)),z(A,a,a),z(z(A,a,a),z(A,a,a),z(A,a,a))). [resolve(1031,a,35,a),unit_del(b,813)].
% 1.89/2.18 1473 -f(z(z(a,A,a),z(a,A,a),z(a,A,a)),z(z(z(a,A,a),z(a,A,a),z(a,A,a)),z(a,A,a),z(a,A,a)),z(a,A,a)). [ur(11,a,1032,a,b,833,a)].
% 1.89/2.18 1485 -f(z(a,a,A),z(z(a,a,A),z(a,a,A),z(a,a,A)),z(z(z(a,a,A),z(a,a,A),z(a,a,A)),z(a,a,A),z(a,a,A))). [ur(8,a,1057,a,b,835,a)].
% 1.89/2.18 1523 $F. [ur(809,b,1485,a,c,1473,a),unit_del(a,1457)].
% 1.89/2.18
% 1.89/2.18 % SZS output end Refutation
% 1.89/2.18 ============================== end of proof ==========================
% 1.89/2.18
% 1.89/2.18 ============================== STATISTICS ============================
% 1.89/2.18
% 1.89/2.18 Given=401. Generated=7121. Kept=1522. proofs=1.
% 1.89/2.18 Usable=317. Sos=704. Demods=0. Limbo=0, Disabled=518. Hints=0.
% 1.89/2.18 Megabytes=2.46.
% 1.89/2.18 User_CPU=1.19, System_CPU=0.01, Wall_clock=1.
% 1.89/2.18
% 1.89/2.18 ============================== end of statistics =====================
% 1.89/2.18
% 1.89/2.18 ============================== end of search =========================
% 1.89/2.18
% 1.89/2.18 THEOREM PROVED
% 1.89/2.18 % SZS status Unsatisfiable
% 1.89/2.18
% 1.89/2.18 Exiting with 1 proof.
% 1.89/2.18
% 1.89/2.18 Process 23250 exit (max_proofs) Tue Jul 12 02:24:11 2022
% 1.89/2.18 Prover9 interrupted
%------------------------------------------------------------------------------