TSTP Solution File: SYN559-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN559-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:21:04 EDT 2022
% Result : Unsatisfiable 0.49s 1.03s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SYN559-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jul 12 03:23:27 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.49/1.03 ============================== Prover9 ===============================
% 0.49/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.03 Process 4175 was started by sandbox2 on n012.cluster.edu,
% 0.49/1.03 Tue Jul 12 03:23:28 2022
% 0.49/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3808_n012.cluster.edu".
% 0.49/1.03 ============================== end of head ===========================
% 0.49/1.03
% 0.49/1.03 ============================== INPUT =================================
% 0.49/1.03
% 0.49/1.03 % Reading from file /tmp/Prover9_3808_n012.cluster.edu
% 0.49/1.03
% 0.49/1.03 set(prolog_style_variables).
% 0.49/1.03 set(auto2).
% 0.49/1.03 % set(auto2) -> set(auto).
% 0.49/1.03 % set(auto) -> set(auto_inference).
% 0.49/1.03 % set(auto) -> set(auto_setup).
% 0.49/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.03 % set(auto) -> set(auto_limits).
% 0.49/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.03 % set(auto) -> set(auto_denials).
% 0.49/1.03 % set(auto) -> set(auto_process).
% 0.49/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.03 % set(auto2) -> assign(stats, some).
% 0.49/1.03 % set(auto2) -> clear(echo_input).
% 0.49/1.03 % set(auto2) -> set(quiet).
% 0.49/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.03 % set(auto2) -> clear(print_given).
% 0.49/1.03 assign(lrs_ticks,-1).
% 0.49/1.03 assign(sos_limit,10000).
% 0.49/1.03 assign(order,kbo).
% 0.49/1.03 set(lex_order_vars).
% 0.49/1.03 clear(print_given).
% 0.49/1.03
% 0.49/1.03 % formulas(sos). % not echoed (14 formulas)
% 0.49/1.03
% 0.49/1.03 ============================== end of input ==========================
% 0.49/1.03
% 0.49/1.03 % From the command line: assign(max_seconds, 300).
% 0.49/1.03
% 0.49/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.03
% 0.49/1.03 % Formulas that are not ordinary clauses:
% 0.49/1.03
% 0.49/1.03 ============================== end of process non-clausal formulas ===
% 0.49/1.03
% 0.49/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.03
% 0.49/1.03 ============================== PREDICATE ELIMINATION =================
% 0.49/1.03
% 0.49/1.03 ============================== end predicate elimination =============
% 0.49/1.03
% 0.49/1.03 Auto_denials:
% 0.49/1.03 % copying label not_p8_14 to answer in negative clause
% 0.49/1.03
% 0.49/1.03 Term ordering decisions:
% 0.49/1.03
% 0.49/1.03 % Assigning unary symbol f4 kb_weight 0 and highest precedence (14).
% 0.49/1.03 Function symbol KB weights: c13=1. c10=1. c14=1. c15=1. c9=1. c11=1. c12=1. f3=1. f5=1. f6=1. f4=0.
% 0.49/1.03
% 0.49/1.03 ============================== end of process initial clauses ========
% 0.49/1.03
% 0.49/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.49/1.03
% 0.49/1.03 ============================== end of clauses for search =============
% 0.49/1.03
% 0.49/1.03 ============================== SEARCH ================================
% 0.49/1.03
% 0.49/1.03 % Starting search at 0.01 seconds.
% 0.49/1.03
% 0.49/1.03 ============================== PROOF =================================
% 0.49/1.03 % SZS status Unsatisfiable
% 0.49/1.03 % SZS output start Refutation
% 0.49/1.03
% 0.49/1.03 % Proof 1 at 0.01 (+ 0.00) seconds: not_p8_14.
% 0.49/1.03 % Length of proof is 13.
% 0.49/1.03 % Level of proof is 3.
% 0.49/1.03 % Maximum clause weight is 19.000.
% 0.49/1.03 % Given clauses 20.
% 0.49/1.03
% 0.49/1.03 1 p2(A,A) # label(p2_1) # label(negated_conjecture). [assumption].
% 0.49/1.03 2 p8(c13,c9) # label(p8_2) # label(negated_conjecture). [assumption].
% 0.49/1.03 3 p7(c10,c13) # label(p7_3) # label(negated_conjecture). [assumption].
% 0.49/1.03 4 p2(f6(c9,c13),c14) # label(p2_4) # label(negated_conjecture). [assumption].
% 0.49/1.03 5 p2(f5(c14,c10),c15) # label(p2_5) # label(negated_conjecture). [assumption].
% 0.49/1.03 6 p2(f3(f4(c11),c12),c15) # label(p2_6) # label(negated_conjecture). [assumption].
% 0.49/1.03 7 -p8(A,c9) | -p7(c10,A) | -p2(f6(c9,A),B) | -p2(f5(B,c10),f3(f4(c11),c12)) # label(not_p8_14) # label(negated_conjecture) # answer(not_p8_14). [assumption].
% 0.49/1.03 9 p2(A,B) | -p2(C,A) | -p2(C,B) # label(p2_8) # label(negated_conjecture). [assumption].
% 0.49/1.03 16 -p2(f5(c14,c10),f3(f4(c11),c12)) # answer(not_p8_14). [resolve(7,c,4,a),unit_del(a,2),unit_del(b,3)].
% 0.49/1.03 24 p2(c15,f3(f4(c11),c12)). [ur(9,b,6,a,c,1,a)].
% 0.49/1.03 25 p2(c15,f5(c14,c10)). [ur(9,b,5,a,c,1,a)].
% 0.49/1.03 79 -p2(f3(f4(c11),c12),f5(c14,c10)) # answer(not_p8_14). [ur(9,a,16,a,c,1,a)].
% 0.49/1.03 110 $F # answer(not_p8_14). [ur(9,a,79,a,c,25,a),unit_del(a,24)].
% 0.49/1.03
% 0.49/1.03 % SZS output end Refutation
% 0.49/1.03 ============================== end of proof ==========================
% 0.49/1.03
% 0.49/1.03 ============================== STATISTICS ============================
% 0.49/1.03
% 0.49/1.03 Given=20. Generated=144. Kept=109. proofs=1.
% 0.49/1.03 Usable=20. Sos=61. Demods=0. Limbo=28, Disabled=14. Hints=0.
% 0.49/1.03 Megabytes=0.12.
% 0.49/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.49/1.03
% 0.49/1.03 ============================== end of statistics =====================
% 0.49/1.03
% 0.49/1.03 ============================== end of search =========================
% 0.49/1.03
% 0.49/1.03 THEOREM PROVED
% 0.49/1.03 % SZS status Unsatisfiable
% 0.49/1.03
% 0.49/1.03 Exiting with 1 proof.
% 0.49/1.03
% 0.49/1.03 Process 4175 exit (max_proofs) Tue Jul 12 03:23:28 2022
% 0.49/1.03 Prover9 interrupted
%------------------------------------------------------------------------------