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