TSTP Solution File: LCL133-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL133-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:44:17 EDT 2022
% Result : Unsatisfiable 0.41s 1.04s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL133-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 4 11:40:27 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.41/1.04 ============================== Prover9 ===============================
% 0.41/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.04 Process 13372 was started by sandbox on n023.cluster.edu,
% 0.41/1.04 Mon Jul 4 11:40:28 2022
% 0.41/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13219_n023.cluster.edu".
% 0.41/1.04 ============================== end of head ===========================
% 0.41/1.04
% 0.41/1.04 ============================== INPUT =================================
% 0.41/1.04
% 0.41/1.04 % Reading from file /tmp/Prover9_13219_n023.cluster.edu
% 0.41/1.04
% 0.41/1.04 set(prolog_style_variables).
% 0.41/1.04 set(auto2).
% 0.41/1.04 % set(auto2) -> set(auto).
% 0.41/1.04 % set(auto) -> set(auto_inference).
% 0.41/1.04 % set(auto) -> set(auto_setup).
% 0.41/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.04 % set(auto) -> set(auto_limits).
% 0.41/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.04 % set(auto) -> set(auto_denials).
% 0.41/1.04 % set(auto) -> set(auto_process).
% 0.41/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.04 % set(auto2) -> assign(stats, some).
% 0.41/1.04 % set(auto2) -> clear(echo_input).
% 0.41/1.04 % set(auto2) -> set(quiet).
% 0.41/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.04 % set(auto2) -> clear(print_given).
% 0.41/1.04 assign(lrs_ticks,-1).
% 0.41/1.04 assign(sos_limit,10000).
% 0.41/1.04 assign(order,kbo).
% 0.41/1.04 set(lex_order_vars).
% 0.41/1.04 clear(print_given).
% 0.41/1.04
% 0.41/1.04 % formulas(sos). % not echoed (6 formulas)
% 0.41/1.04
% 0.41/1.04 ============================== end of input ==========================
% 0.41/1.04
% 0.41/1.04 % From the command line: assign(max_seconds, 300).
% 0.41/1.04
% 0.41/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.04
% 0.41/1.04 % Formulas that are not ordinary clauses:
% 0.41/1.04
% 0.41/1.04 ============================== end of process non-clausal formulas ===
% 0.41/1.04
% 0.41/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.04
% 0.41/1.04 ============================== PREDICATE ELIMINATION =================
% 0.41/1.04
% 0.41/1.04 ============================== end predicate elimination =============
% 0.41/1.04
% 0.41/1.04 Auto_denials:
% 0.41/1.04 % copying label prove_wajsberg_lemma to answer in negative clause
% 0.41/1.04
% 0.41/1.04 Term ordering decisions:
% 0.41/1.04
% 0.41/1.04 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 0.41/1.04 Function symbol KB weights: truth=1. x=1. y=1. implies=1. not=0.
% 0.41/1.04
% 0.41/1.04 ============================== end of process initial clauses ========
% 0.41/1.04
% 0.41/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.04
% 0.41/1.04 ============================== end of clauses for search =============
% 0.41/1.04
% 0.41/1.04 ============================== SEARCH ================================
% 0.41/1.04
% 0.41/1.04 % Starting search at 0.01 seconds.
% 0.41/1.04
% 0.41/1.04 ============================== PROOF =================================
% 0.41/1.04 % SZS status Unsatisfiable
% 0.41/1.04 % SZS output start Refutation
% 0.41/1.04
% 0.41/1.04 % Proof 1 at 0.01 (+ 0.00) seconds: prove_wajsberg_lemma.
% 0.41/1.04 % Length of proof is 13.
% 0.41/1.04 % Level of proof is 6.
% 0.41/1.04 % Maximum clause weight is 13.000.
% 0.41/1.04 % Given clauses 8.
% 0.41/1.04
% 0.41/1.04 1 implies(truth,A) = A # label(wajsberg_1) # label(axiom). [assumption].
% 0.41/1.04 2 implies(A,B) = implies(B,A) # label(lemma_antecedent) # label(negated_conjecture). [assumption].
% 0.41/1.04 3 implies(implies(A,B),B) = implies(implies(B,A),A) # label(wajsberg_3) # label(axiom). [assumption].
% 0.41/1.04 4 implies(A,implies(B,A)) = implies(B,implies(B,A)). [copy(3),rewrite([2(2),2(3),2(4)]),rewrite([2(1),2(3)]),flip(a)].
% 0.41/1.04 7 implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth # label(wajsberg_2) # label(axiom). [assumption].
% 0.41/1.04 8 x != y # label(prove_wajsberg_lemma) # label(negated_conjecture) # answer(prove_wajsberg_lemma). [assumption].
% 0.41/1.04 9 y != x # answer(prove_wajsberg_lemma). [copy(8),flip(a)].
% 0.41/1.04 10 implies(A,truth) = A. [back_rewrite(1),rewrite([2(2)])].
% 0.41/1.04 29 implies(A,A) = A. [para(10(a,1),4(a,1,2)),rewrite([2(2),10(2),10(2)]),flip(a)].
% 0.41/1.04 32 implies(A,B) = truth. [para(10(a,1),7(a,1,2,1)),rewrite([10(3),2(2),29(3)])].
% 0.41/1.04 33 truth = A. [back_rewrite(29),rewrite([32(1)])].
% 0.41/1.04 34 x != truth # answer(prove_wajsberg_lemma). [para(33(a,2),9(a,1)),flip(a)].
% 0.41/1.04 35 $F # answer(prove_wajsberg_lemma). [resolve(34,a,33,a(flip))].
% 0.41/1.04
% 0.41/1.04 % SZS output end Refutation
% 0.41/1.04 ============================== end of proof ==========================
% 0.41/1.04
% 0.41/1.04 ============================== STATISTICS ============================
% 0.41/1.04
% 0.41/1.04 Given=8. Generated=91. Kept=31. proofs=1.
% 0.41/1.04 Usable=3. Sos=0. Demods=1. Limbo=0, Disabled=33. Hints=0.
% 0.41/1.04 Megabytes=0.05.
% 0.41/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/1.04
% 0.41/1.04 ============================== end of statistics =====================
% 0.41/1.04
% 0.41/1.04 ============================== end of search =========================
% 0.41/1.04
% 0.41/1.04 THEOREM PROVED
% 0.41/1.04 % SZS status Unsatisfiable
% 0.41/1.04
% 0.41/1.04 Exiting with 1 proof.
% 0.41/1.04
% 0.41/1.04 Process 13372 exit (max_proofs) Mon Jul 4 11:40:28 2022
% 0.41/1.04 Prover9 interrupted
%------------------------------------------------------------------------------