TSTP Solution File: SYO629-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO629-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:40 EDT 2022
% Result : Unsatisfiable 0.70s 1.00s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO629-1 : TPTP v8.1.0. Released v7.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 9 08:08:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.00 ============================== Prover9 ===============================
% 0.70/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.00 Process 17683 was started by sandbox2 on n022.cluster.edu,
% 0.70/1.00 Sat Jul 9 08:08:41 2022
% 0.70/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17529_n022.cluster.edu".
% 0.70/1.00 ============================== end of head ===========================
% 0.70/1.00
% 0.70/1.00 ============================== INPUT =================================
% 0.70/1.00
% 0.70/1.00 % Reading from file /tmp/Prover9_17529_n022.cluster.edu
% 0.70/1.00
% 0.70/1.00 set(prolog_style_variables).
% 0.70/1.00 set(auto2).
% 0.70/1.00 % set(auto2) -> set(auto).
% 0.70/1.00 % set(auto) -> set(auto_inference).
% 0.70/1.00 % set(auto) -> set(auto_setup).
% 0.70/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.00 % set(auto) -> set(auto_limits).
% 0.70/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.00 % set(auto) -> set(auto_denials).
% 0.70/1.00 % set(auto) -> set(auto_process).
% 0.70/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.00 % set(auto2) -> assign(stats, some).
% 0.70/1.00 % set(auto2) -> clear(echo_input).
% 0.70/1.00 % set(auto2) -> set(quiet).
% 0.70/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.00 % set(auto2) -> clear(print_given).
% 0.70/1.00 assign(lrs_ticks,-1).
% 0.70/1.00 assign(sos_limit,10000).
% 0.70/1.00 assign(order,kbo).
% 0.70/1.00 set(lex_order_vars).
% 0.70/1.00 clear(print_given).
% 0.70/1.00
% 0.70/1.00 % formulas(sos). % not echoed (12 formulas)
% 0.70/1.00
% 0.70/1.00 ============================== end of input ==========================
% 0.70/1.00
% 0.70/1.00 % From the command line: assign(max_seconds, 300).
% 0.70/1.00
% 0.70/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.00
% 0.70/1.00 % Formulas that are not ordinary clauses:
% 0.70/1.00
% 0.70/1.00 ============================== end of process non-clausal formulas ===
% 0.70/1.00
% 0.70/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.00
% 0.70/1.00 ============================== PREDICATE ELIMINATION =================
% 0.70/1.00 1 -LE(f(A),s(0)) | -iLEQ(A,B) | E(0,f(B)) | LE(f(B),0) # label(clause_10_06) # label(axiom). [assumption].
% 0.70/1.00 2 iLEQ(A,A) # label(clause_0_02) # label(axiom). [assumption].
% 0.70/1.00 3 iLEQ(A,A) # label(clause_9_12) # label(axiom). [assumption].
% 0.70/1.00 4 iLEQ(A,g(A)) # label(clause_3_09) # label(axiom). [assumption].
% 0.70/1.00 5 iLEQ(A,g(A)) # label(clause_5_10) # label(axiom). [assumption].
% 0.70/1.00 Derived: -LE(f(A),s(0)) | E(0,f(A)) | LE(f(A),0). [resolve(1,b,2,a)].
% 0.70/1.00 Derived: -LE(f(A),s(0)) | E(0,f(g(A))) | LE(f(g(A)),0). [resolve(1,b,4,a)].
% 0.70/1.00
% 0.70/1.00 ============================== end predicate elimination =============
% 0.70/1.00
% 0.70/1.00 Auto_denials: (non-Horn, no changes).
% 0.70/1.00
% 0.70/1.00 Term ordering decisions:
% 0.70/1.00 Function symbol KB weights: 0=1. f=1. g=1. s=1.
% 0.70/1.00
% 0.70/1.00 ============================== end of process initial clauses ========
% 0.70/1.00
% 0.70/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.00
% 0.70/1.00 ============================== end of clauses for search =============
% 0.70/1.00
% 0.70/1.00 ============================== SEARCH ================================
% 0.70/1.00
% 0.70/1.00 % Starting search at 0.01 seconds.
% 0.70/1.00
% 0.70/1.00 ============================== PROOF =================================
% 0.70/1.00 % SZS status Unsatisfiable
% 0.70/1.00 % SZS output start Refutation
% 0.70/1.00
% 0.70/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.70/1.00 % Length of proof is 20.
% 0.70/1.00 % Level of proof is 7.
% 0.70/1.00 % Maximum clause weight is 11.000.
% 0.70/1.00 % Given clauses 10.
% 0.70/1.00
% 0.70/1.00 1 -LE(f(A),s(0)) | -iLEQ(A,B) | E(0,f(B)) | LE(f(B),0) # label(clause_10_06) # label(axiom). [assumption].
% 0.70/1.00 2 iLEQ(A,A) # label(clause_0_02) # label(axiom). [assumption].
% 0.70/1.00 4 iLEQ(A,g(A)) # label(clause_3_09) # label(axiom). [assumption].
% 0.70/1.00 6 E(s(0),f(A)) | LE(f(A),s(0)) # label(clause_6_04) # label(axiom). [assumption].
% 0.70/1.00 7 -LE(f(A),0) # label(clause_7_05) # label(axiom). [assumption].
% 0.70/1.00 8 -E(f(A),f(g(A))) # label(clause_8_01) # label(axiom). [assumption].
% 0.70/1.00 9 -E(0,f(A)) | -E(0,f(g(A))) | E(f(A),f(g(A))) # label(clause_11_03) # label(axiom). [assumption].
% 0.70/1.00 10 -E(0,f(A)) | -E(0,f(g(A))). [copy(9),unit_del(c,8)].
% 0.70/1.00 11 -E(s(0),f(A)) | -E(s(0),f(g(A))) | E(f(A),f(g(A))) # label(clause_1_07) # label(axiom). [assumption].
% 0.70/1.00 12 -E(s(0),f(A)) | -E(s(0),f(g(A))). [copy(11),unit_del(c,8)].
% 0.70/1.00 13 -LE(f(A),s(0)) | E(0,f(A)) | LE(f(A),0). [resolve(1,b,2,a)].
% 0.70/1.00 14 -LE(f(A),s(0)) | E(0,f(A)). [copy(13),unit_del(c,7)].
% 0.70/1.00 15 -LE(f(A),s(0)) | E(0,f(g(A))) | LE(f(g(A)),0). [resolve(1,b,4,a)].
% 0.70/1.00 16 -LE(f(A),s(0)) | E(0,f(g(A))). [copy(15),unit_del(c,7)].
% 0.70/1.00 17 E(0,f(A)) | E(s(0),f(A)). [resolve(14,a,6,b)].
% 0.70/1.00 18 E(0,f(g(A))) | E(s(0),f(A)). [resolve(16,a,6,b)].
% 0.70/1.00 19 E(0,f(g(A))) | -E(s(0),f(A)). [resolve(17,b,12,b)].
% 0.70/1.00 21 E(0,f(g(A))). [resolve(19,b,18,b),merge(b)].
% 0.70/1.00 22 -E(0,f(A)). [back_unit_del(10),unit_del(b,21)].
% 0.70/1.00 23 $F. [resolve(22,a,21,a)].
% 0.70/1.00
% 0.70/1.00 % SZS output end Refutation
% 0.70/1.00 ============================== end of proof ==========================
% 0.70/1.00
% 0.70/1.00 ============================== STATISTICS ============================
% 0.70/1.00
% 0.70/1.00 Given=10. Generated=16. Kept=13. proofs=1.
% 0.70/1.00 Usable=6. Sos=0. Demods=0. Limbo=1, Disabled=19. Hints=0.
% 0.70/1.00 Megabytes=0.03.
% 0.70/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.70/1.00
% 0.70/1.00 ============================== end of statistics =====================
% 0.70/1.00
% 0.70/1.00 ============================== end of search =========================
% 0.70/1.00
% 0.70/1.00 THEOREM PROVED
% 0.70/1.00 % SZS status Unsatisfiable
% 0.70/1.00
% 0.70/1.00 Exiting with 1 proof.
% 0.70/1.00
% 0.70/1.00 Process 17683 exit (max_proofs) Sat Jul 9 08:08:41 2022
% 0.70/1.00 Prover9 interrupted
%------------------------------------------------------------------------------