TSTP Solution File: SYN553-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN553-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:21:02 EDT 2022
% Result : Unsatisfiable 0.45s 0.99s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN553-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 14:02:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.45/0.98
% 0.45/0.98 WARNING: denials share constants (see output).
% 0.45/0.98
% 0.45/0.99 ============================== Prover9 ===============================
% 0.45/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99 Process 20661 was started by sandbox on n018.cluster.edu,
% 0.45/0.99 Mon Jul 11 14:02:29 2022
% 0.45/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20322_n018.cluster.edu".
% 0.45/0.99 ============================== end of head ===========================
% 0.45/0.99
% 0.45/0.99 ============================== INPUT =================================
% 0.45/0.99
% 0.45/0.99 % Reading from file /tmp/Prover9_20322_n018.cluster.edu
% 0.45/0.99
% 0.45/0.99 set(prolog_style_variables).
% 0.45/0.99 set(auto2).
% 0.45/0.99 % set(auto2) -> set(auto).
% 0.45/0.99 % set(auto) -> set(auto_inference).
% 0.45/0.99 % set(auto) -> set(auto_setup).
% 0.45/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99 % set(auto) -> set(auto_limits).
% 0.45/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99 % set(auto) -> set(auto_denials).
% 0.45/0.99 % set(auto) -> set(auto_process).
% 0.45/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99 % set(auto2) -> assign(stats, some).
% 0.45/0.99 % set(auto2) -> clear(echo_input).
% 0.45/0.99 % set(auto2) -> set(quiet).
% 0.45/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99 % set(auto2) -> clear(print_given).
% 0.45/0.99 assign(lrs_ticks,-1).
% 0.45/0.99 assign(sos_limit,10000).
% 0.45/0.99 assign(order,kbo).
% 0.45/0.99 set(lex_order_vars).
% 0.45/0.99 clear(print_given).
% 0.45/0.99
% 0.45/0.99 % formulas(sos). % not echoed (9 formulas)
% 0.45/0.99
% 0.45/0.99 ============================== end of input ==========================
% 0.45/0.99
% 0.45/0.99 % From the command line: assign(max_seconds, 300).
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99
% 0.45/0.99 % Formulas that are not ordinary clauses:
% 0.45/0.99
% 0.45/0.99 ============================== end of process non-clausal formulas ===
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99
% 0.45/0.99 ============================== PREDICATE ELIMINATION =================
% 0.45/0.99
% 0.45/0.99 ============================== end predicate elimination =============
% 0.45/0.99
% 0.45/0.99 Auto_denials:
% 0.45/0.99 % copying label not_p2_3 to answer in negative clause
% 0.45/0.99 % copying label not_p2_4 to answer in negative clause
% 0.45/0.99 % copying label not_p2_9 to answer in negative clause
% 0.45/0.99 % assign(max_proofs, 3). % (Horn set with more than one neg. clause)
% 0.45/0.99
% 0.45/0.99 WARNING, because some of the denials share constants,
% 0.45/0.99 some of the denials or their descendents may be subsumed,
% 0.45/0.99 preventing the target number of proofs from being found.
% 0.45/0.99 The shared constants are: c3, c4, c7.
% 0.45/0.99
% 0.45/0.99 Term ordering decisions:
% 0.45/0.99 Function symbol KB weights: c3=1. c4=1. c7=1. f8=1. f5=1. f6=1. f9=1.
% 0.45/0.99
% 0.45/0.99 ============================== end of process initial clauses ========
% 0.45/0.99
% 0.45/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.99
% 0.45/0.99 ============================== end of clauses for search =============
% 0.45/0.99
% 0.45/0.99 ============================== SEARCH ================================
% 0.45/0.99
% 0.45/0.99 % Starting search at 0.01 seconds.
% 0.45/0.99
% 0.45/0.99 ============================== PROOF =================================
% 0.45/0.99 % SZS status Unsatisfiable
% 0.45/0.99 % SZS output start Refutation
% 0.45/0.99
% 0.45/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: not_p2_9.
% 0.45/0.99 % Length of proof is 11.
% 0.45/0.99 % Level of proof is 3.
% 0.45/0.99 % Maximum clause weight is 15.000.
% 0.45/0.99 % Given clauses 28.
% 0.45/0.99
% 0.45/0.99 1 p2(A,A) # label(p2_1) # label(negated_conjecture). [assumption].
% 0.45/0.99 3 p2(f8(A,B),f8(B,A)) # label(p2_5) # label(negated_conjecture). [assumption].
% 0.45/0.99 4 p2(f8(A,f8(B,C)),f8(f8(A,B),C)) # label(p2_7) # label(negated_conjecture). [assumption].
% 0.45/0.99 7 -p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))) # label(not_p2_9) # label(negated_conjecture) # answer(not_p2_9). [assumption].
% 0.45/0.99 8 p2(A,B) | -p2(A,C) | -p2(C,B) # label(p2_6) # label(negated_conjecture). [assumption].
% 0.45/0.99 9 p2(f8(A,B),f8(C,D)) | -p2(A,C) | -p2(B,DCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------