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