TSTP Solution File: SYN393+1.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN393+1.003 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:18:52 EDT 2022
% Result : Theorem 0.44s 0.97s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN393+1.003 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 21:45:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/0.97 ============================== Prover9 ===============================
% 0.44/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.97 Process 9141 was started by sandbox2 on n029.cluster.edu,
% 0.44/0.97 Mon Jul 11 21:45:18 2022
% 0.44/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8988_n029.cluster.edu".
% 0.44/0.97 ============================== end of head ===========================
% 0.44/0.97
% 0.44/0.97 ============================== INPUT =================================
% 0.44/0.97
% 0.44/0.97 % Reading from file /tmp/Prover9_8988_n029.cluster.edu
% 0.44/0.97
% 0.44/0.97 set(prolog_style_variables).
% 0.44/0.97 set(auto2).
% 0.44/0.97 % set(auto2) -> set(auto).
% 0.44/0.97 % set(auto) -> set(auto_inference).
% 0.44/0.97 % set(auto) -> set(auto_setup).
% 0.44/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.97 % set(auto) -> set(auto_limits).
% 0.44/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.97 % set(auto) -> set(auto_denials).
% 0.44/0.97 % set(auto) -> set(auto_process).
% 0.44/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.97 % set(auto2) -> assign(stats, some).
% 0.44/0.97 % set(auto2) -> clear(echo_input).
% 0.44/0.97 % set(auto2) -> set(quiet).
% 0.44/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.97 % set(auto2) -> clear(print_given).
% 0.44/0.97 assign(lrs_ticks,-1).
% 0.44/0.97 assign(sos_limit,10000).
% 0.44/0.97 assign(order,kbo).
% 0.44/0.97 set(lex_order_vars).
% 0.44/0.97 clear(print_given).
% 0.44/0.97
% 0.44/0.97 % formulas(sos). % not echoed (1 formulas)
% 0.44/0.97
% 0.44/0.97 ============================== end of input ==========================
% 0.44/0.97
% 0.44/0.97 % From the command line: assign(max_seconds, 300).
% 0.44/0.97
% 0.44/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.97
% 0.44/0.97 % Formulas that are not ordinary clauses:
% 0.44/0.97 1 -(((p1 <-> p2) <-> p3) <-> (p1 <-> (p2 <-> p3))) # label(pel12) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.97
% 0.44/0.97 ============================== end of process non-clausal formulas ===
% 0.44/0.97
% 0.44/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.97
% 0.44/0.97 ============================== PREDICATE ELIMINATION =================
% 0.44/0.97
% 0.44/0.97 ============================== end predicate elimination =============
% 0.44/0.97
% 0.44/0.97 Auto_denials: (non-Horn, no changes).
% 0.44/0.97
% 0.44/0.97 Term ordering decisions:
% 0.44/0.97 Function symbol KB weights:
% 0.44/0.97
% 0.44/0.97 ============================== end of process initial clauses ========
% 0.44/0.97
% 0.44/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.97
% 0.44/0.97 ============================== end of clauses for search =============
% 0.44/0.97
% 0.44/0.97 ============================== SEARCH ================================
% 0.44/0.97
% 0.44/0.97 % Starting search at 0.01 seconds.
% 0.44/0.97
% 0.44/0.97 ============================== PROOF =================================
% 0.44/0.97 % SZS status Theorem
% 0.44/0.97 % SZS output start Refutation
% 0.44/0.97
% 0.44/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.97 % Length of proof is 20.
% 0.44/0.97 % Level of proof is 9.
% 0.44/0.97 % Maximum clause weight is 3.000.
% 0.44/0.97 % Given clauses 14.
% 0.44/0.97
% 0.44/0.97 1 -(((p1 <-> p2) <-> p3) <-> (p1 <-> (p2 <-> p3))) # label(pel12) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.97 2 p1 | p2 | p3 # label(pel12) # label(negated_conjecture). [clausify(1)].
% 0.44/0.97 3 -p1 | -p2 | -p3 # label(pel12) # label(negated_conjecture). [clausify(1)].
% 0.44/0.97 4 -p1 | -p2 | p3 # label(pel12) # label(negated_conjecture). [clausify(1)].
% 0.44/0.97 5 -p1 | p2 | -p3 # label(pel12) # label(negated_conjecture). [clausify(1)].
% 0.44/0.97 6 p1 | -p2 | -p3 # label(pel12) # label(negated_conjecture). [clausify(1)].
% 0.44/0.97 7 -p1 | p2 | p3 # label(pel12) # label(negated_conjecture). [clausify(1)].
% 0.44/0.97 8 p1 | -p2 | p3 # label(pel12) # label(negated_conjecture). [clausify(1)].
% 0.44/0.97 9 p1 | p2 | -p3 # label(pel12) # label(negated_conjecture). [clausify(1)].
% 0.44/0.97 10 p1 | p2. [resolve(9,c,2,c),merge(c),merge(d)].
% 0.44/0.97 11 p1 | p3. [resolve(10,b,8,b),merge(b)].
% 0.44/0.97 12 p1 | -p2. [resolve(11,b,6,c),merge(b)].
% 0.44/0.97 13 p1. [resolve(12,b,10,b),merge(b)].
% 0.44/0.97 14 p2 | p3. [back_unit_del(7),unit_del(a,13)].
% 0.44/0.97 15 p2 | -p3. [back_unit_del(5),unit_del(a,13)].
% 0.44/0.97 16 -p2 | p3. [back_unit_del(4),unit_del(a,13)].
% 0.44/0.97 17 -p2 | -p3. [back_unit_del(3),unit_del(a,13)].
% 0.44/0.97 18 p2. [resolve(15,b,14,b),merge(b)].
% 0.44/0.97 19 -p3. [back_unit_del(17),unit_del(a,18)].
% 0.44/0.97 20 $F. [back_unit_del(16),unit_del(a,18),unit_del(b,19)].
% 0.44/0.97
% 0.44/0.97 % SZS output end Refutation
% 0.44/0.97 ============================== end of proof ==========================
% 0.44/0.97
% 0.44/0.97 ============================== STATISTICS ============================
% 0.44/0.97
% 0.44/0.97 Given=14. Generated=25. Kept=18. proofs=1.
% 0.44/0.97 Usable=1. Sos=0. Demods=0. Limbo=2, Disabled=23. Hints=0.
% 0.44/0.97 Megabytes=0.03.
% 0.44/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.97
% 0.44/0.97 ============================== end of statistics =====================
% 0.44/0.97
% 0.44/0.97 ============================== end of search =========================
% 0.44/0.97
% 0.44/0.97 THEOREM PROVED
% 0.44/0.97 % SZS status Theorem
% 0.44/0.97
% 0.44/0.97 Exiting with 1 proof.
% 0.44/0.97
% 0.44/0.97 Process 9141 exit (max_proofs) Mon Jul 11 21:45:18 2022
% 0.44/0.97 Prover9 interrupted
%------------------------------------------------------------------------------