TSTP Solution File: MSC012+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MSC012+1 : TPTP v8.1.0. Released v3.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 : Sun Jul 17 22:56:35 EDT 2022
% Result : Theorem 0.43s 1.08s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n015.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 1 16:53:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.08 ============================== Prover9 ===============================
% 0.43/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.08 Process 976 was started by sandbox2 on n015.cluster.edu,
% 0.43/1.08 Fri Jul 1 16:53:14 2022
% 0.43/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_801_n015.cluster.edu".
% 0.43/1.08 ============================== end of head ===========================
% 0.43/1.08
% 0.43/1.08 ============================== INPUT =================================
% 0.43/1.08
% 0.43/1.08 % Reading from file /tmp/Prover9_801_n015.cluster.edu
% 0.43/1.08
% 0.43/1.08 set(prolog_style_variables).
% 0.43/1.08 set(auto2).
% 0.43/1.08 % set(auto2) -> set(auto).
% 0.43/1.08 % set(auto) -> set(auto_inference).
% 0.43/1.08 % set(auto) -> set(auto_setup).
% 0.43/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.08 % set(auto) -> set(auto_limits).
% 0.43/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.08 % set(auto) -> set(auto_denials).
% 0.43/1.08 % set(auto) -> set(auto_process).
% 0.43/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.08 % set(auto2) -> assign(stats, some).
% 0.43/1.08 % set(auto2) -> clear(echo_input).
% 0.43/1.08 % set(auto2) -> set(quiet).
% 0.43/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.08 % set(auto2) -> clear(print_given).
% 0.43/1.08 assign(lrs_ticks,-1).
% 0.43/1.08 assign(sos_limit,10000).
% 0.43/1.08 assign(order,kbo).
% 0.43/1.08 set(lex_order_vars).
% 0.43/1.08 clear(print_given).
% 0.43/1.08
% 0.43/1.08 % formulas(sos). % not echoed (5 formulas)
% 0.43/1.08
% 0.43/1.08 ============================== end of input ==========================
% 0.43/1.08
% 0.43/1.08 % From the command line: assign(max_seconds, 300).
% 0.43/1.08
% 0.43/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.08
% 0.43/1.08 % Formulas that are not ordinary clauses:
% 0.43/1.08 1 (all A all B (p(A) & less(A,B) & p(B) -> goal)) # label(left_to_right) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 2 (all A (p(A) | (exists B (less(A,B) & p(B))))) # label(right_to_left) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 3 (all A all B all C (less(A,B) & less(B,C) -> less(A,C))) # label(transitive_less) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 4 (all A exists B less(A,B)) # label(serial_less) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08
% 0.43/1.08 ============================== end of process non-clausal formulas ===
% 0.43/1.08
% 0.43/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.08
% 0.43/1.08 ============================== PREDICATE ELIMINATION =================
% 0.43/1.08
% 0.43/1.08 ============================== end predicate elimination =============
% 0.43/1.08
% 0.43/1.08 Auto_denials: (non-Horn, no changes).
% 0.43/1.08
% 0.43/1.08 Term ordering decisions:
% 0.43/1.08 Function symbol KB weights: f1=1. f2=1.
% 0.43/1.08
% 0.43/1.08 ============================== end of process initial clauses ========
% 0.43/1.08
% 0.43/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.08
% 0.43/1.08 ============================== end of clauses for search =============
% 0.43/1.08
% 0.43/1.08 ============================== SEARCH ================================
% 0.43/1.08
% 0.43/1.08 % Starting search at 0.01 seconds.
% 0.43/1.08
% 0.43/1.08 ============================== PROOF =================================
% 0.43/1.08 % SZS status Theorem
% 0.43/1.08 % SZS output start Refutation
% 0.43/1.08
% 0.43/1.08 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/1.08 % Length of proof is 26.
% 0.43/1.08 % Level of proof is 9.
% 0.43/1.08 % Maximum clause weight is 9.000.
% 0.43/1.08 % Given clauses 34.
% 0.43/1.08
% 0.43/1.08 1 (all A all B (p(A) & less(A,B) & p(B) -> goal)) # label(left_to_right) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 2 (all A (p(A) | (exists B (less(A,B) & p(B))))) # label(right_to_left) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 3 (all A all B all C (less(A,B) & less(B,C) -> less(A,C))) # label(transitive_less) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 4 (all A exists B less(A,B)) # label(serial_less) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 5 less(A,f2(A)) # label(serial_less) # label(axiom). [clausify(4)].
% 0.43/1.08 6 p(A) | p(f1(A)) # label(right_to_left) # label(axiom). [clausify(2)].
% 0.43/1.08 7 p(A) | less(A,f1(A)) # label(right_to_left) # label(axiom). [clausify(2)].
% 0.43/1.08 8 -goal # label(goal_to_be_proved) # label(negated_conjecture). [assumption].
% 0.43/1.08 9 -p(A) | -less(A,B) | -p(B) | goal # label(left_to_right) # label(axiom). [clausify(1)].
% 0.43/1.08 10 -p(A) | -less(A,B) | -p(B). [copy(9),unit_del(d,8)].
% 0.43/1.08 11 -less(A,B) | -less(B,C) | less(A,C) # label(transitive_less) # label(axiom). [clausify(3)].
% 0.43/1.08 13 -p(A) | -p(f2(A)). [resolve(10,b,5,a)].
% 0.43/1.08 15 -less(f2(A),B) | less(A,B). [resolve(11,a,5,a)].
% 0.43/1.08 17 -less(A,B) | less(A,f2(B)). [resolve(11,b,5,a)].
% 0.43/1.08 18 less(A,f1(f2(A))) | p(f2(A)). [resolve(15,a,7,b)].
% 0.43/1.08 19 less(A,f2(f2(A))). [resolve(15,a,5,a)].
% 0.43/1.08 20 less(A,f2(f2(f2(A)))). [resolve(19,a,15,a)].
% 0.43/1.08 24 less(A,f2(f2(f2(f2(A))))). [resolve(20,a,15,a)].
% 0.43/1.08 31 less(A,f2(f2(f2(f2(f2(A)))))). [resolve(24,a,17,a)].
% 0.43/1.08 43 p(f2(A)) | -p(A) | -p(f1(f2(A))). [resolve(18,a,10,b)].
% 0.43/1.08 58 -p(A) | -p(f2(f2(f2(f2(f2(A)))))). [resolve(31,a,10,b)].
% 0.43/1.08 76 p(f2(A)) | -p(A). [resolve(43,c,6,b),merge(c)].
% 0.43/1.08 77 p(f2(f1(A))) | p(A). [resolve(76,b,6,b)].
% 0.43/1.08 85 p(A) | -p(f1(A)). [resolve(77,a,13,b)].
% 0.43/1.08 86 p(A). [resolve(85,b,6,b),merge(b)].
% 0.43/1.08 87 $F. [back_unit_del(58),unit_del(a,86),unit_del(b,86)].
% 0.43/1.08
% 0.43/1.08 % SZS output end Refutation
% 0.43/1.08 ============================== end of proof ==========================
% 0.43/1.08
% 0.43/1.08 ============================== STATISTICS ============================
% 0.43/1.08
% 0.43/1.08 Given=34. Generated=146. Kept=81. proofs=1.
% 0.43/1.08 Usable=19. Sos=7. Demods=0. Limbo=1, Disabled=60. Hints=0.
% 0.43/1.08 Megabytes=0.07.
% 0.43/1.08 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/1.08
% 0.43/1.08 ============================== end of statistics =====================
% 0.43/1.08
% 0.43/1.08 ============================== end of search =========================
% 0.43/1.08
% 0.43/1.08 THEOREM PROVED
% 0.43/1.08 % SZS status Theorem
% 0.43/1.08
% 0.43/1.08 Exiting with 1 proof.
% 0.43/1.08
% 0.43/1.08 Process 976 exit (max_proofs) Fri Jul 1 16:53:14 2022
% 0.43/1.08 Prover9 interrupted
%------------------------------------------------------------------------------