TSTP Solution File: SYN728-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN728-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:10 EDT 2022
% Result : Unsatisfiable 0.46s 1.00s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN728-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n018.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 : Tue Jul 12 04:30:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.00 ============================== Prover9 ===============================
% 0.46/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.00 Process 14116 was started by sandbox on n018.cluster.edu,
% 0.46/1.00 Tue Jul 12 04:31:00 2022
% 0.46/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13961_n018.cluster.edu".
% 0.46/1.00 ============================== end of head ===========================
% 0.46/1.00
% 0.46/1.00 ============================== INPUT =================================
% 0.46/1.00
% 0.46/1.00 % Reading from file /tmp/Prover9_13961_n018.cluster.edu
% 0.46/1.00
% 0.46/1.00 set(prolog_style_variables).
% 0.46/1.00 set(auto2).
% 0.46/1.00 % set(auto2) -> set(auto).
% 0.46/1.00 % set(auto) -> set(auto_inference).
% 0.46/1.00 % set(auto) -> set(auto_setup).
% 0.46/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.00 % set(auto) -> set(auto_limits).
% 0.46/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.00 % set(auto) -> set(auto_denials).
% 0.46/1.00 % set(auto) -> set(auto_process).
% 0.46/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.00 % set(auto2) -> assign(stats, some).
% 0.46/1.00 % set(auto2) -> clear(echo_input).
% 0.46/1.00 % set(auto2) -> set(quiet).
% 0.46/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.00 % set(auto2) -> clear(print_given).
% 0.46/1.00 assign(lrs_ticks,-1).
% 0.46/1.00 assign(sos_limit,10000).
% 0.46/1.00 assign(order,kbo).
% 0.46/1.00 set(lex_order_vars).
% 0.46/1.00 clear(print_given).
% 0.46/1.00
% 0.46/1.00 % formulas(sos). % not echoed (5 formulas)
% 0.46/1.00
% 0.46/1.00 ============================== end of input ==========================
% 0.46/1.00
% 0.46/1.00 % From the command line: assign(max_seconds, 300).
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.00
% 0.46/1.00 % Formulas that are not ordinary clauses:
% 0.46/1.00
% 0.46/1.00 ============================== end of process non-clausal formulas ===
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.00
% 0.46/1.00 ============================== PREDICATE ELIMINATION =================
% 0.46/1.00 1 -m(g(A)) | -q(A) # label(thm69_4) # label(negated_conjecture). [assumption].
% 0.46/1.00 2 m(A) | p(A,sk1(A)) # label(thm69_2) # label(negated_conjecture). [assumption].
% 0.46/1.00 Derived: -q(A) | p(g(A),sk1(g(A))). [resolve(1,a,2,a)].
% 0.46/1.00 3 -q(A) | p(g(A),sk1(g(A))). [resolve(1,a,2,a)].
% 0.46/1.00 4 q(f(A,sk1(A))) | p(A,sk1(A)) # label(thm69_3) # label(negated_conjecture). [assumption].
% 0.46/1.00 Derived: p(g(f(A,sk1(A))),sk1(g(f(A,sk1(A))))) | p(A,sk1(A)). [resolve(3,a,4,a)].
% 0.46/1.00
% 0.46/1.00 ============================== end predicate elimination =============
% 0.46/1.00
% 0.46/1.00 Auto_denials: (non-Horn, no changes).
% 0.46/1.00
% 0.46/1.00 Term ordering decisions:
% 0.46/1.00 Function symbol KB weights: sk2=1. f=1. sk1=1. g=1.
% 0.46/1.00
% 0.46/1.00 ============================== end of process initial clauses ========
% 0.46/1.00
% 0.46/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.00
% 0.46/1.00 ============================== end of clauses for search =============
% 0.46/1.00
% 0.46/1.00 ============================== SEARCH ================================
% 0.46/1.00
% 0.46/1.00 % Starting search at 0.01 seconds.
% 0.46/1.00
% 0.46/1.00 ============================== PROOF =================================
% 0.46/1.00 % SZS status Unsatisfiable
% 0.46/1.00 % SZS output start Refutation
% 0.46/1.00
% 0.46/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/1.00 % Length of proof is 14.
% 0.46/1.00 % Level of proof is 7.
% 0.46/1.00 % Maximum clause weight is 16.000.
% 0.46/1.00 % Given clauses 4.
% 0.46/1.00
% 0.46/1.00 1 -m(g(A)) | -q(A) # label(thm69_4) # label(negated_conjecture). [assumption].
% 0.46/1.00 2 m(A) | p(A,sk1(A)) # label(thm69_2) # label(negated_conjecture). [assumption].
% 0.46/1.00 3 -q(A) | p(g(A),sk1(g(A))). [resolve(1,a,2,a)].
% 0.46/1.00 4 q(f(A,sk1(A))) | p(A,sk1(A)) # label(thm69_3) # label(negated_conjecture). [assumption].
% 0.46/1.00 5 -p(sk2,sk2) | -p(g(sk2),A) # label(thm69_5) # label(negated_conjecture). [assumption].
% 0.46/1.00 6 p(A,A) | -p(B,C) # label(thm69_1) # label(negated_conjecture). [assumption].
% 0.46/1.00 7 p(g(f(A,sk1(A))),sk1(g(f(A,sk1(A))))) | p(A,sk1(A)). [resolve(3,a,4,a)].
% 0.46/1.00 8 p(A,sk1(A)) | p(B,B). [resolve(7,a,6,b)].
% 0.46/1.00 9 p(A,A) | p(B,B). [resolve(8,a,6,b)].
% 0.46/1.00 10 p(A,sk1(A)) | -p(sk2,sk2). [resolve(8,b,5,b)].
% 0.46/1.00 11 p(A,A). [factor(9,a,b)].
% 0.46/1.00 12 p(A,sk1(A)). [back_unit_del(10),unit_del(b,11)].
% 0.46/1.00 13 -p(g(sk2),A). [back_unit_del(5),unit_del(a,11)].
% 0.46/1.00 14 $F. [resolve(13,a,12,a)].
% 0.46/1.00
% 0.46/1.00 % SZS output end Refutation
% 0.46/1.00 ============================== end of proof ==========================
% 0.46/1.00
% 0.46/1.00 ============================== STATISTICS ============================
% 0.46/1.00
% 0.46/1.00 Given=4. Generated=11. Kept=9. proofs=1.
% 0.46/1.00 Usable=1. Sos=0. Demods=0. Limbo=2, Disabled=12. Hints=0.
% 0.46/1.00 Megabytes=0.02.
% 0.46/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.00
% 0.46/1.00 ============================== end of statistics =====================
% 0.46/1.00
% 0.46/1.00 ============================== end of search =========================
% 0.46/1.00
% 0.46/1.00 THEOREM PROVED
% 0.46/1.00 % SZS status Unsatisfiable
% 0.46/1.00
% 0.46/1.00 Exiting with 1 proof.
% 0.46/1.00
% 0.46/1.00 Process 14116 exit (max_proofs) Tue Jul 12 04:31:00 2022
% 0.46/1.00 Prover9 interrupted
%------------------------------------------------------------------------------