TSTP Solution File: SYN356+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN356+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:31 EDT 2022
% Result : Theorem 0.43s 1.05s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN356+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 03:07:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.05 ============================== Prover9 ===============================
% 0.43/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.05 Process 11939 was started by sandbox2 on n013.cluster.edu,
% 0.43/1.05 Tue Jul 12 03:07:30 2022
% 0.43/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11785_n013.cluster.edu".
% 0.43/1.05 ============================== end of head ===========================
% 0.43/1.05
% 0.43/1.05 ============================== INPUT =================================
% 0.43/1.05
% 0.43/1.05 % Reading from file /tmp/Prover9_11785_n013.cluster.edu
% 0.43/1.05
% 0.43/1.05 set(prolog_style_variables).
% 0.43/1.05 set(auto2).
% 0.43/1.05 % set(auto2) -> set(auto).
% 0.43/1.05 % set(auto) -> set(auto_inference).
% 0.43/1.05 % set(auto) -> set(auto_setup).
% 0.43/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.05 % set(auto) -> set(auto_limits).
% 0.43/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.05 % set(auto) -> set(auto_denials).
% 0.43/1.05 % set(auto) -> set(auto_process).
% 0.43/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.05 % set(auto2) -> assign(stats, some).
% 0.43/1.05 % set(auto2) -> clear(echo_input).
% 0.43/1.05 % set(auto2) -> set(quiet).
% 0.43/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.05 % set(auto2) -> clear(print_given).
% 0.43/1.05 assign(lrs_ticks,-1).
% 0.43/1.05 assign(sos_limit,10000).
% 0.43/1.05 assign(order,kbo).
% 0.43/1.05 set(lex_order_vars).
% 0.43/1.05 clear(print_given).
% 0.43/1.05
% 0.43/1.05 % formulas(sos). % not echoed (1 formulas)
% 0.43/1.05
% 0.43/1.05 ============================== end of input ==========================
% 0.43/1.05
% 0.43/1.05 % From the command line: assign(max_seconds, 300).
% 0.43/1.05
% 0.43/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.05
% 0.43/1.05 % Formulas that are not ordinary clauses:
% 0.43/1.05 1 -(big_r(a,b) & (all X all Y (big_r(X,Y) -> big_r(Y,X) & big_q(X,Y))) & (all U all V (big_q(U,V) -> big_q(U,U))) -> big_q(a,a) & big_q(b,b)) # label(x2107) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.05
% 0.43/1.05 ============================== end of process non-clausal formulas ===
% 0.43/1.05
% 0.43/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.05
% 0.43/1.05 ============================== PREDICATE ELIMINATION =================
% 0.43/1.05
% 0.43/1.05 ============================== end predicate elimination =============
% 0.43/1.05
% 0.43/1.05 Auto_denials:
% 0.43/1.05 % copying label x2107 to answer in negative clause
% 0.43/1.05
% 0.43/1.05 Term ordering decisions:
% 0.43/1.05 Function symbol KB weights: a=1. b=1.
% 0.43/1.05
% 0.43/1.05 ============================== end of process initial clauses ========
% 0.43/1.05
% 0.43/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.05
% 0.43/1.05 ============================== end of clauses for search =============
% 0.43/1.05
% 0.43/1.05 ============================== SEARCH ================================
% 0.43/1.05
% 0.43/1.05 % Starting search at 0.01 seconds.
% 0.43/1.05
% 0.43/1.05 ============================== PROOF =================================
% 0.43/1.05 % SZS status Theorem
% 0.43/1.05 % SZS output start Refutation
% 0.43/1.05
% 0.43/1.05 % Proof 1 at 0.01 (+ 0.00) seconds: x2107.
% 0.43/1.05 % Length of proof is 13.
% 0.43/1.05 % Level of proof is 5.
% 0.43/1.05 % Maximum clause weight is 6.000.
% 0.43/1.05 % Given clauses 11.
% 0.43/1.05
% 0.43/1.05 1 -(big_r(a,b) & (all X all Y (big_r(X,Y) -> big_r(Y,X) & big_q(X,Y))) & (all U all V (big_q(U,V) -> big_q(U,U))) -> big_q(a,a) & big_q(b,b)) # label(x2107) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.05 2 big_r(a,b) # label(x2107) # label(negated_conjecture). [clausify(1)].
% 0.43/1.05 3 -big_q(a,a) | -big_q(b,b) # label(x2107) # label(negated_conjecture) # answer(x2107). [clausify(1)].
% 0.43/1.05 4 -big_r(A,B) | big_r(B,A) # label(x2107) # label(negated_conjecture). [clausify(1)].
% 0.43/1.05 5 -big_r(A,B) | big_q(A,B) # label(x2107) # label(negated_conjecture). [clausify(1)].
% 0.43/1.05 6 -big_q(A,B) | big_q(A,A) # label(x2107) # label(negated_conjecture). [clausify(1)].
% 0.43/1.05 7 big_r(b,a). [ur(4,a,2,a)].
% 0.43/1.05 10 big_q(a,b). [ur(5,a,2,a)].
% 0.43/1.05 11 -big_q(b,A) | -big_q(a,a) # answer(x2107). [resolve(6,b,3,b)].
% 0.43/1.05 17 -big_q(a,a) | -big_r(b,A) # answer(x2107). [resolve(11,a,5,b)].
% 0.43/1.05 21 big_q(a,a). [ur(6,a,10,a)].
% 0.43/1.05 22 -big_r(b,A) # answer(x2107). [back_unit_del(17),unit_del(a,21)].
% 0.43/1.05 23 $F # answer(x2107). [resolve(22,a,7,a)].
% 0.43/1.05
% 0.43/1.05 % SZS output end Refutation
% 0.43/1.05 ============================== end of proof ==========================
% 0.43/1.05
% 0.43/1.05 ============================== STATISTICS ============================
% 0.43/1.05
% 0.43/1.05 Given=11. Generated=30. Kept=21. proofs=1.
% 0.43/1.05 Usable=6. Sos=4. Demods=0. Limbo=1, Disabled=14. Hints=0.
% 0.43/1.05 Megabytes=0.04.
% 0.43/1.05 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/1.05
% 0.43/1.05 ============================== end of statistics =====================
% 0.43/1.05
% 0.43/1.05 ============================== end of search =========================
% 0.43/1.05
% 0.43/1.05 THEOREM PROVED
% 0.43/1.05 % SZS status Theorem
% 0.43/1.05
% 0.43/1.05 Exiting with 1 proof.
% 0.43/1.05
% 0.43/1.05 Process 11939 exit (max_proofs) Tue Jul 12 03:07:30 2022
% 0.43/1.05 Prover9 interrupted
%------------------------------------------------------------------------------