TSTP Solution File: SYN375+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN375+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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.74s 1.00s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN375+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 21:28:20 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 31108 was started by sandbox2 on n006.cluster.edu,
% 0.74/1.00 Mon Jul 11 21:28:21 2022
% 0.74/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30945_n006.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_30945_n006.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (1 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/1.00 1 -((all X (big_p(X) <-> (exists Y big_p(Y)))) <-> ((all X big_p(X)) <-> (exists Y big_p(Y)))) # label(x2126) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00
% 0.74/1.00 ============================== end predicate elimination =============
% 0.74/1.00
% 0.74/1.00 Auto_denials: (non-Horn, no changes).
% 0.74/1.00
% 0.74/1.00 Term ordering decisions:
% 0.74/1.00
% 0.74/1.00 % Assigning unary symbol f1 kb_weight 0 and highest precedence (8).
% 0.74/1.00 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. f1=0.
% 0.74/1.00
% 0.74/1.00 ============================== end of process initial clauses ========
% 0.74/1.00
% 0.74/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.00
% 0.74/1.00 ============================== end of clauses for search =============
% 0.74/1.00
% 0.74/1.00 ============================== SEARCH ================================
% 0.74/1.00
% 0.74/1.00 % Starting search at 0.01 seconds.
% 0.74/1.00
% 0.74/1.00 ============================== PROOF =================================
% 0.74/1.00 % SZS status Theorem
% 0.74/1.00 % SZS output start Refutation
% 0.74/1.00
% 0.74/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.74/1.00 % Length of proof is 16.
% 0.74/1.00 % Level of proof is 10.
% 0.74/1.00 % Maximum clause weight is 8.000.
% 0.74/1.00 % Given clauses 5.
% 0.74/1.00
% 0.74/1.00 1 -((all X (big_p(X) <-> (exists Y big_p(Y)))) <-> ((all X big_p(X)) <-> (exists Y big_p(Y)))) # label(x2126) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.00 2 big_p(c3) | big_p(c4) | big_p(A) | big_p(c5) # label(x2126) # label(negated_conjecture). [clausify(1)].
% 0.74/1.00 3 -big_p(c3) | -big_p(A) | -big_p(c6) | -big_p(B) # label(x2126) # label(negated_conjecture). [clausify(1)].
% 0.74/1.00 5 big_p(A) | -big_p(B) | big_p(C) | -big_p(D) # label(x2126) # label(negated_conjecture). [clausify(1)].
% 0.74/1.00 6 big_p(c3) | big_p(c4) | big_p(c5). [factor(2,a,c)].
% 0.74/1.00 7 -big_p(c3) | -big_p(c6) | -big_p(A). [factor(3,a,b)].
% 0.74/1.00 10 big_p(A) | -big_p(B) | -big_p(C). [factor(5,a,c)].
% 0.74/1.00 12 -big_p(c3) | -big_p(c6). [factor(7,a,c)].
% 0.74/1.00 14 big_p(A) | -big_p(B). [factor(10,b,c)].
% 0.74/1.00 15 big_p(A) | big_p(c3) | big_p(c4). [resolve(14,b,6,c)].
% 0.74/1.00 16 big_p(c3) | big_p(c4). [factor(15,a,b)].
% 0.74/1.00 17 big_p(c3) | big_p(A). [resolve(16,b,14,b)].
% 0.74/1.00 18 big_p(c3). [factor(17,a,b)].
% 0.74/1.00 19 -big_p(c6). [back_unit_del(12),unit_del(a,18)].
% 0.74/1.00 20 -big_p(A). [ur(14,a,19,a)].
% 0.74/1.00 21 $F. [resolve(20,a,18,a)].
% 0.74/1.00
% 0.74/1.00 % SZS output end Refutation
% 0.74/1.00 ============================== end of proof ==========================
% 0.74/1.00
% 0.74/1.00 ============================== STATISTICS ============================
% 0.74/1.00
% 0.74/1.00 Given=5. Generated=33. Kept=19. proofs=1.
% 0.74/1.00 Usable=2. Sos=1. Demods=0. Limbo=0, Disabled=23. Hints=0.
% 0.74/1.00 Megabytes=0.03.
% 0.74/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.74/1.00
% 0.74/1.00 ============================== end of statistics =====================
% 0.74/1.00
% 0.74/1.00 ============================== end of search =========================
% 0.74/1.00
% 0.74/1.00 THEOREM PROVED
% 0.74/1.00 % SZS status Theorem
% 0.74/1.00
% 0.74/1.00 Exiting with 1 proof.
% 0.74/1.00
% 0.74/1.00 Process 31108 exit (max_proofs) Mon Jul 11 21:28:21 2022
% 0.74/1.00 Prover9 interrupted
%------------------------------------------------------------------------------