TSTP Solution File: LCL646+1.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL646+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Sun Jul 17 13:48:12 EDT 2022
% Result : Theorem 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL646+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n021.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 : Sun Jul 3 17:52:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 312 was started by sandbox on n021.cluster.edu,
% 0.44/0.99 Sun Jul 3 17:52:01 2022
% 0.44/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32627_n021.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_32627_n021.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (1 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 --(exists X -(-(all Y (-r1(X,Y) | p6(Y))) | -(all Y (-r1(X,Y) | p2(Y))) | -(all Y (-r1(X,Y) | p4(Y))) | -(all Y (-r1(X,Y) | p2(Y))) | (all Y (-r1(X,Y) | p5(Y))) | (all Y (-r1(X,Y) | p3(Y))) | (all Y (-r1(X,Y) | p2(Y))) | (all Y (-r1(X,Y) | p1(Y))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 2 -r1(c1,A) | p6(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 3 r1(c1,c2) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 4 r1(c1,c3) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 5 r1(c1,c4) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 6 r1(c1,c5) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: p6(c2). [resolve(2,a,3,a)].
% 0.44/0.99 Derived: p6(c3). [resolve(2,a,4,a)].
% 0.44/0.99 Derived: p6(c4). [resolve(2,a,5,a)].
% 0.44/0.99 Derived: p6(c5). [resolve(2,a,6,a)].
% 0.44/0.99 7 -r1(c1,A) | p2(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: p2(c2). [resolve(7,a,3,a)].
% 0.44/0.99 Derived: p2(c3). [resolve(7,a,4,a)].
% 0.44/0.99 Derived: p2(c4). [resolve(7,a,5,a)].
% 0.44/0.99 Derived: p2(c5). [resolve(7,a,6,a)].
% 0.44/0.99 8 -r1(c1,A) | p4(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: p4(c2). [resolve(8,a,3,a)].
% 0.44/0.99 Derived: p4(c3). [resolve(8,a,4,a)].
% 0.44/0.99 Derived: p4(c4). [resolve(8,a,5,a)].
% 0.44/0.99 Derived: p4(c5). [resolve(8,a,6,a)].
% 0.44/0.99 9 -r1(c1,A) | p2(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 10 p2(c2). [resolve(7,a,3,a)].
% 0.44/0.99 11 -p2(c4) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 12 p2(c3). [resolve(7,a,4,a)].
% 0.44/0.99 13 p2(c4). [resolve(7,a,5,a)].
% 0.44/0.99 Derived: $F. [resolve(13,a,11,a)].
% 0.44/0.99 14 p2(c5). [resolve(7,a,6,a)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99 Function symbol KB weights:
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.99 % Length of proof is 6.
% 0.44/0.99 % Level of proof is 3.
% 0.44/0.99 % Maximum clause weight is 0.000.
% 0.44/0.99 % Given clauses 0.
% 0.44/0.99
% 0.44/0.99 1 --(exists X -(-(all Y (-r1(X,Y) | p6(Y))) | -(all Y (-r1(X,Y) | p2(Y))) | -(all Y (-r1(X,Y) | p4(Y))) | -(all Y (-r1(X,Y) | p2(Y))) | (all Y (-r1(X,Y) | p5(Y))) | (all Y (-r1(X,Y) | p3(Y))) | (all Y (-r1(X,Y) | p2(Y))) | (all Y (-r1(X,Y) | p1(Y))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99 5 r1(c1,c4) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 7 -r1(c1,A) | p2(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 11 -p2(c4) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 13 p2(c4). [resolve(7,a,5,a)].
% 0.44/0.99 15 $F. [resolve(13,a,11,a)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=0. Generated=1. Kept=0. proofs=1.
% 0.44/0.99 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=25. Hints=0.
% 0.44/0.99 Megabytes=0.04.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 312 exit (max_proofs) Sun Jul 3 17:52:01 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------