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