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