TSTP Solution File: LCL230-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL230-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:45:14 EDT 2022
% Result : Unsatisfiable 1.26s 1.58s
% Output : Refutation 1.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL230-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 00:56:10 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.22/1.51 ============================== Prover9 ===============================
% 1.22/1.51 Prover9 (32) version 2009-11A, November 2009.
% 1.22/1.51 Process 22114 was started by sandbox on n025.cluster.edu,
% 1.22/1.51 Sun Jul 3 00:56:11 2022
% 1.22/1.51 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21960_n025.cluster.edu".
% 1.22/1.51 ============================== end of head ===========================
% 1.22/1.51
% 1.22/1.51 ============================== INPUT =================================
% 1.22/1.51
% 1.22/1.51 % Reading from file /tmp/Prover9_21960_n025.cluster.edu
% 1.22/1.51
% 1.22/1.51 set(prolog_style_variables).
% 1.22/1.51 set(auto2).
% 1.22/1.51 % set(auto2) -> set(auto).
% 1.22/1.51 % set(auto) -> set(auto_inference).
% 1.22/1.51 % set(auto) -> set(auto_setup).
% 1.22/1.51 % set(auto_setup) -> set(predicate_elim).
% 1.22/1.51 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.22/1.51 % set(auto) -> set(auto_limits).
% 1.22/1.51 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.22/1.51 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.22/1.51 % set(auto) -> set(auto_denials).
% 1.22/1.51 % set(auto) -> set(auto_process).
% 1.22/1.51 % set(auto2) -> assign(new_constants, 1).
% 1.22/1.51 % set(auto2) -> assign(fold_denial_max, 3).
% 1.22/1.51 % set(auto2) -> assign(max_weight, "200.000").
% 1.22/1.51 % set(auto2) -> assign(max_hours, 1).
% 1.22/1.51 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.22/1.51 % set(auto2) -> assign(max_seconds, 0).
% 1.22/1.51 % set(auto2) -> assign(max_minutes, 5).
% 1.22/1.51 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.22/1.51 % set(auto2) -> set(sort_initial_sos).
% 1.22/1.51 % set(auto2) -> assign(sos_limit, -1).
% 1.22/1.51 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.22/1.51 % set(auto2) -> assign(max_megs, 400).
% 1.22/1.51 % set(auto2) -> assign(stats, some).
% 1.22/1.51 % set(auto2) -> clear(echo_input).
% 1.22/1.51 % set(auto2) -> set(quiet).
% 1.22/1.51 % set(auto2) -> clear(print_initial_clauses).
% 1.22/1.51 % set(auto2) -> clear(print_given).
% 1.22/1.51 assign(lrs_ticks,-1).
% 1.22/1.51 assign(sos_limit,10000).
% 1.22/1.51 assign(order,kbo).
% 1.22/1.51 set(lex_order_vars).
% 1.22/1.51 clear(print_given).
% 1.22/1.51
% 1.22/1.51 % formulas(sos). % not echoed (9 formulas)
% 1.22/1.51
% 1.22/1.51 ============================== end of input ==========================
% 1.22/1.51
% 1.22/1.51 % From the command line: assign(max_seconds, 300).
% 1.22/1.51
% 1.22/1.51 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.22/1.51
% 1.22/1.51 % Formulas that are not ordinary clauses:
% 1.22/1.51
% 1.22/1.51 ============================== end of process non-clausal formulas ===
% 1.22/1.51
% 1.22/1.51 ============================== PROCESS INITIAL CLAUSES ===============
% 1.22/1.51
% 1.22/1.51 ============================== PREDICATE ELIMINATION =================
% 1.22/1.51 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.22/1.51 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.22/1.51 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.22/1.51 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.22/1.51 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.22/1.51 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.22/1.51 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.22/1.51 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.22/1.51 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.22/1.51 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.22/1.51 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.22/1.51
% 1.22/1.51 ============================== end predicate elimination =============
% 1.22/1.51
% 1.22/1.51 Auto_denials:
% 1.22/1.51 % copying label prove_this to answer in negative clause
% 1.22/1.51
% 1.22/1.51 Term ordering decisions:
% 1.22/1.51
% 1.22/1.51 % Assigning unary symbol not kb_weight 0 and highest precedence (8).
% 1.22/1.51 Function symbol KB weights: p=1. q=1. r=1. or=1. implies=1. not=0.
% 1.22/1.51
% 1.22/1.51 ============================== end of process initial clauses ========
% 1.22/1.51
% 1.22/1.51 ============================== CLAUSES FOR SEARCH ====================
% 1.22/1.51
% 1.22/1.51 ============================== end of clauses for search =============
% 1.22/1.51
% 1.22/1.51 ============================== SEARCH ================================
% 1.22/1.51
% 1.22/1.51 % Starting search at 0.01 seconds.
% 1.22/1.51
% 1.22/1.51 Low Water (keep): wt=37.000, iters=3369
% 1.22/1.51
% 1.22/1.51 Low Water (keep): wt=35.000, iters=3386
% 1.22/1.51
% 1.22/1.51 Low Water (keep): wt=27.000, iters=3352
% 1.22/1.51
% 1.22/1.51 Low Water (keep): wt=25.000, iters=3388
% 1.22/1.51
% 1.22/1.51 Low Water (keep): wt=23.000, iters=3378
% 1.22/1.51
% 1.22/1.51 Low Water (keep): wt=19.000, iters=3344
% 1.22/1.51
% 1.22/1.51 Low Water (keep): wt=18.000, iters=3369
% 1.26/1.58
% 1.26/1.58 ============================== PROOF =================================
% 1.26/1.58 % SZS status Unsatisfiable
% 1.26/1.58 % SZS output start Refutation
% 1.26/1.58
% 1.26/1.58 % Proof 1 at 0.57 (+ 0.01) seconds: prove_this.
% 1.26/1.58 % Length of proof is 20.
% 1.26/1.58 % Level of proof is 5.
% 1.26/1.58 % Maximum clause weight is 31.000.
% 1.26/1.58 % Given clauses 144.
% 1.26/1.58
% 1.26/1.58 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.26/1.58 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.26/1.58 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.26/1.58 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.26/1.58 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 1.26/1.58 8 -theorem(implies(implies(or(p,q),or(p,r)),or(p,implies(q,r)))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.26/1.58 9 -theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))) # answer(prove_this). [copy(8),rewrite([7(7),7(12),7(15)])].
% 1.26/1.58 10 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 1.26/1.58 11 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(10),rewrite([7(2)])].
% 1.26/1.58 14 theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.26/1.58 15 theorem(or(not(A),or(B,A))). [copy(14),rewrite([7(2)])].
% 1.26/1.58 18 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.26/1.58 19 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(18),rewrite([7(5)])].
% 1.26/1.58 20 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.26/1.58 21 theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))). [copy(20),rewrite([7(1),7(5),7(7)])].
% 1.26/1.58 40 -theorem(or(not(or(not(or(A,or(B,C))),or(B,or(A,C)))),or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))))) # answer(prove_this). [ur(11,a,9,a,c,19,a)].
% 1.26/1.58 43 theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))). [hyper(11,b,19,a,c,21,a)].
% 1.26/1.58 5023 theorem(or(not(or(not(or(A,B)),C)),or(not(B),C))). [hyper(11,b,43,a,c,15,a)].
% 1.26/1.58 5025 -theorem(or(not(or(not(or(p,q)),or(p,r))),or(not(q),or(p,r)))) # answer(prove_this). [ur(11,a,40,a,b,43,a)].
% 1.26/1.58 5026 $F # answer(prove_this). [resolve(5025,a,5023,a)].
% 1.26/1.58
% 1.26/1.58 % SZS output end Refutation
% 1.26/1.58 ============================== end of proof ==========================
% 1.26/1.58
% 1.26/1.58 ============================== STATISTICS ============================
% 1.26/1.58
% 1.26/1.58 Given=144. Generated=7993. Kept=5012. proofs=1.
% 1.26/1.58 Usable=144. Sos=4797. Demods=1. Limbo=59, Disabled=25. Hints=0.
% 1.26/1.58 Megabytes=4.42.
% 1.26/1.58 User_CPU=0.57, System_CPU=0.01, Wall_clock=0.
% 1.26/1.58
% 1.26/1.58 ============================== end of statistics =====================
% 1.26/1.58
% 1.26/1.58 ============================== end of search =========================
% 1.26/1.58
% 1.26/1.58 THEOREM PROVED
% 1.26/1.58 % SZS status Unsatisfiable
% 1.26/1.58
% 1.26/1.58 Exiting with 1 proof.
% 1.26/1.58
% 1.26/1.58 Process 22114 exit (max_proofs) Sun Jul 3 00:56:11 2022
% 1.26/1.58 Prover9 interrupted
%------------------------------------------------------------------------------