TSTP Solution File: SYO680-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO680-1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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 19:17:57 EDT 2022
% Result : Unsatisfiable 0.43s 1.00s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYO680-1 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n003.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 : Sat Jul 9 09:22:13 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/1.00 ============================== Prover9 ===============================
% 0.43/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00 Process 10771 was started by sandbox on n003.cluster.edu,
% 0.43/1.00 Sat Jul 9 09:22:14 2022
% 0.43/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10385_n003.cluster.edu".
% 0.43/1.00 ============================== end of head ===========================
% 0.43/1.00
% 0.43/1.00 ============================== INPUT =================================
% 0.43/1.00
% 0.43/1.00 % Reading from file /tmp/Prover9_10385_n003.cluster.edu
% 0.43/1.00
% 0.43/1.00 set(prolog_style_variables).
% 0.43/1.00 set(auto2).
% 0.43/1.00 % set(auto2) -> set(auto).
% 0.43/1.00 % set(auto) -> set(auto_inference).
% 0.43/1.00 % set(auto) -> set(auto_setup).
% 0.43/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00 % set(auto) -> set(auto_limits).
% 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00 % set(auto) -> set(auto_denials).
% 0.43/1.00 % set(auto) -> set(auto_process).
% 0.43/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00 % set(auto2) -> assign(stats, some).
% 0.43/1.00 % set(auto2) -> clear(echo_input).
% 0.43/1.00 % set(auto2) -> set(quiet).
% 0.43/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00 % set(auto2) -> clear(print_given).
% 0.43/1.00 assign(lrs_ticks,-1).
% 0.43/1.00 assign(sos_limit,10000).
% 0.43/1.00 assign(order,kbo).
% 0.43/1.00 set(lex_order_vars).
% 0.43/1.00 clear(print_given).
% 0.43/1.00
% 0.43/1.00 % formulas(sos). % not echoed (18 formulas)
% 0.43/1.00
% 0.43/1.00 ============================== end of input ==========================
% 0.43/1.00
% 0.43/1.00 % From the command line: assign(max_seconds, 300).
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00
% 0.43/1.00 % Formulas that are not ordinary clauses:
% 0.43/1.00
% 0.43/1.00 ============================== end of process non-clausal formulas ===
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.00
% 0.43/1.00 ============================== PREDICATE ELIMINATION =================
% 0.43/1.00
% 0.43/1.00 ============================== end predicate elimination =============
% 0.43/1.00
% 0.43/1.00 Auto_denials: (non-Horn, no changes).
% 0.43/1.00
% 0.43/1.00 Term ordering decisions:
% 0.43/1.00 Function symbol KB weights: 0=1. z=1. s=1. f=1. suc=1.
% 0.43/1.00
% 0.43/1.00 ============================== end of process initial clauses ========
% 0.43/1.00
% 0.43/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.00
% 0.43/1.00 ============================== end of clauses for search =============
% 0.43/1.00
% 0.43/1.00 ============================== SEARCH ================================
% 0.43/1.00
% 0.43/1.00 % Starting search at 0.02 seconds.
% 0.43/1.00
% 0.43/1.00 ============================== PROOF =================================
% 0.43/1.00 % SZS status Unsatisfiable
% 0.43/1.00 % SZS output start Refutation
% 0.43/1.00
% 0.43/1.00 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.43/1.00 % Length of proof is 51.
% 0.43/1.00 % Level of proof is 25.
% 0.43/1.00 % Maximum clause weight is 55.000.
% 0.43/1.00 % Given clauses 113.
% 0.43/1.00
% 0.43/1.00 1 LE(f(A),s(s(s(s(0))))) # label(clause_104) # label(axiom). [assumption].
% 0.43/1.00 2 -LE(f(z),0) # label(clause_66) # label(axiom). [assumption].
% 0.43/1.00 3 -E(0,f(suc(A))) | -iLEQ(suc(A),suc(B)) | -iLEQ(suc(C),suc(A)) | -E(0,f(suc(B))) | -E(0,f(A)) | -E(0,f(suc(C))) | -E(0,f(B)) | -E(0,f(C)) # label(clause_144) # label(axiom). [assumption].
% 0.43/1.00 4 -iLEQ(suc(A),suc(B)) | -E(s(0),f(suc(C))) | -iLEQ(suc(C),suc(A)) | -E(s(0),f(suc(B))) | -E(s(0),f(C)) | -E(s(0),f(B)) | -E(s(0),f(suc(A))) | -E(s(0),f(A)) # label(clause_21) # label(axiom). [assumption].
% 0.43/1.00 5 -E(s(s(0)),f(suc(A))) | -E(s(s(0)),f(A)) | -iLEQ(suc(A),suc(B)) | -E(s(s(0)),f(suc(C))) | -E(s(s(0)),f(suc(B))) | -iLEQ(suc(C),suc(A)) | -E(s(s(0)),f(B)) | -E(s(s(0)),f(C)) # label(clause_20) # label(axiom). [assumption].
% 0.43/1.00 6 -iLEQ(suc(A),suc(B)) | -E(s(s(s(0))),f(B)) | -E(s(s(s(0))),f(A)) | -iLEQ(suc(C),suc(A)) | -E(s(s(s(0))),f(C)) | -E(s(s(s(0))),f(suc(A))) | -E(s(s(s(0))),f(suc(B))) | -E(s(s(s(0))),f(suc(C))) # label(clause_71) # label(axiom). [assumption].
% 0.43/1.00 7 -LE(f(A),s(0)) | E(0,f(A)) | LE(f(A),0) # label(clause_96) # label(axiom). [assumption].
% 0.43/1.00 8 -E(0,f(A)) | -E(0,f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_109) # label(axiom). [assumption].
% 0.43/1.00 9 -LE(f(suc(A)),s(0)) | E(0,f(suc(A))) | LE(f(A),0) # label(clause_114) # label(axiom). [assumption].
% 0.43/1.00 10 -E(s(0),f(A)) | -E(s(0),f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_91) # label(axiom). [assumption].
% 0.43/1.00 11 -LE(f(A),s(s(0))) | E(s(0),f(A)) | LE(f(A),s(0)) # label(clause_6) # label(axiom). [assumption].
% 0.43/1.00 12 -E(s(s(0)),f(A)) | -E(s(s(0)),f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_5) # label(axiom). [assumption].
% 0.43/1.00 13 -LE(f(suc(A)),s(s(0))) | E(s(0),f(suc(A))) | LE(f(A),s(0)) # label(clause_15) # label(axiom). [assumption].
% 0.43/1.00 14 -LE(f(A),s(s(s(0)))) | E(s(s(0)),f(A)) | LE(f(A),s(s(0))) # label(clause_51) # label(axiom). [assumption].
% 0.43/1.00 15 -E(s(s(s(0))),f(A)) | -E(s(s(s(0))),f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_14) # label(axiom). [assumption].
% 0.43/1.00 16 -LE(f(suc(A)),s(s(s(0)))) | E(s(s(0)),f(suc(A))) | LE(f(A),s(s(0))) # label(clause_84) # label(axiom). [assumption].
% 0.43/1.00 17 -LE(f(A),s(s(s(s(0))))) | E(s(s(s(0))),f(A)) | LE(f(A),s(s(s(0)))) # label(clause_127) # label(axiom). [assumption].
% 0.43/1.00 18 E(s(s(s(0))),f(A)) | LE(f(A),s(s(s(0)))). [copy(17),unit_del(a,1)].
% 0.43/1.00 19 -LE(f(suc(A)),s(s(s(s(0))))) | E(s(s(s(0))),f(suc(A))) | LE(f(A),s(s(s(0)))) # label(clause_102) # label(axiom). [assumption].
% 0.43/1.00 20 E(s(s(s(0))),f(suc(A))) | LE(f(A),s(s(s(0)))). [copy(19),unit_del(a,1)].
% 0.43/1.00 24 -E(0,f(suc(A))) | -iLEQ(suc(A),suc(A)) | -E(0,f(A)). [factor(3,b,c),merge(c),merge(e),merge(f),merge(g)].
% 0.43/1.00 30 -iLEQ(suc(A),suc(A)) | -E(s(0),f(suc(A))) | -E(s(0),f(A)). [factor(4,a,c),merge(c),merge(e),merge(f),merge(g)].
% 0.43/1.00 43 -E(s(s(0)),f(suc(A))) | -E(s(s(0)),f(A)) | -iLEQ(suc(A),suc(A)). [factor(5,c,f),merge(d),merge(e),merge(f),merge(g)].
% 0.43/1.00 47 -iLEQ(suc(A),suc(A)) | -E(s(s(s(0))),f(A)) | -E(s(s(s(0))),f(suc(A))). [factor(6,a,d),merge(c),merge(d),merge(f),merge(g)].
% 0.43/1.00 84 LE(f(A),s(s(s(0)))) | -E(s(s(s(0))),f(A)) | iLEQ(suc(A),suc(A)). [resolve(20,a,15,b)].
% 0.43/1.00 88 LE(f(A),s(s(s(0)))) | iLEQ(suc(A),suc(A)). [resolve(84,b,18,a),merge(c)].
% 0.43/1.00 93 LE(f(A),s(s(s(0)))) | -E(s(s(s(0))),f(A)) | -E(s(s(s(0))),f(suc(A))). [resolve(88,b,47,a)].
% 0.43/1.00 109 LE(f(A),s(s(s(0)))) | -E(s(s(s(0))),f(A)). [resolve(93,c,20,a),merge(c)].
% 0.43/1.00 111 LE(f(A),s(s(s(0)))). [resolve(109,b,18,a),merge(b)].
% 0.43/1.00 112 E(s(s(0)),f(suc(A))) | LE(f(A),s(s(0))). [back_unit_del(16),unit_del(a,111)].
% 0.43/1.00 113 E(s(s(0)),f(A)) | LE(f(A),s(s(0))). [back_unit_del(14),unit_del(a,111)].
% 0.43/1.00 114 LE(f(A),s(s(0))) | -E(s(s(0)),f(A)) | iLEQ(suc(A),suc(A)). [resolve(112,a,12,b)].
% 0.43/1.00 116 LE(f(A),s(s(0))) | iLEQ(suc(A),suc(A)). [resolve(114,b,113,a),merge(c)].
% 0.43/1.00 124 LE(f(A),s(s(0))) | -E(s(s(0)),f(suc(A))) | -E(s(s(0)),f(A)). [resolve(116,b,43,c)].
% 0.43/1.00 135 LE(f(A),s(s(0))) | -E(s(s(0)),f(A)). [resolve(124,b,112,a),merge(c)].
% 0.43/1.00 136 LE(f(A),s(s(0))). [resolve(135,b,113,a),merge(b)].
% 0.43/1.00 137 E(s(0),f(suc(A))) | LE(f(A),s(0)). [back_unit_del(13),unit_del(a,136)].
% 0.43/1.00 138 E(s(0),f(A)) | LE(f(A),s(0)). [back_unit_del(11),unit_del(a,136)].
% 0.43/1.00 139 LE(f(A),s(0)) | -E(s(0),f(A)) | iLEQ(suc(A),suc(A)). [resolve(137,a,10,b)].
% 0.43/1.00 141 LE(f(A),s(0)) | iLEQ(suc(A),suc(A)). [resolve(139,b,138,a),merge(c)].
% 0.43/1.00 154 LE(f(A),s(0)) | -E(s(0),f(suc(A))) | -E(s(0),f(A)). [resolve(141,b,30,a)].
% 0.43/1.00 160 LE(f(A),s(0)) | -E(s(0),f(A)). [resolve(154,b,137,a),merge(c)].
% 0.43/1.00 161 LE(f(A),s(0)). [resolve(160,b,138,a),merge(b)].
% 0.43/1.00 162 E(0,f(suc(A))) | LE(f(A),0). [back_unit_del(9),unit_del(a,161)].
% 0.43/1.00 163 E(0,f(A)) | LE(f(A),0). [back_unit_del(7),unit_del(a,161)].
% 0.43/1.00 165 LE(f(A),0) | -E(0,f(A)) | iLEQ(suc(A),suc(A)). [resolve(162,a,8,b)].
% 0.43/1.00 166 LE(f(A),0) | iLEQ(suc(A),suc(A)). [resolve(165,b,163,a),merge(c)].
% 0.43/1.00 182 LE(f(A),0) | -E(0,f(suc(A))) | -E(0,f(A)). [resolve(166,b,24,b)].
% 0.43/1.00 184 LE(f(A),0) | -E(0,f(A)). [resolve(182,b,162,a),merge(c)].
% 0.43/1.00 185 LE(f(A),0). [resolve(184,b,163,a),merge(b)].
% 0.43/1.00 186 $F. [resolve(185,a,2,a)].
% 0.43/1.00
% 0.43/1.00 % SZS output end Refutation
% 0.43/1.00 ============================== end of proof ==========================
% 0.43/1.00
% 0.43/1.00 ============================== STATISTICS ============================
% 0.43/1.00
% 0.43/1.00 Given=113. Generated=507. Kept=183. proofs=1.
% 0.43/1.00 Usable=77. Sos=4. Demods=0. Limbo=0, Disabled=119. Hints=0.
% 0.43/1.00 Megabytes=0.22.
% 0.43/1.00 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.43/1.00
% 0.43/1.00 ============================== end of statistics =====================
% 0.43/1.00
% 0.43/1.00 ============================== end of search =========================
% 0.43/1.00
% 0.43/1.00 THEOREM PROVED
% 0.43/1.00 % SZS status Unsatisfiable
% 0.43/1.00
% 0.43/1.00 Exiting with 1 proof.
% 0.43/1.00
% 0.43/1.00 Process 10771 exit (max_proofs) Sat Jul 9 09:22:14 2022
% 0.43/1.00 Prover9 interrupted
%------------------------------------------------------------------------------