TSTP Solution File: LCL209-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL209-3 : TPTP v8.1.0. Released v2.3.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:44:57 EDT 2022
% Result : Unsatisfiable 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL209-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 12:45:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 17013 was started by sandbox2 on n021.cluster.edu,
% 0.43/0.99 Sun Jul 3 12:45:46 2022
% 0.43/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16860_n021.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_16860_n021.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (9 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 0.43/0.99 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 0.43/0.99 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 0.43/0.99 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 0.43/0.99 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 0.43/0.99 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 0.43/0.99 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 0.43/0.99 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 0.43/0.99 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 0.43/0.99 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 0.43/0.99 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials:
% 0.43/0.99 % copying label prove_this to answer in negative clause
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99
% 0.43/0.99 % Assigning unary symbol not kb_weight 0 and highest precedence (7).
% 0.43/0.99 Function symbol KB weights: p=1. q=1. or=1. implies=1. not=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: prove_this.
% 0.43/0.99 % Length of proof is 24.
% 0.43/0.99 % Level of proof is 7.
% 0.43/0.99 % Maximum clause weight is 17.000.
% 0.43/0.99 % Given clauses 23.
% 0.43/0.99
% 0.43/0.99 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 0.43/0.99 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 0.43/0.99 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 0.43/0.99 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 0.43/0.99 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 0.43/0.99 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 0.43/0.99 8 -theorem(implies(implies(not(p),q),or(p,q))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 0.43/0.99 9 -theorem(or(not(or(not(not(p)),q)),or(p,q))) # answer(prove_this). [copy(8),rewrite([7(4),7(9)])].
% 0.43/0.99 10 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 0.43/0.99 11 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(10),rewrite([7(2)])].
% 0.43/0.99 14 theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 0.43/0.99 15 theorem(or(not(A),or(B,A))). [copy(14),rewrite([7(2)])].
% 0.43/0.99 16 theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 0.43/0.99 17 theorem(or(not(or(A,B)),or(B,A))). [copy(16),rewrite([7(3)])].
% 0.43/0.99 18 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 0.43/0.99 19 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(18),rewrite([7(5)])].
% 0.43/0.99 20 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 0.43/0.99 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)])].
% 0.43/0.99 38 theorem(or(A,or(not(B),B))). [hyper(11,b,19,a,c,15,a)].
% 0.43/0.99 43 theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))). [hyper(11,b,19,a,c,21,a)].
% 0.43/0.99 108 theorem(or(not(A),A)). [hyper(11,b,38,a,c,38,a)].
% 0.43/0.99 121 theorem(or(A,not(A))). [hyper(11,b,17,a,c,108,a)].
% 0.43/0.99 204 -theorem(or(not(or(A,not(A))),or(not(or(not(not(p)),q)),or(p,q)))) # answer(prove_this). [ur(11,a,9,a,c,121,a)].
% 0.43/0.99 205 $F # answer(prove_this). [resolve(204,a,43,a)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=23. Generated=249. Kept=191. proofs=1.
% 0.43/0.99 Usable=23. Sos=143. Demods=1. Limbo=23, Disabled=15. Hints=0.
% 0.43/0.99 Megabytes=0.21.
% 0.43/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 17013 exit (max_proofs) Sun Jul 3 12:45:46 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------