TSTP Solution File: SYN960+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN960+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:23:51 EDT 2022
% Result : Theorem 0.76s 1.04s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN960+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 01:17:47 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.76/1.04 ============================== Prover9 ===============================
% 0.76/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.04 Process 1569 was started by sandbox2 on n013.cluster.edu,
% 0.76/1.04 Tue Jul 12 01:17:48 2022
% 0.76/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1414_n013.cluster.edu".
% 0.76/1.04 ============================== end of head ===========================
% 0.76/1.04
% 0.76/1.04 ============================== INPUT =================================
% 0.76/1.04
% 0.76/1.04 % Reading from file /tmp/Prover9_1414_n013.cluster.edu
% 0.76/1.04
% 0.76/1.04 set(prolog_style_variables).
% 0.76/1.04 set(auto2).
% 0.76/1.04 % set(auto2) -> set(auto).
% 0.76/1.04 % set(auto) -> set(auto_inference).
% 0.76/1.04 % set(auto) -> set(auto_setup).
% 0.76/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.04 % set(auto) -> set(auto_limits).
% 0.76/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.04 % set(auto) -> set(auto_denials).
% 0.76/1.04 % set(auto) -> set(auto_process).
% 0.76/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.04 % set(auto2) -> assign(stats, some).
% 0.76/1.04 % set(auto2) -> clear(echo_input).
% 0.76/1.04 % set(auto2) -> set(quiet).
% 0.76/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.04 % set(auto2) -> clear(print_given).
% 0.76/1.04 assign(lrs_ticks,-1).
% 0.76/1.04 assign(sos_limit,10000).
% 0.76/1.04 assign(order,kbo).
% 0.76/1.04 set(lex_order_vars).
% 0.76/1.04 clear(print_given).
% 0.76/1.04
% 0.76/1.04 % formulas(sos). % not echoed (1 formulas)
% 0.76/1.04
% 0.76/1.04 ============================== end of input ==========================
% 0.76/1.04
% 0.76/1.04 % From the command line: assign(max_seconds, 300).
% 0.76/1.04
% 0.76/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.04
% 0.76/1.04 % Formulas that are not ordinary clauses:
% 0.76/1.04 1 -((exists X exists Y a(X,Y)) <-> (exists Y exists X a(X,Y))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.04
% 0.76/1.04 ============================== end of process non-clausal formulas ===
% 0.76/1.04
% 0.76/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.04
% 0.76/1.04 ============================== PREDICATE ELIMINATION =================
% 0.76/1.04
% 0.76/1.04 ============================== end predicate elimination =============
% 0.76/1.04
% 0.76/1.04 Auto_denials: (non-Horn, no changes).
% 0.76/1.04
% 0.76/1.04 Term ordering decisions:
% 0.76/1.04 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1.
% 0.76/1.04
% 0.76/1.04 ============================== PROOF =================================
% 0.76/1.04 % SZS status Theorem
% 0.76/1.04 % SZS output start Refutation
% 0.76/1.04
% 0.76/1.04 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.76/1.04 % Length of proof is 5.
% 0.76/1.04 % Level of proof is 3.
% 0.76/1.04 % Maximum clause weight is 6.000.
% 0.76/1.04 % Given clauses 0.
% 0.76/1.04
% 0.76/1.04 1 -((exists X exists Y a(X,Y)) <-> (exists Y exists X a(X,Y))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.04 2 a(c1,c2) | a(c4,c3) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.76/1.04 3 -a(A,B) | -a(C,D) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.76/1.04 4 -a(A,B). [factor(3,a,b)].
% 0.76/1.04 5 $F. [back_unit_del(2),unit_del(a,4),unit_del(b,4)].
% 0.76/1.04
% 0.76/1.04 % SZS output end Refutation
% 0.76/1.04 ============================== end of proof ==========================
% 0.76/1.04
% 0.76/1.04 ============================== STATISTICS ============================
% 0.76/1.04
% 0.76/1.04 Given=0. Generated=4. Kept=3. proofs=1.
% 0.76/1.04 Usable=0. Sos=0. Demods=0. Limbo=1, Disabled=4. Hints=0.
% 0.76/1.04 Megabytes=0.02.
% 0.76/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.04
% 0.76/1.04 ============================== end of statistics =====================
% 0.76/1.04
% 0.76/1.04 ============================== end of search =========================
% 0.76/1.04
% 0.76/1.04 THEOREM PROVED
% 0.76/1.04 % SZS status Theorem
% 0.76/1.04
% 0.76/1.04 Exiting with 1 proof.
% 0.76/1.04
% 0.76/1.04 Process 1569 exit (max_proofs) Tue Jul 12 01:17:48 2022
% 0.76/1.04 Prover9 interrupted
%------------------------------------------------------------------------------