TSTP Solution File: SYN558-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN558-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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.45s 1.01s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN558-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 11:41:58 EDT 2022
% 0.19/0.35 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 22757 was started by sandbox2 on n024.cluster.edu,
% 0.45/1.01 Mon Jul 11 11:41:59 2022
% 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22603_n024.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_22603_n024.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (14 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/1.01
% 0.45/1.01 ============================== end of process non-clausal formulas ===
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.01
% 0.45/1.01 ============================== PREDICATE ELIMINATION =================
% 0.45/1.01
% 0.45/1.01 ============================== end predicate elimination =============
% 0.45/1.01
% 0.45/1.01 Auto_denials:
% 0.45/1.01 % copying label not_p5_8 to answer in negative clause
% 0.45/1.01
% 0.45/1.01 Term ordering decisions:
% 0.45/1.01
% 0.45/1.01 % Assigning unary symbol f3 kb_weight 0 and highest precedence (9).
% 0.45/1.01 Function symbol KB weights: c7=1. c10=1. c8=1. c9=1. f3=0.
% 0.45/1.01
% 0.45/1.01 ============================== end of process initial clauses ========
% 0.45/1.01
% 0.45/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.01
% 0.45/1.01 ============================== end of clauses for search =============
% 0.45/1.01
% 0.45/1.01 ============================== SEARCH ================================
% 0.45/1.01
% 0.45/1.01 % Starting search at 0.01 seconds.
% 0.45/1.01
% 0.45/1.01 ============================== PROOF =================================
% 0.45/1.01 % SZS status Unsatisfiable
% 0.45/1.01 % SZS output start Refutation
% 0.45/1.01
% 0.45/1.01 % Proof 1 at 0.01 (+ 0.00) seconds: not_p5_8.
% 0.45/1.01 % Length of proof is 15.
% 0.45/1.01 % Level of proof is 3.
% 0.45/1.01 % Maximum clause weight is 17.000.
% 0.45/1.01 % Given clauses 21.
% 0.45/1.01
% 0.45/1.01 1 p2(A,A) # label(p2_1) # label(negated_conjecture). [assumption].
% 0.45/1.01 2 p4(A,A) # label(p4_2) # label(negated_conjecture). [assumption].
% 0.45/1.01 3 p6(c7,f3(A)) # label(p6_3) # label(negated_conjecture). [assumption].
% 0.45/1.01 4 p5(c7,c10,c9) # label(p5_4) # label(negated_conjecture). [assumption].
% 0.45/1.01 5 p5(c7,c10,c8) # label(p5_5) # label(negated_conjecture). [assumption].
% 0.45/1.01 6 p5(c7,A,f3(A)) # label(p5_6) # label(negated_conjecture). [assumption].
% 0.45/1.01 7 -p5(c7,c8,A) | -p5(c7,c9,A) # label(not_p5_8) # label(negated_conjecture) # answer(not_p5_8). [assumption].
% 0.45/1.01 11 p5(A,B,C) | -p5(A,B,D) | -p5(A,D,C) # label(p5_11) # label(negated_conjecture). [assumption].
% 0.45/1.01 13 p2(A,B) | -p6(c7,B) | -p6(c7,A) | -p5(c7,C,B) | -p5(c7,C,A) # label(p2_13) # label(negated_conjecture). [assumption].
% 0.45/1.01 14 p5(A,B,C) | -p2(D,B) | -p2(E,C) | -p4(F,A) | -p5(F,D,E) # label(p5_14) # label(negated_conjecture). [assumption].
% 0.45/1.01 15 -p5(c7,c9,f3(c8)) # answer(not_p5_8). [resolve(7,a,6,a)].
% 0.45/1.01 20 p5(c7,c10,f3(c8)). [ur(11,b,5,a,c,6,a)].
% 0.45/1.01 21 p5(c7,c10,f3(c9)). [ur(11,b,4,a,c,6,a)].
% 0.45/1.01 27 -p2(f3(c9),f3(c8)) # answer(not_p5_8). [ur(14,a,15,a,b,1,a,d,2,a,e,6,a)].
% 0.45/1.01 45 $F # answer(not_p5_8). [ur(13,b,3,a,c,3,a,d,20,a,e,21,a),unit_del(a,27)].
% 0.45/1.01
% 0.45/1.01 % SZS output end Refutation
% 0.45/1.01 ============================== end of proof ==========================
% 0.45/1.01
% 0.45/1.01 ============================== STATISTICS ============================
% 0.45/1.01
% 0.45/1.01 Given=21. Generated=70. Kept=44. proofs=1.
% 0.45/1.01 Usable=21. Sos=23. Demods=0. Limbo=0, Disabled=14. Hints=0.
% 0.45/1.01 Megabytes=0.06.
% 0.45/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.01
% 0.45/1.01 ============================== end of statistics =====================
% 0.45/1.01
% 0.45/1.01 ============================== end of search =========================
% 0.45/1.01
% 0.45/1.01 THEOREM PROVED
% 0.45/1.01 % SZS status Unsatisfiable
% 0.45/1.01
% 0.45/1.01 Exiting with 1 proof.
% 0.45/1.01
% 0.45/1.01 Process 22757 exit (max_proofs) Mon Jul 11 11:41:59 2022
% 0.45/1.01 Prover9 interrupted
%------------------------------------------------------------------------------