TSTP Solution File: SYN009-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN009-2 : 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:15:22 EDT 2022
% Result : Unsatisfiable 0.46s 1.03s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN009-2 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 23:03:27 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.46/1.03 ============================== Prover9 ===============================
% 0.46/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.03 Process 9678 was started by sandbox2 on n012.cluster.edu,
% 0.46/1.03 Mon Jul 11 23:03:28 2022
% 0.46/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9525_n012.cluster.edu".
% 0.46/1.03 ============================== end of head ===========================
% 0.46/1.03
% 0.46/1.03 ============================== INPUT =================================
% 0.46/1.03
% 0.46/1.03 % Reading from file /tmp/Prover9_9525_n012.cluster.edu
% 0.46/1.03
% 0.46/1.03 set(prolog_style_variables).
% 0.46/1.03 set(auto2).
% 0.46/1.03 % set(auto2) -> set(auto).
% 0.46/1.03 % set(auto) -> set(auto_inference).
% 0.46/1.03 % set(auto) -> set(auto_setup).
% 0.46/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.03 % set(auto) -> set(auto_limits).
% 0.46/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.03 % set(auto) -> set(auto_denials).
% 0.46/1.03 % set(auto) -> set(auto_process).
% 0.46/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.03 % set(auto2) -> assign(stats, some).
% 0.46/1.03 % set(auto2) -> clear(echo_input).
% 0.46/1.03 % set(auto2) -> set(quiet).
% 0.46/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.03 % set(auto2) -> clear(print_given).
% 0.46/1.03 assign(lrs_ticks,-1).
% 0.46/1.03 assign(sos_limit,10000).
% 0.46/1.03 assign(order,kbo).
% 0.46/1.03 set(lex_order_vars).
% 0.46/1.03 clear(print_given).
% 0.46/1.03
% 0.46/1.03 % formulas(sos). % not echoed (8 formulas)
% 0.46/1.03
% 0.46/1.03 ============================== end of input ==========================
% 0.46/1.03
% 0.46/1.03 % From the command line: assign(max_seconds, 300).
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.03
% 0.46/1.03 % Formulas that are not ordinary clauses:
% 0.46/1.03
% 0.46/1.03 ============================== end of process non-clausal formulas ===
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.03
% 0.46/1.03 ============================== PREDICATE ELIMINATION =================
% 0.46/1.03 1 -p(A,B,C) | -t(A,B,C) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.46/1.03 2 t(c,c,c) # label(clause_7) # label(negated_conjecture). [assumption].
% 0.46/1.03 Derived: -p(c,c,c). [resolve(1,b,2,a)].
% 0.46/1.03 3 -q(A,B,C) | -t(B,C,A) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.46/1.03 Derived: -q(c,c,c). [resolve(3,b,2,a)].
% 0.46/1.03 4 -r(A,B,C) | -t(C,A,B) # label(clause_3) # label(negated_conjecture). [assumption].
% 0.46/1.03 Derived: -r(c,c,c). [resolve(4,b,2,a)].
% 0.46/1.03 5 -p(c,c,c). [resolve(1,b,2,a)].
% 0.46/1.03 6 -s(A) | -s(B) | -s(C) | p(A,B,C) | q(B,C,A) | r(C,A,B) # label(clause_8) # label(negated_conjecture). [assumption].
% 0.46/1.03 Derived: -s(c) | -s(c) | -s(c) | q(c,c,c) | r(c,c,c). [resolve(5,a,6,d)].
% 0.46/1.03 7 -s(c) | -s(c) | -s(c) | q(c,c,c) | r(c,c,c). [resolve(5,a,6,d)].
% 0.46/1.03 8 -q(c,c,c). [resolve(3,b,2,a)].
% 0.46/1.03 Derived: -s(c) | -s(c) | -s(c) | r(c,c,c). [resolve(7,d,8,a)].
% 0.46/1.03 9 -s(c) | -s(c) | -s(c) | r(c,c,c). [resolve(7,d,8,a)].
% 0.46/1.03 10 -r(c,c,c). [resolve(4,b,2,a)].
% 0.46/1.03 Derived: -s(c) | -s(c) | -s(c). [resolve(9,d,10,a)].
% 0.46/1.03
% 0.46/1.03 ============================== end predicate elimination =============
% 0.46/1.03
% 0.46/1.03 Auto_denials: (no changes).
% 0.46/1.03
% 0.46/1.03 Term ordering decisions:
% 0.46/1.03 Function symbol KB weights: a=1. b=1. c=1.
% 0.46/1.03
% 0.46/1.03 ============================== PROOF =================================
% 0.46/1.03 % SZS status Unsatisfiable
% 0.46/1.03 % SZS output start Refutation
% 0.46/1.03
% 0.46/1.03 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/1.03 % Length of proof is 13.
% 0.46/1.03 % Level of proof is 5.
% 0.46/1.03 % Maximum clause weight is 2.000.
% 0.46/1.03 % Given clauses 0.
% 0.46/1.03
% 0.46/1.03 1 -p(A,B,C) | -t(A,B,C) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.46/1.03 2 t(c,c,c) # label(clause_7) # label(negated_conjecture). [assumption].
% 0.46/1.03 3 -q(A,B,C) | -t(B,C,A) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.46/1.03 4 -r(A,B,C) | -t(C,A,B) # label(clause_3) # label(negated_conjecture). [assumption].
% 0.46/1.03 5 -p(c,c,c). [resolve(1,b,2,a)].
% 0.46/1.03 6 -s(A) | -s(B) | -s(C) | p(A,B,C) | q(B,C,A) | r(C,A,B) # label(clause_8) # label(negated_conjecture). [assumption].
% 0.46/1.03 7 -s(c) | -s(c) | -s(c) | q(c,c,c) | r(c,c,c). [resolve(5,a,6,d)].
% 0.46/1.03 8 -q(c,c,c). [resolve(3,b,2,a)].
% 0.46/1.03 9 -s(c) | -s(c) | -s(c) | r(c,c,c). [resolve(7,d,8,a)].
% 0.46/1.03 10 -r(c,c,c). [resolve(4,b,2,a)].
% 0.46/1.03 13 s(c) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.46/1.03 14 -s(c) | -s(c) | -s(c). [resolve(9,d,10,a)].
% 0.46/1.03 15 $F. [copy(14),merge(b),merge(c),unit_del(a,13)].
% 0.46/1.03
% 0.46/1.03 % SZS output end Refutation
% 0.46/1.03 ============================== end of proof ==========================
% 0.46/1.03
% 0.46/1.03 ============================== STATISTICS ============================
% 0.46/1.03
% 0.46/1.03 Given=0. Generated=4. Kept=3. proofs=1.
% 0.46/1.03 Usable=0. Sos=0. Demods=0. Limbo=3, Disabled=14. Hints=0.
% 0.46/1.03 Megabytes=0.02.
% 0.46/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.03
% 0.46/1.03 ============================== end of statistics =====================
% 0.46/1.03
% 0.46/1.03 ============================== end of search =========================
% 0.46/1.03
% 0.46/1.03 THEOREM PROVED
% 0.46/1.03 % SZS status Unsatisfiable
% 0.46/1.03
% 0.46/1.03 Exiting with 1 proof.
% 0.46/1.03
% 0.46/1.03 Process 9678 exit (max_proofs) Mon Jul 11 23:03:28 2022
% 0.46/1.03 Prover9 interrupted
%------------------------------------------------------------------------------