TSTP Solution File: LCL684+1.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL684+1.001 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 13:49:20 EDT 2022
% Result : Theorem 0.45s 1.01s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL684+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 : n013.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 03:28:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 14626 was started by sandbox2 on n013.cluster.edu,
% 0.45/1.01 Sun Jul 3 03:29:00 2022
% 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14471_n013.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_14471_n013.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (3 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/1.01 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 2 (all X all Y all Z (r1(X,Y) & r1(Y,Z) -> r1(X,Z))) # label(transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 3 --(exists X -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p201(X) & p101(X)))))) | -(p201(X) & p101(X)))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.01
% 0.45/1.01 ============================== end of process non-clausal formulas ===
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.01
% 0.45/1.01 ============================== PREDICATE ELIMINATION =================
% 0.45/1.01 4 -r1(c1,A) | -r1(A,B) | -p201(B) | -p101(B) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.45/1.01 5 p201(c1) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.45/1.01 Derived: -r1(c1,A) | -r1(A,c1) | -p101(c1). [resolve(4,c,5,a)].
% 0.45/1.01 6 -r1(c1,A) | -r1(A,c1) | -p101(c1). [resolve(4,c,5,a)].
% 0.45/1.01 7 p101(c1) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.45/1.01 Derived: -r1(c1,A) | -r1(A,c1). [resolve(6,c,7,a)].
% 0.45/1.01
% 0.45/1.01 ============================== end predicate elimination =============
% 0.45/1.01
% 0.45/1.01 Auto_denials: (no changes).
% 0.45/1.01
% 0.45/1.01 Term ordering decisions:
% 0.45/1.01 Function symbol KB weights: c1=1.
% 0.45/1.01
% 0.45/1.01 ============================== end of process initial clauses ========
% 0.45/1.01
% 0.45/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.01
% 0.45/1.01 ============================== end of clauses for search =============
% 0.45/1.01
% 0.45/1.01 ============================== SEARCH ================================
% 0.45/1.01
% 0.45/1.01 % Starting search at 0.01 seconds.
% 0.45/1.01
% 0.45/1.01 ============================== PROOF =================================
% 0.45/1.01 % SZS status Theorem
% 0.45/1.01 % SZS output start Refutation
% 0.45/1.01
% 0.45/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/1.01 % Length of proof is 9.
% 0.45/1.01 % Level of proof is 4.
% 0.45/1.01 % Maximum clause weight is 6.000.
% 0.45/1.01 % Given clauses 3.
% 0.45/1.01
% 0.45/1.01 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 3 --(exists X -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(p201(X) & p101(X)))))) | -(p201(X) & p101(X)))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.01 4 -r1(c1,A) | -r1(A,B) | -p201(B) | -p101(B) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.45/1.01 5 p201(c1) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.45/1.01 6 -r1(c1,A) | -r1(A,c1) | -p101(c1). [resolve(4,c,5,a)].
% 0.45/1.01 7 p101(c1) # label(main) # label(negated_conjecture). [clausify(3)].
% 0.45/1.01 8 r1(A,A) # label(reflexivity) # label(axiom). [clausify(1)].
% 0.45/1.01 10 -r1(c1,A) | -r1(A,c1). [resolve(6,c,7,a)].
% 0.45/1.01 12 $F. [resolve(10,a,8,a),unit_del(a,8)].
% 0.45/1.01
% 0.45/1.01 % SZS output end Refutation
% 0.45/1.01 ============================== end of proof ==========================
% 0.45/1.01
% 0.45/1.01 ============================== STATISTICS ============================
% 0.45/1.01
% 0.45/1.01 Given=3. Generated=6. Kept=4. proofs=1.
% 0.45/1.01 Usable=3. Sos=0. Demods=0. Limbo=1, Disabled=7. Hints=0.
% 0.45/1.01 Megabytes=0.03.
% 0.45/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.01
% 0.45/1.01 ============================== end of statistics =====================
% 0.45/1.01
% 0.45/1.01 ============================== end of search =========================
% 0.45/1.01
% 0.45/1.01 THEOREM PROVED
% 0.45/1.01 % SZS status Theorem
% 0.45/1.01
% 0.45/1.01 Exiting with 1 proof.
% 0.45/1.01
% 0.45/1.01 Process 14626 exit (max_proofs) Sun Jul 3 03:29:00 2022
% 0.45/1.01 Prover9 interrupted
%------------------------------------------------------------------------------