TSTP Solution File: SYN374+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 11:18:41 EDT 2022
% Result : Theorem 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.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 : Mon Jul 11 16:36:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 1375 was started by sandbox2 on n029.cluster.edu,
% 0.44/0.99 Mon Jul 11 16:36:17 2022
% 0.44/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1219_n029.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_1219_n029.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (1 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 -((exists X all Y (big_p(X) <-> big_p(Y))) <-> ((exists X big_p(X)) <-> (all Y big_p(Y)))) # label(x2125) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (non-Horn, no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99
% 0.44/0.99 % Assigning unary symbol f1 kb_weight 0 and highest precedence (7).
% 0.44/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. f1=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of process initial clauses ========
% 0.44/0.99
% 0.44/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.99
% 0.44/0.99 ============================== end of clauses for search =============
% 0.44/0.99
% 0.44/0.99 ============================== SEARCH ================================
% 0.44/0.99
% 0.44/0.99 % Starting search at 0.01 seconds.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.99 % Length of proof is 17.
% 0.44/0.99 % Level of proof is 7.
% 0.44/0.99 % Maximum clause weight is 9.000.
% 0.44/0.99 % Given clauses 9.
% 0.44/0.99
% 0.44/0.99 1 -((exists X all Y (big_p(X) <-> big_p(Y))) <-> ((exists X big_p(X)) <-> (all Y big_p(Y)))) # label(x2125) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99 2 big_p(A) | big_p(f1(A)) | big_p(c4) | big_p(B) # label(x2125) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 3 -big_p(A) | -big_p(f1(A)) | -big_p(B) | -big_p(c5) # label(x2125) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 4 -big_p(c1) | big_p(A) | -big_p(B) | big_p(C) # label(x2125) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 5 big_p(c1) | -big_p(A) | -big_p(B) | big_p(C) # label(x2125) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 8 big_p(c4) | big_p(f1(c4)) | big_p(A). [factor(2,a,c)].
% 0.44/0.99 10 -big_p(A) | -big_p(f1(A)) | -big_p(c5). [factor(3,a,c)].
% 0.44/0.99 11 -big_p(c1) | big_p(A) | big_p(B). [factor(4,a,c)].
% 0.44/0.99 13 big_p(c1) | -big_p(A) | -big_p(B). [factor(5,a,d)].
% 0.44/0.99 17 big_p(c4) | big_p(f1(c4)). [factor(8,a,c)].
% 0.44/0.99 18 -big_p(c5) | -big_p(f1(c5)). [factor(10,a,c)].
% 0.44/0.99 19 -big_p(c1) | big_p(A). [factor(11,b,c)].
% 0.44/0.99 20 big_p(c1) | -big_p(A). [factor(13,b,c)].
% 0.44/0.99 21 big_p(c1) | big_p(c4). [resolve(20,b,17,b)].
% 0.44/0.99 24 big_p(c1). [resolve(21,b,20,b),merge(b)].
% 0.44/0.99 25 big_p(A). [back_unit_del(19),unit_del(a,24)].
% 0.44/0.99 26 $F. [back_unit_del(18),unit_del(a,25),unit_del(b,25)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=9. Generated=42. Kept=24. proofs=1.
% 0.44/0.99 Usable=1. Sos=0. Demods=0. Limbo=1, Disabled=30. Hints=0.
% 0.44/0.99 Megabytes=0.04.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=1.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 1375 exit (max_proofs) Mon Jul 11 16:36:18 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------