TSTP Solution File: SYO683-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO683-1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:59 EDT 2022
% Result : Unsatisfiable 14.94s 15.28s
% Output : Refutation 14.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYO683-1 : TPTP v8.1.0. Released v7.3.0.
% 0.09/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jul 9 11:12:30 EDT 2022
% 0.15/0.36 % CPUTime :
% 14.94/15.28 ============================== Prover9 ===============================
% 14.94/15.28 Prover9 (32) version 2009-11A, November 2009.
% 14.94/15.28 Process 24138 was started by sandbox on n025.cluster.edu,
% 14.94/15.28 Sat Jul 9 11:12:31 2022
% 14.94/15.28 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23983_n025.cluster.edu".
% 14.94/15.28 ============================== end of head ===========================
% 14.94/15.28
% 14.94/15.28 ============================== INPUT =================================
% 14.94/15.28
% 14.94/15.28 % Reading from file /tmp/Prover9_23983_n025.cluster.edu
% 14.94/15.28
% 14.94/15.28 set(prolog_style_variables).
% 14.94/15.28 set(auto2).
% 14.94/15.28 % set(auto2) -> set(auto).
% 14.94/15.28 % set(auto) -> set(auto_inference).
% 14.94/15.28 % set(auto) -> set(auto_setup).
% 14.94/15.28 % set(auto_setup) -> set(predicate_elim).
% 14.94/15.28 % set(auto_setup) -> assign(eq_defs, unfold).
% 14.94/15.28 % set(auto) -> set(auto_limits).
% 14.94/15.28 % set(auto_limits) -> assign(max_weight, "100.000").
% 14.94/15.28 % set(auto_limits) -> assign(sos_limit, 20000).
% 14.94/15.28 % set(auto) -> set(auto_denials).
% 14.94/15.28 % set(auto) -> set(auto_process).
% 14.94/15.28 % set(auto2) -> assign(new_constants, 1).
% 14.94/15.28 % set(auto2) -> assign(fold_denial_max, 3).
% 14.94/15.28 % set(auto2) -> assign(max_weight, "200.000").
% 14.94/15.28 % set(auto2) -> assign(max_hours, 1).
% 14.94/15.28 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 14.94/15.28 % set(auto2) -> assign(max_seconds, 0).
% 14.94/15.28 % set(auto2) -> assign(max_minutes, 5).
% 14.94/15.28 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 14.94/15.28 % set(auto2) -> set(sort_initial_sos).
% 14.94/15.28 % set(auto2) -> assign(sos_limit, -1).
% 14.94/15.28 % set(auto2) -> assign(lrs_ticks, 3000).
% 14.94/15.28 % set(auto2) -> assign(max_megs, 400).
% 14.94/15.28 % set(auto2) -> assign(stats, some).
% 14.94/15.28 % set(auto2) -> clear(echo_input).
% 14.94/15.28 % set(auto2) -> set(quiet).
% 14.94/15.28 % set(auto2) -> clear(print_initial_clauses).
% 14.94/15.28 % set(auto2) -> clear(print_given).
% 14.94/15.28 assign(lrs_ticks,-1).
% 14.94/15.28 assign(sos_limit,10000).
% 14.94/15.28 assign(order,kbo).
% 14.94/15.28 set(lex_order_vars).
% 14.94/15.28 clear(print_given).
% 14.94/15.28
% 14.94/15.28 % formulas(sos). % not echoed (18 formulas)
% 14.94/15.28
% 14.94/15.28 ============================== end of input ==========================
% 14.94/15.28
% 14.94/15.28 % From the command line: assign(max_seconds, 300).
% 14.94/15.28
% 14.94/15.28 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 14.94/15.28
% 14.94/15.28 % Formulas that are not ordinary clauses:
% 14.94/15.28
% 14.94/15.28 ============================== end of process non-clausal formulas ===
% 14.94/15.28
% 14.94/15.28 ============================== PROCESS INITIAL CLAUSES ===============
% 14.94/15.28
% 14.94/15.28 ============================== PREDICATE ELIMINATION =================
% 14.94/15.28
% 14.94/15.28 ============================== end predicate elimination =============
% 14.94/15.28
% 14.94/15.28 Auto_denials: (non-Horn, no changes).
% 14.94/15.28
% 14.94/15.28 Term ordering decisions:
% 14.94/15.28 Function symbol KB weights: 0=1. z=1. s=1. f=1. suc=1.
% 14.94/15.28
% 14.94/15.28 ============================== end of process initial clauses ========
% 14.94/15.28
% 14.94/15.28 ============================== CLAUSES FOR SEARCH ====================
% 14.94/15.28
% 14.94/15.28 ============================== end of clauses for search =============
% 14.94/15.28
% 14.94/15.28 ============================== SEARCH ================================
% 14.94/15.28
% 14.94/15.28 % Starting search at 12.71 seconds.
% 14.94/15.28
% 14.94/15.28 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 53 (0.00 of 12.73 sec).
% 14.94/15.28
% 14.94/15.28 ============================== PROOF =================================
% 14.94/15.28 % SZS status Unsatisfiable
% 14.94/15.28 % SZS output start Refutation
% 14.94/15.28
% 14.94/15.28 % Proof 1 at 14.19 (+ 0.03) seconds.
% 14.94/15.28 % Length of proof is 55.
% 14.94/15.28 % Level of proof is 25.
% 14.94/15.28 % Maximum clause weight is 95.000.
% 14.94/15.28 % Given clauses 2175.
% 14.94/15.28
% 14.94/15.28 1 LE(f(A),s(s(s(s(0))))) # label(clause_451) # label(axiom). [assumption].
% 14.94/15.28 2 -LE(f(z),0) # label(clause_287) # label(axiom). [assumption].
% 14.94/15.28 3 -E(0,f(suc(A))) | -E(0,f(suc(B))) | -E(0,f(B)) | -E(0,f(suc(C))) | -E(0,f(A)) | -E(0,f(D)) | -E(0,f(suc(D))) | -E(0,f(C)) | -iLEQ(suc(B),suc(D)) | -iLEQ(suc(A),suc(B)) | -iLEQ(suc(E),suc(A)) | -E(0,f(suc(E))) | -iLEQ(suc(D),suc(C)) | -E(0,f(E)) # label(clause_442) # label(axiom). [assumption].
% 14.94/15.28 4 -E(s(0),f(suc(A))) | -E(s(0),f(B)) | -E(s(0),f(suc(B))) | -E(s(0),f(suc(C))) | -E(s(0),f(suc(D))) | -E(s(0),f(A)) | -E(s(0),f(C)) | -iLEQ(suc(D),suc(C)) | -E(s(0),f(E)) | -iLEQ(suc(A),suc(B)) | -E(s(0),f(D)) | -E(s(0),f(suc(E))) | -iLEQ(suc(E),suc(A)) | -iLEQ(suc(C),suc(E)) # label(clause_151) # label(axiom). [assumption].
% 14.94/15.28 5 -E(s(s(0)),f(suc(A))) | -E(s(s(0)),f(B)) | -iLEQ(suc(C),suc(D)) | -E(s(s(0)),f(D)) | -E(s(s(0)),f(suc(E))) | -iLEQ(suc(A),suc(B)) | -E(s(s(0)),f(suc(C))) | -E(s(s(0)),f(E)) | -E(s(s(0)),f(suc(D))) | -E(s(s(0)),f(suc(B))) | -iLEQ(suc(D),suc(A)) | -E(s(s(0)),f(A)) | -E(s(s(0)),f(C)) | -iLEQ(suc(B),suc(E)) # label(clause_563) # label(axiom). [assumption].
% 14.94/15.29 6 -E(s(s(s(0))),f(suc(A))) | -E(s(s(s(0))),f(B)) | -iLEQ(suc(C),suc(D)) | -E(s(s(s(0))),f(suc(B))) | -E(s(s(s(0))),f(A)) | -E(s(s(s(0))),f(D)) | -E(s(s(s(0))),f(C)) | -iLEQ(suc(A),suc(C)) | -E(s(s(s(0))),f(E)) | -E(s(s(s(0))),f(suc(D))) | -iLEQ(suc(D),suc(B)) | -E(s(s(s(0))),f(suc(C))) | -E(s(s(s(0))),f(suc(E))) | -iLEQ(suc(E),suc(A)) # label(clause_560) # label(axiom). [assumption].
% 14.94/15.29 7 -LE(f(A),s(0)) | E(0,f(A)) | LE(f(A),0) # label(clause_89) # label(axiom). [assumption].
% 14.94/15.29 8 -E(0,f(A)) | -E(0,f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_469) # label(axiom). [assumption].
% 14.94/15.29 9 -LE(f(suc(A)),s(0)) | E(0,f(suc(A))) | LE(f(A),0) # label(clause_547) # label(axiom). [assumption].
% 14.94/15.29 10 -E(s(0),f(A)) | -E(s(0),f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_398) # label(axiom). [assumption].
% 14.94/15.29 11 -LE(f(A),s(s(0))) | E(s(0),f(A)) | LE(f(A),s(0)) # label(clause_44) # label(axiom). [assumption].
% 14.94/15.29 12 -E(s(s(0)),f(A)) | -E(s(s(0)),f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_29) # label(axiom). [assumption].
% 14.94/15.29 13 -LE(f(suc(A)),s(s(0))) | E(s(0),f(suc(A))) | LE(f(A),s(0)) # label(clause_222) # label(axiom). [assumption].
% 14.94/15.29 14 -LE(f(A),s(s(s(0)))) | E(s(s(0)),f(A)) | LE(f(A),s(s(0))) # label(clause_97) # label(axiom). [assumption].
% 14.94/15.29 15 -E(s(s(s(0))),f(A)) | -E(s(s(s(0))),f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_59) # label(axiom). [assumption].
% 14.94/15.29 16 -LE(f(suc(A)),s(s(s(0)))) | E(s(s(0)),f(suc(A))) | LE(f(A),s(s(0))) # label(clause_476) # label(axiom). [assumption].
% 14.94/15.29 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_539) # label(axiom). [assumption].
% 14.94/15.29 18 E(s(s(s(0))),f(A)) | LE(f(A),s(s(s(0)))). [copy(17),unit_del(a,1)].
% 14.94/15.29 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_443) # label(axiom). [assumption].
% 14.94/15.29 20 E(s(s(s(0))),f(suc(A))) | LE(f(A),s(s(s(0)))). [copy(19),unit_del(a,1)].
% 14.94/15.29 45 -E(0,f(suc(A))) | -E(0,f(A)) | -E(0,f(suc(B))) | -E(0,f(B)) | -iLEQ(suc(A),suc(A)) | -iLEQ(suc(C),suc(A)) | -E(0,f(suc(C))) | -iLEQ(suc(A),suc(B)) | -E(0,f(C)). [factor(3,i,j),merge(b),merge(e),merge(f),merge(g)].
% 14.94/15.29 71 -E(s(0),f(suc(A))) | -E(s(0),f(B)) | -E(s(0),f(suc(B))) | -E(s(0),f(A)) | -iLEQ(suc(A),suc(B)) | -E(s(0),f(C)) | -E(s(0),f(suc(C))) | -iLEQ(suc(C),suc(A)) | -iLEQ(suc(B),suc(C)). [factor(4,h,j),merge(d),merge(e),merge(g),merge(j)].
% 14.94/15.29 83 -E(s(s(0)),f(suc(A))) | -E(s(s(0)),f(B)) | -iLEQ(suc(A),suc(B)) | -E(s(s(0)),f(suc(C))) | -E(s(s(0)),f(C)) | -E(s(s(0)),f(suc(B))) | -iLEQ(suc(B),suc(A)) | -E(s(s(0)),f(A)) | -iLEQ(suc(B),suc(C)). [factor(5,c,f),merge(d),merge(f),merge(i),merge(l)].
% 14.94/15.29 109 -E(s(s(s(0))),f(suc(A))) | -E(s(s(s(0))),f(B)) | -iLEQ(suc(A),suc(A)) | -E(s(s(s(0))),f(suc(B))) | -E(s(s(s(0))),f(A)) | -E(s(s(s(0))),f(C)) | -iLEQ(suc(A),suc(B)) | -E(s(s(s(0))),f(suc(C))) | -iLEQ(suc(C),suc(A)). [factor(6,c,h),merge(f),merge(g),merge(i),merge(k)].
% 14.94/15.29 260 -E(0,f(suc(A))) | -E(0,f(A)) | -iLEQ(suc(A),suc(A)). [factor(45,f,h),merge(c),merge(d),merge(f),merge(g),merge(h)].
% 14.94/15.29 394 -E(s(0),f(suc(A))) | -E(s(0),f(A)) | -iLEQ(suc(A),suc(A)). [factor(71,e,h),merge(c),merge(d),merge(f),merge(g),merge(h)].
% 14.94/15.29 479 -E(s(s(0)),f(suc(A))) | -E(s(s(0)),f(A)) | -iLEQ(suc(A),suc(A)). [factor(83,c,i),merge(d),merge(e),merge(f),merge(g),merge(h)].
% 14.94/15.29 612 -E(s(s(s(0))),f(suc(A))) | -E(s(s(s(0))),f(A)) | -iLEQ(suc(A),suc(A)). [factor(109,g,i),merge(d),merge(e),merge(f),merge(g),merge(h)].
% 14.94/15.29 2175 LE(f(A),s(s(s(0)))) | -E(s(s(s(0))),f(A)) | iLEQ(suc(A),suc(A)). [resolve(20,a,15,b)].
% 14.94/15.29 2179 LE(f(A),s(s(s(0)))) | iLEQ(suc(A),suc(A)). [resolve(2175,b,18,a),merge(c)].
% 14.94/15.29 2554 LE(f(A),s(s(s(0)))) | -E(s(s(s(0))),f(suc(A))) | -E(s(s(s(0))),f(A)). [resolve(2179,b,612,c)].
% 14.94/15.29 2654 LE(f(A),s(s(s(0)))) | -E(s(s(s(0))),f(A)). [resolve(2554,b,20,a),merge(c)].
% 14.94/15.29 2656 LE(f(A),s(s(s(0)))). [resolve(2654,b,18,a),merge(b)].
% 14.94/15.29 2657 E(s(s(0)),f(suc(A))) | LE(f(A),s(s(0))). [back_unit_del(16),unit_del(a,2656)].
% 14.94/15.29 2658 E(s(s(0)),f(A)) | LE(f(A),s(s(0))). [back_unit_del(14),unit_del(a,2656)].
% 14.94/15.29 2660 LE(f(A),s(s(0))) | -E(s(s(0)),f(A)) | iLEQ(suc(A),suc(A)). [resolve(2657,a,12,b)].
% 14.94/15.29 2661 LE(f(A),s(s(0))) | iLEQ(suc(A),suc(A)). [resolve(2660,b,2658,a),merge(c)].
% 14.94/15.29 3111 LE(f(A),s(s(0))) | -E(s(s(0)),f(suc(A))) | -E(s(s(0)),f(A)). [resolve(2661,b,479,c)].
% 14.94/15.29 3116 LE(f(A),s(s(0))) | -E(s(s(0)),f(A)). [resolve(3111,b,2657,a),merge(c)].
% 14.94/15.29 3117 LE(f(A),s(s(0))). [resolve(3116,b,2658,a),merge(b)].
% 14.94/15.29 3118 E(s(0),f(suc(A))) | LE(f(A),s(0)). [back_unit_del(13),unit_del(a,3117)].
% 14.94/15.29 3119 E(s(0),f(A)) | LE(f(A),s(0)). [back_unit_del(11),unit_del(a,3117)].
% 14.94/15.29 3121 LE(f(A),s(0)) | -E(s(0),f(A)) | iLEQ(suc(A),suc(A)). [resolve(3118,a,10,b)].
% 14.94/15.29 3122 LE(f(A),s(0)) | iLEQ(suc(A),suc(A)). [resolve(3121,b,3119,a),merge(c)].
% 14.94/15.29 3573 LE(f(A),s(0)) | -E(s(0),f(suc(A))) | -E(s(0),f(A)). [resolve(3122,b,394,c)].
% 14.94/15.29 3577 LE(f(A),s(0)) | -E(s(0),f(A)). [resolve(3573,b,3118,a),merge(c)].
% 14.94/15.29 3578 LE(f(A),s(0)). [resolve(3577,b,3119,a),merge(b)].
% 14.94/15.29 3579 E(0,f(suc(A))) | LE(f(A),0). [back_unit_del(9),unit_del(a,3578)].
% 14.94/15.29 3580 E(0,f(A)) | LE(f(A),0). [back_unit_del(7),unit_del(a,3578)].
% 14.94/15.29 3582 LE(f(A),0) | -E(0,f(A)) | iLEQ(suc(A),suc(A)). [resolve(3579,a,8,b)].
% 14.94/15.29 3583 LE(f(A),0) | iLEQ(suc(A),suc(A)). [resolve(3582,b,3580,a),merge(c)].
% 14.94/15.29 4035 LE(f(A),0) | -E(0,f(suc(A))) | -E(0,f(A)). [resolve(3583,b,260,c)].
% 14.94/15.29 4037 LE(f(A),0) | -E(0,f(A)). [resolve(4035,b,3579,a),merge(c)].
% 14.94/15.29 4038 LE(f(A),0). [resolve(4037,b,3580,a),merge(b)].
% 14.94/15.29 4039 $F. [resolve(4038,a,2,a)].
% 14.94/15.29
% 14.94/15.29 % SZS output end Refutation
% 14.94/15.29 ============================== end of proof ==========================
% 14.94/15.29
% 14.94/15.29 ============================== STATISTICS ============================
% 14.94/15.29
% 14.94/15.29 Given=2175. Generated=48572. Kept=4036. proofs=1.
% 14.94/15.29 Usable=2169. Sos=1819. Demods=0. Limbo=0, Disabled=65. Hints=0.
% 14.94/15.29 Megabytes=8.46.
% 14.94/15.29 User_CPU=14.19, System_CPU=0.03, Wall_clock=14.
% 14.94/15.29
% 14.94/15.29 ============================== end of statistics =====================
% 14.94/15.29
% 14.94/15.29 ============================== end of search =========================
% 14.94/15.29
% 14.94/15.29 THEOREM PROVED
% 14.94/15.29 % SZS status Unsatisfiable
% 14.94/15.29
% 14.94/15.29 Exiting with 1 proof.
% 14.94/15.29
% 14.94/15.29 Process 24138 exit (max_proofs) Sat Jul 9 11:12:45 2022
% 14.94/15.29 Prover9 interrupted
%------------------------------------------------------------------------------