TSTP Solution File: SYN380+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN380+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:44 EDT 2022
% Result : Theorem 0.41s 0.97s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN380+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jul 12 04:41:02 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.41/0.97 ============================== Prover9 ===============================
% 0.41/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.97 Process 19905 was started by sandbox on n029.cluster.edu,
% 0.41/0.97 Tue Jul 12 04:41:03 2022
% 0.41/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19751_n029.cluster.edu".
% 0.41/0.97 ============================== end of head ===========================
% 0.41/0.97
% 0.41/0.97 ============================== INPUT =================================
% 0.41/0.97
% 0.41/0.97 % Reading from file /tmp/Prover9_19751_n029.cluster.edu
% 0.41/0.97
% 0.41/0.97 set(prolog_style_variables).
% 0.41/0.97 set(auto2).
% 0.41/0.97 % set(auto2) -> set(auto).
% 0.41/0.97 % set(auto) -> set(auto_inference).
% 0.41/0.97 % set(auto) -> set(auto_setup).
% 0.41/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.97 % set(auto) -> set(auto_limits).
% 0.41/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.97 % set(auto) -> set(auto_denials).
% 0.41/0.97 % set(auto) -> set(auto_process).
% 0.41/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.97 % set(auto2) -> assign(stats, some).
% 0.41/0.97 % set(auto2) -> clear(echo_input).
% 0.41/0.97 % set(auto2) -> set(quiet).
% 0.41/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.97 % set(auto2) -> clear(print_given).
% 0.41/0.97 assign(lrs_ticks,-1).
% 0.41/0.97 assign(sos_limit,10000).
% 0.41/0.97 assign(order,kbo).
% 0.41/0.97 set(lex_order_vars).
% 0.41/0.97 clear(print_given).
% 0.41/0.97
% 0.41/0.97 % formulas(sos). % not echoed (1 formulas)
% 0.41/0.97
% 0.41/0.97 ============================== end of input ==========================
% 0.41/0.97
% 0.41/0.97 % From the command line: assign(max_seconds, 300).
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.97
% 0.41/0.97 % Formulas that are not ordinary clauses:
% 0.41/0.97 1 -((all W -big_r(W,W)) -> (exists X exists Y (-big_r(X,Y) & (big_q(Y,X) -> (all Z big_q(Z,Z)))))) # label(x2132) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/0.97
% 0.41/0.97 ============================== end of process non-clausal formulas ===
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.97
% 0.41/0.97 ============================== PREDICATE ELIMINATION =================
% 0.41/0.97 2 -big_r(A,A) # label(x2132) # label(negated_conjecture). [clausify(1)].
% 0.41/0.97 3 big_r(A,B) | big_q(B,A) # label(x2132) # label(negated_conjecture). [clausify(1)].
% 0.41/0.97 Derived: big_q(A,A). [resolve(2,a,3,a)].
% 0.41/0.97 4 big_r(A,B) | -big_q(f1(A,B),f1(A,B)) # label(x2132) # label(negated_conjecture). [clausify(1)].
% 0.41/0.97 Derived: -big_q(f1(A,A),f1(A,A)). [resolve(4,a,2,a)].
% 0.41/0.97 5 -big_q(f1(A,A),f1(A,A)). [resolve(4,a,2,a)].
% 0.41/0.97 6 big_q(A,A). [resolve(2,a,3,a)].
% 0.41/0.97 Derived: $F. [resolve(5,a,6,a)].
% 0.41/0.97
% 0.41/0.97 ============================== end predicate elimination =============
% 0.41/0.97
% 0.41/0.97 Auto_denials: (no changes).
% 0.41/0.97
% 0.41/0.97 Term ordering decisions:
% 0.41/0.97 Function symbol KB weights:
% 0.41/0.97
% 0.41/0.97 ============================== PROOF =================================
% 0.41/0.97 % SZS status Theorem
% 0.41/0.97 % SZS output start Refutation
% 0.41/0.97
% 0.41/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.41/0.97 % Length of proof is 7.
% 0.41/0.97 % Level of proof is 3.
% 0.41/0.97 % Maximum clause weight is 0.000.
% 0.41/0.97 % Given clauses 0.
% 0.41/0.97
% 0.41/0.97 1 -((all W -big_r(W,W)) -> (exists X exists Y (-big_r(X,Y) & (big_q(Y,X) -> (all Z big_q(Z,Z)))))) # label(x2132) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/0.97 2 -big_r(A,A) # label(x2132) # label(negated_conjecture). [clausify(1)].
% 0.41/0.97 3 big_r(A,B) | big_q(B,A) # label(x2132) # label(negated_conjecture). [clausify(1)].
% 0.41/0.97 4 big_r(A,B) | -big_q(f1(A,B),f1(A,B)) # label(x2132) # label(negated_conjecture). [clausify(1)].
% 0.41/0.97 5 -big_q(f1(A,A),f1(A,A)). [resolve(4,a,2,a)].
% 0.41/0.97 6 big_q(A,A). [resolve(2,a,3,a)].
% 0.41/0.97 7 $F. [resolve(5,a,6,a)].
% 0.41/0.97
% 0.41/0.97 % SZS output end Refutation
% 0.41/0.97 ============================== end of proof ==========================
% 0.41/0.97
% 0.41/0.97 ============================== STATISTICS ============================
% 0.41/0.97
% 0.41/0.97 Given=0. Generated=1. Kept=0. proofs=1.
% 0.41/0.97 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=6. Hints=0.
% 0.41/0.97 Megabytes=0.02.
% 0.41/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.97
% 0.41/0.97 ============================== end of statistics =====================
% 0.41/0.97
% 0.41/0.97 ============================== end of search =========================
% 0.41/0.97
% 0.41/0.97 THEOREM PROVED
% 0.41/0.97 % SZS status Theorem
% 0.41/0.97
% 0.41/0.97 Exiting with 1 proof.
% 0.41/0.97
% 0.41/0.97 Process 19905 exit (max_proofs) Tue Jul 12 04:41:03 2022
% 0.41/0.97 Prover9 interrupted
%------------------------------------------------------------------------------