TSTP Solution File: SYO664-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO664-1 : TPTP v8.1.0. Released v7.3.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 19:17:52 EDT 2022
% Result : Unsatisfiable 5.85s 6.12s
% Output : Refutation 5.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO664-1 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 20:28:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 5.85/6.12 ============================== Prover9 ===============================
% 5.85/6.12 Prover9 (32) version 2009-11A, November 2009.
% 5.85/6.12 Process 22053 was started by sandbox2 on n028.cluster.edu,
% 5.85/6.12 Fri Jul 8 20:28:11 2022
% 5.85/6.12 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21708_n028.cluster.edu".
% 5.85/6.12 ============================== end of head ===========================
% 5.85/6.12
% 5.85/6.12 ============================== INPUT =================================
% 5.85/6.12
% 5.85/6.12 % Reading from file /tmp/Prover9_21708_n028.cluster.edu
% 5.85/6.12
% 5.85/6.12 set(prolog_style_variables).
% 5.85/6.12 set(auto2).
% 5.85/6.12 % set(auto2) -> set(auto).
% 5.85/6.12 % set(auto) -> set(auto_inference).
% 5.85/6.12 % set(auto) -> set(auto_setup).
% 5.85/6.12 % set(auto_setup) -> set(predicate_elim).
% 5.85/6.12 % set(auto_setup) -> assign(eq_defs, unfold).
% 5.85/6.12 % set(auto) -> set(auto_limits).
% 5.85/6.12 % set(auto_limits) -> assign(max_weight, "100.000").
% 5.85/6.12 % set(auto_limits) -> assign(sos_limit, 20000).
% 5.85/6.12 % set(auto) -> set(auto_denials).
% 5.85/6.12 % set(auto) -> set(auto_process).
% 5.85/6.12 % set(auto2) -> assign(new_constants, 1).
% 5.85/6.12 % set(auto2) -> assign(fold_denial_max, 3).
% 5.85/6.12 % set(auto2) -> assign(max_weight, "200.000").
% 5.85/6.12 % set(auto2) -> assign(max_hours, 1).
% 5.85/6.12 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.85/6.12 % set(auto2) -> assign(max_seconds, 0).
% 5.85/6.12 % set(auto2) -> assign(max_minutes, 5).
% 5.85/6.12 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.85/6.12 % set(auto2) -> set(sort_initial_sos).
% 5.85/6.12 % set(auto2) -> assign(sos_limit, -1).
% 5.85/6.12 % set(auto2) -> assign(lrs_ticks, 3000).
% 5.85/6.12 % set(auto2) -> assign(max_megs, 400).
% 5.85/6.12 % set(auto2) -> assign(stats, some).
% 5.85/6.12 % set(auto2) -> clear(echo_input).
% 5.85/6.12 % set(auto2) -> set(quiet).
% 5.85/6.12 % set(auto2) -> clear(print_initial_clauses).
% 5.85/6.12 % set(auto2) -> clear(print_given).
% 5.85/6.12 assign(lrs_ticks,-1).
% 5.85/6.12 assign(sos_limit,10000).
% 5.85/6.12 assign(order,kbo).
% 5.85/6.12 set(lex_order_vars).
% 5.85/6.12 clear(print_given).
% 5.85/6.12
% 5.85/6.12 % formulas(sos). % not echoed (10 formulas)
% 5.85/6.12
% 5.85/6.12 ============================== end of input ==========================
% 5.85/6.12
% 5.85/6.12 % From the command line: assign(max_seconds, 300).
% 5.85/6.12
% 5.85/6.12 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.85/6.12
% 5.85/6.12 % Formulas that are not ordinary clauses:
% 5.85/6.12
% 5.85/6.12 ============================== end of process non-clausal formulas ===
% 5.85/6.12
% 5.85/6.12 ============================== PROCESS INITIAL CLAUSES ===============
% 5.85/6.12
% 5.85/6.12 ============================== PREDICATE ELIMINATION =================
% 5.85/6.12
% 5.85/6.12 ============================== end predicate elimination =============
% 5.85/6.12
% 5.85/6.12 Auto_denials: (non-Horn, no changes).
% 5.85/6.12
% 5.85/6.12 Term ordering decisions:
% 5.85/6.12 Function symbol KB weights: 0=1. z=1. f=1. s=1. suc=1.
% 5.85/6.12
% 5.85/6.12 ============================== end of process initial clauses ========
% 5.85/6.12
% 5.85/6.12 ============================== CLAUSES FOR SEARCH ====================
% 5.85/6.12
% 5.85/6.12 ============================== end of clauses for search =============
% 5.85/6.12
% 5.85/6.12 ============================== SEARCH ================================
% 5.85/6.12
% 5.85/6.12 % Starting search at 4.81 seconds.
% 5.85/6.12
% 5.85/6.12 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 36 (0.00 of 4.83 sec).
% 5.85/6.12
% 5.85/6.12 ============================== PROOF =================================
% 5.85/6.12 % SZS status Unsatisfiable
% 5.85/6.12 % SZS output start Refutation
% 5.85/6.12
% 5.85/6.12 % Proof 1 at 5.11 (+ 0.01) seconds.
% 5.85/6.12 % Length of proof is 29.
% 5.85/6.12 % Level of proof is 13.
% 5.85/6.12 % Maximum clause weight is 75.000.
% 5.85/6.12 % Given clauses 1084.
% 5.85/6.12
% 5.85/6.12 1 LE(f(A),s(s(0))) # label(clause_58) # label(axiom). [assumption].
% 5.85/6.12 2 -LE(f(z),0) # label(clause_70) # label(axiom). [assumption].
% 5.85/6.12 3 -E(0,f(A)) | -E(0,f(suc(B))) | -E(0,f(suc(C))) | -iLEQ(suc(C),suc(B)) | -iLEQ(suc(B),suc(D)) | -E(0,f(suc(A))) | -E(0,f(C)) | -iLEQ(suc(D),suc(A)) | -E(0,f(E)) | -iLEQ(suc(A),suc(E)) | -E(0,f(suc(D))) | -E(0,f(B)) | -E(0,f(suc(E))) | -E(0,f(D)) # label(clause_66) # label(axiom). [assumption].
% 5.85/6.12 4 -E(s(0),f(suc(A))) | -E(s(0),f(A)) | -E(s(0),f(suc(B))) | -E(s(0),f(suc(C))) | -E(s(0),f(D)) | -E(s(0),f(suc(D))) | -iLEQ(suc(D),suc(C)) | -E(s(0),f(C)) | -iLEQ(suc(E),suc(A)) | -E(s(0),f(B)) | -E(s(0),f(E)) | -iLEQ(suc(A),suc(B)) | -iLEQ(suc(C),suc(E)) | -E(s(0),f(suc(E))) # label(clause_37) # label(axiom). [assumption].
% 5.85/6.12 5 -LE(f(A),s(0)) | E(0,f(A)) | LE(f(A),0) # label(clause_94) # label(axiom). [assumption].
% 5.85/6.12 6 -E(0,f(A)) | -E(0,f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_6) # label(axiom). [assumption].
% 5.85/6.12 7 -LE(f(suc(A)),s(0)) | E(0,f(suc(A))) | LE(f(A),0) # label(clause_117) # label(axiom). [assumption].
% 5.85/6.12 8 -LE(f(A),s(s(0))) | E(s(0),f(A)) | LE(f(A),s(0)) # label(clause_20) # label(axiom). [assumption].
% 5.85/6.12 9 E(s(0),f(A)) | LE(f(A),s(0)). [copy(8),unit_del(a,1)].
% 5.85/6.12 10 -E(s(0),f(A)) | -E(s(0),f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_50) # label(axiom). [assumption].
% 5.85/6.12 11 -LE(f(suc(A)),s(s(0))) | E(s(0),f(suc(A))) | LE(f(A),s(0)) # label(clause_83) # label(axiom). [assumption].
% 5.85/6.12 12 E(s(0),f(suc(A))) | LE(f(A),s(0)). [copy(11),unit_del(a,1)].
% 5.85/6.12 26 -E(0,f(A)) | -E(0,f(suc(B))) | -iLEQ(suc(B),suc(B)) | -E(0,f(suc(A))) | -E(0,f(B)) | -iLEQ(suc(B),suc(A)) | -E(0,f(C)) | -iLEQ(suc(A),suc(C)) | -E(0,f(suc(C))). [factor(3,d,e),merge(c),merge(j),merge(k),merge(m)].
% 5.85/6.12 61 -E(s(0),f(suc(A))) | -E(s(0),f(A)) | -E(s(0),f(suc(B))) | -E(s(0),f(C)) | -E(s(0),f(suc(C))) | -iLEQ(suc(C),suc(A)) | -E(s(0),f(B)) | -iLEQ(suc(A),suc(B)) | -iLEQ(suc(A),suc(C)). [factor(4,g,i),merge(d),merge(h),merge(j),merge(m)].
% 5.85/6.12 180 -E(0,f(A)) | -E(0,f(suc(A))) | -iLEQ(suc(A),suc(A)). [factor(26,c,h),merge(d),merge(e),merge(f),merge(g),merge(h)].
% 5.85/6.12 340 -E(s(0),f(suc(A))) | -E(s(0),f(A)) | -iLEQ(suc(A),suc(A)). [factor(61,f,h),merge(c),merge(d),merge(e),merge(g),merge(h)].
% 5.85/6.12 1100 LE(f(A),s(0)) | -E(s(0),f(A)) | iLEQ(suc(A),suc(A)). [resolve(12,a,10,b)].
% 5.85/6.12 1104 LE(f(A),s(0)) | iLEQ(suc(A),suc(A)). [resolve(1100,b,9,a),merge(c)].
% 5.85/6.12 1265 LE(f(A),s(0)) | -E(s(0),f(suc(A))) | -E(s(0),f(A)). [resolve(1104,b,340,c)].
% 5.85/6.12 1299 LE(f(A),s(0)) | -E(s(0),f(A)). [resolve(1265,b,12,a),merge(c)].
% 5.85/6.12 1301 LE(f(A),s(0)). [resolve(1299,b,9,a),merge(b)].
% 5.85/6.12 1302 E(0,f(suc(A))) | LE(f(A),0). [back_unit_del(7),unit_del(a,1301)].
% 5.85/6.12 1303 E(0,f(A)) | LE(f(A),0). [back_unit_del(5),unit_del(a,1301)].
% 5.85/6.12 1305 LE(f(A),0) | -E(0,f(A)) | iLEQ(suc(A),suc(A)). [resolve(1302,a,6,b)].
% 5.85/6.12 1306 LE(f(A),0) | iLEQ(suc(A),suc(A)). [resolve(1305,b,1303,a),merge(c)].
% 5.85/6.12 1495 LE(f(A),0) | -E(0,f(A)) | -E(0,f(suc(A))). [resolve(1306,b,180,c)].
% 5.85/6.12 1497 LE(f(A),0) | -E(0,f(A)). [resolve(1495,c,1302,a),merge(c)].
% 5.85/6.12 1498 LE(f(A),0). [resolve(1497,b,1303,a),merge(b)].
% 5.85/6.12 1499 $F. [resolve(1498,a,2,a)].
% 5.85/6.12
% 5.85/6.12 % SZS output end Refutation
% 5.85/6.12 ============================== end of proof ==========================
% 5.85/6.12
% 5.85/6.12 ============================== STATISTICS ============================
% 5.85/6.12
% 5.85/6.12 Given=1084. Generated=20036. Kept=1496. proofs=1.
% 5.85/6.12 Usable=1082. Sos=381. Demods=0. Limbo=0, Disabled=42. Hints=0.
% 5.85/6.12 Megabytes=2.96.
% 5.85/6.12 User_CPU=5.11, System_CPU=0.01, Wall_clock=5.
% 5.85/6.12
% 5.85/6.12 ============================== end of statistics =====================
% 5.85/6.12
% 5.85/6.12 ============================== end of search =========================
% 5.85/6.12
% 5.85/6.12 THEOREM PROVED
% 5.85/6.12 % SZS status Unsatisfiable
% 5.85/6.12
% 5.85/6.12 Exiting with 1 proof.
% 5.85/6.12
% 5.85/6.12 Process 22053 exit (max_proofs) Fri Jul 8 20:28:16 2022
% 5.85/6.12 Prover9 interrupted
%------------------------------------------------------------------------------