TSTP Solution File: SYN726-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN726-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:22:08 EDT 2022
% Result : Unsatisfiable 0.74s 0.99s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN726-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 22:39:42 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.74/0.99 ============================== Prover9 ===============================
% 0.74/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.74/0.99 Process 23125 was started by sandbox on n011.cluster.edu,
% 0.74/0.99 Mon Jul 11 22:39:43 2022
% 0.74/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22796_n011.cluster.edu".
% 0.74/0.99 ============================== end of head ===========================
% 0.74/0.99
% 0.74/0.99 ============================== INPUT =================================
% 0.74/0.99
% 0.74/0.99 % Reading from file /tmp/Prover9_22796_n011.cluster.edu
% 0.74/0.99
% 0.74/0.99 set(prolog_style_variables).
% 0.74/0.99 set(auto2).
% 0.74/0.99 % set(auto2) -> set(auto).
% 0.74/0.99 % set(auto) -> set(auto_inference).
% 0.74/0.99 % set(auto) -> set(auto_setup).
% 0.74/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.74/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/0.99 % set(auto) -> set(auto_limits).
% 0.74/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/0.99 % set(auto) -> set(auto_denials).
% 0.74/0.99 % set(auto) -> set(auto_process).
% 0.74/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.74/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.74/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.74/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.74/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.74/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.74/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.74/0.99 % set(auto2) -> assign(stats, some).
% 0.74/0.99 % set(auto2) -> clear(echo_input).
% 0.74/0.99 % set(auto2) -> set(quiet).
% 0.74/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.74/0.99 % set(auto2) -> clear(print_given).
% 0.74/0.99 assign(lrs_ticks,-1).
% 0.74/0.99 assign(sos_limit,10000).
% 0.74/0.99 assign(order,kbo).
% 0.74/0.99 set(lex_order_vars).
% 0.74/0.99 clear(print_given).
% 0.74/0.99
% 0.74/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.74/0.99
% 0.74/0.99 ============================== end of input ==========================
% 0.74/0.99
% 0.74/0.99 % From the command line: assign(max_seconds, 300).
% 0.74/0.99
% 0.74/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/0.99
% 0.74/0.99 % Formulas that are not ordinary clauses:
% 0.74/0.99
% 0.74/0.99 ============================== end of process non-clausal formulas ===
% 0.74/0.99
% 0.74/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/0.99
% 0.74/0.99 ============================== PREDICATE ELIMINATION =================
% 0.74/0.99
% 0.74/0.99 ============================== end predicate elimination =============
% 0.74/0.99
% 0.74/0.99 Auto_denials: (non-Horn, no changes).
% 0.74/0.99
% 0.74/0.99 Term ordering decisions:
% 0.74/0.99 Function symbol KB weights: sk1=1. sk2=1. sk3=1. sk4=1.
% 0.74/0.99
% 0.74/0.99 ============================== end of process initial clauses ========
% 0.74/0.99
% 0.74/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.74/0.99
% 0.74/0.99 ============================== end of clauses for search =============
% 0.74/0.99
% 0.74/0.99 ============================== SEARCH ================================
% 0.74/0.99
% 0.74/0.99 % Starting search at 0.01 seconds.
% 0.74/0.99
% 0.74/0.99 ============================== PROOF =================================
% 0.74/0.99 % SZS status Unsatisfiable
% 0.74/0.99 % SZS output start Refutation
% 0.74/0.99
% 0.74/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.74/0.99 % Length of proof is 18.
% 0.74/0.99 % Level of proof is 7.
% 0.74/0.99 % Maximum clause weight is 9.000.
% 0.74/0.99 % Given clauses 21.
% 0.74/0.99
% 0.74/0.99 1 p(A,B) | q(A,B) # label(thm400_4) # label(negated_conjecture). [assumption].
% 0.74/0.99 2 -p(sk1,sk2) # label(thm400_5) # label(negated_conjecture). [assumption].
% 0.74/0.99 3 -q(sk3,sk4) # label(thm400_6) # label(negated_conjecture). [assumption].
% 0.74/0.99 4 q(A,B) | -q(B,A) # label(thm400_3) # label(negated_conjecture). [assumption].
% 0.74/0.99 5 p(A,B) | -p(A,C) | -p(C,B) # label(thm400_1) # label(negated_conjecture). [assumption].
% 0.74/0.99 6 q(A,B) | -q(A,C) | -q(C,B) # label(thm400_2) # label(negated_conjecture). [assumption].
% 0.74/0.99 7 q(sk1,sk2). [resolve(2,a,1,a)].
% 0.74/0.99 8 -q(sk4,sk3). [ur(4,a,3,a)].
% 0.74/0.99 9 p(A,B) | -p(C,B) | q(A,C). [resolve(5,b,1,a)].
% 0.74/0.99 13 q(sk2,sk1). [resolve(7,a,4,b)].
% 0.74/0.99 15 q(sk2,A) | -q(sk1,A). [resolve(13,a,6,b)].
% 0.74/0.99 18 p(A,B) | q(A,C) | q(C,B). [resolve(9,b,1,a)].
% 0.74/0.99 22 q(sk1,A) | q(A,sk2). [resolve(18,a,2,a)].
% 0.74/0.99 23 q(A,sk2) | q(sk2,A). [resolve(22,a,15,b)].
% 0.74/0.99 33 q(sk2,A). [resolve(23,a,4,b),merge(b)].
% 0.74/0.99 35 q(A,sk2). [resolve(23,b,4,b),merge(b)].
% 0.74/0.99 39 q(A,B). [resolve(33,a,6,c),unit_del(b,35)].
% 0.74/0.99 40 $F. [resolve(39,a,8,a)].
% 0.74/0.99
% 0.74/0.99 % SZS output end Refutation
% 0.74/0.99 ============================== end of proof ==========================
% 0.74/0.99
% 0.74/0.99 ============================== STATISTICS ============================
% 0.74/0.99
% 0.74/0.99 Given=21. Generated=83. Kept=39. proofs=1.
% 0.74/0.99 Usable=11. Sos=6. Demods=0. Limbo=0, Disabled=27. Hints=0.
% 0.74/0.99 Megabytes=0.04.
% 0.74/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.74/0.99
% 0.74/0.99 ============================== end of statistics =====================
% 0.74/0.99
% 0.74/0.99 ============================== end of search =========================
% 0.74/0.99
% 0.74/0.99 THEOREM PROVED
% 0.74/0.99 % SZS status Unsatisfiable
% 0.74/0.99
% 0.74/0.99 Exiting with 1 proof.
% 0.74/0.99
% 0.74/0.99 Process 23125 exit (max_proofs) Mon Jul 11 22:39:43 2022
% 0.74/0.99 Prover9 interrupted
%------------------------------------------------------------------------------