TSTP Solution File: LCL194-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL194-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:47 EDT 2022
% Result : Unsatisfiable 1.23s 1.49s
% Output : Refutation 1.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL194-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n008.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 : Mon Jul 4 02:42:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.21/1.46 ============================== Prover9 ===============================
% 1.21/1.46 Prover9 (32) version 2009-11A, November 2009.
% 1.21/1.46 Process 8485 was started by sandbox2 on n008.cluster.edu,
% 1.21/1.46 Mon Jul 4 02:42:38 2022
% 1.21/1.46 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8331_n008.cluster.edu".
% 1.21/1.46 ============================== end of head ===========================
% 1.21/1.46
% 1.21/1.46 ============================== INPUT =================================
% 1.21/1.46
% 1.21/1.46 % Reading from file /tmp/Prover9_8331_n008.cluster.edu
% 1.21/1.46
% 1.21/1.46 set(prolog_style_variables).
% 1.21/1.46 set(auto2).
% 1.21/1.46 % set(auto2) -> set(auto).
% 1.21/1.46 % set(auto) -> set(auto_inference).
% 1.21/1.46 % set(auto) -> set(auto_setup).
% 1.21/1.46 % set(auto_setup) -> set(predicate_elim).
% 1.21/1.46 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.21/1.46 % set(auto) -> set(auto_limits).
% 1.21/1.46 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.21/1.46 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.21/1.46 % set(auto) -> set(auto_denials).
% 1.21/1.46 % set(auto) -> set(auto_process).
% 1.21/1.46 % set(auto2) -> assign(new_constants, 1).
% 1.21/1.46 % set(auto2) -> assign(fold_denial_max, 3).
% 1.21/1.46 % set(auto2) -> assign(max_weight, "200.000").
% 1.21/1.46 % set(auto2) -> assign(max_hours, 1).
% 1.21/1.46 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.21/1.46 % set(auto2) -> assign(max_seconds, 0).
% 1.21/1.46 % set(auto2) -> assign(max_minutes, 5).
% 1.21/1.46 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.21/1.46 % set(auto2) -> set(sort_initial_sos).
% 1.21/1.46 % set(auto2) -> assign(sos_limit, -1).
% 1.21/1.46 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.21/1.46 % set(auto2) -> assign(max_megs, 400).
% 1.21/1.46 % set(auto2) -> assign(stats, some).
% 1.21/1.46 % set(auto2) -> clear(echo_input).
% 1.21/1.46 % set(auto2) -> set(quiet).
% 1.21/1.46 % set(auto2) -> clear(print_initial_clauses).
% 1.21/1.46 % set(auto2) -> clear(print_given).
% 1.21/1.46 assign(lrs_ticks,-1).
% 1.21/1.46 assign(sos_limit,10000).
% 1.21/1.46 assign(order,kbo).
% 1.21/1.46 set(lex_order_vars).
% 1.21/1.46 clear(print_given).
% 1.21/1.46
% 1.21/1.46 % formulas(sos). % not echoed (9 formulas)
% 1.21/1.46
% 1.21/1.46 ============================== end of input ==========================
% 1.21/1.46
% 1.21/1.46 % From the command line: assign(max_seconds, 300).
% 1.21/1.46
% 1.21/1.46 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.21/1.46
% 1.21/1.46 % Formulas that are not ordinary clauses:
% 1.21/1.46
% 1.21/1.46 ============================== end of process non-clausal formulas ===
% 1.21/1.46
% 1.21/1.46 ============================== PROCESS INITIAL CLAUSES ===============
% 1.21/1.46
% 1.21/1.46 ============================== PREDICATE ELIMINATION =================
% 1.21/1.46 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.21/1.46 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.21/1.46 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.21/1.46 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.21/1.46 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.21/1.46 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.21/1.46 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.21/1.46 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.21/1.46 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.21/1.46 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.21/1.46 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.21/1.46
% 1.21/1.46 ============================== end predicate elimination =============
% 1.21/1.46
% 1.21/1.46 Auto_denials:
% 1.21/1.46 % copying label prove_this to answer in negative clause
% 1.21/1.46
% 1.21/1.46 Term ordering decisions:
% 1.21/1.46
% 1.21/1.46 % Assigning unary symbol not kb_weight 0 and highest precedence (8).
% 1.21/1.46 Function symbol KB weights: p=1. q=1. r=1. or=1. implies=1. not=0.
% 1.21/1.46
% 1.21/1.46 ============================== end of process initial clauses ========
% 1.21/1.46
% 1.21/1.46 ============================== CLAUSES FOR SEARCH ====================
% 1.21/1.46
% 1.21/1.46 ============================== end of clauses for search =============
% 1.21/1.46
% 1.21/1.46 ============================== SEARCH ================================
% 1.21/1.46
% 1.21/1.46 % Starting search at 0.01 seconds.
% 1.21/1.46
% 1.21/1.46 Low Water (keep): wt=35.000, iters=3368
% 1.21/1.46
% 1.21/1.46 Low Water (keep): wt=33.000, iters=3385
% 1.21/1.46
% 1.21/1.46 Low Water (keep): wt=25.000, iters=3351
% 1.21/1.46
% 1.21/1.46 Low Water (keep): wt=24.000, iters=3375
% 1.21/1.46
% 1.21/1.46 Low Water (keep): wt=22.000, iters=3335
% 1.21/1.46
% 1.21/1.46 Low Water (keep): wt=20.000, iters=3370
% 1.21/1.46
% 1.21/1.46 Low Water (keep): wt=19.000, iters=3369
% 1.23/1.49
% 1.23/1.49 ============================== PROOF =================================
% 1.23/1.49 % SZS status Unsatisfiable
% 1.23/1.49 % SZS output start Refutation
% 1.23/1.49
% 1.23/1.49 % Proof 1 at 0.51 (+ 0.01) seconds: prove_this.
% 1.23/1.49 % Length of proof is 20.
% 1.23/1.49 % Level of proof is 5.
% 1.23/1.49 % Maximum clause weight is 25.000.
% 1.23/1.49 % Given clauses 135.
% 1.23/1.49
% 1.23/1.49 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.23/1.49 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.23/1.49 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.23/1.49 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.23/1.49 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 1.23/1.49 8 -theorem(implies(implies(q,r),implies(or(q,p),or(p,r)))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.23/1.49 9 -theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))) # answer(prove_this). [copy(8),rewrite([7(3),7(11),7(13)])].
% 1.23/1.49 10 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 1.23/1.49 11 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(10),rewrite([7(2)])].
% 1.23/1.49 16 theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.23/1.49 17 theorem(or(not(or(A,B)),or(B,A))). [copy(16),rewrite([7(3)])].
% 1.23/1.49 18 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.23/1.49 19 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(18),rewrite([7(5)])].
% 1.23/1.49 20 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.23/1.49 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)])].
% 1.23/1.49 32 -theorem(or(not(or(not(or(A,B)),or(B,A))),or(not(or(not(q),r)),or(not(or(q,p)),or(p,r))))) # answer(prove_this). [ur(11,a,9,a,c,17,a)].
% 1.23/1.49 42 theorem(or(not(or(A,or(not(B),C))),or(A,or(not(or(D,B)),or(D,C))))). [hyper(11,b,21,a,c,21,a)].
% 1.23/1.49 1244 -theorem(or(not(or(not(q),r)),or(not(or(not(or(A,B)),or(B,A))),or(not(or(q,p)),or(p,r))))) # answer(prove_this). [ur(11,a,32,a,b,19,a)].
% 1.23/1.49 4828 theorem(or(not(or(not(A),B)),or(not(or(C,or(D,A))),or(C,or(D,B))))). [hyper(11,b,42,a,c,21,a)].
% 1.23/1.49 4829 $F # answer(prove_this). [resolve(4828,a,1244,a)].
% 1.23/1.49
% 1.23/1.49 % SZS output end Refutation
% 1.23/1.49 ============================== end of proof ==========================
% 1.23/1.49
% 1.23/1.49 ============================== STATISTICS ============================
% 1.23/1.49
% 1.23/1.49 Given=135. Generated=7056. Kept=4815. proofs=1.
% 1.23/1.49 Usable=135. Sos=4635. Demods=1. Limbo=33, Disabled=25. Hints=0.
% 1.23/1.49 Megabytes=4.26.
% 1.23/1.49 User_CPU=0.51, System_CPU=0.01, Wall_clock=1.
% 1.23/1.49
% 1.23/1.49 ============================== end of statistics =====================
% 1.23/1.49
% 1.23/1.49 ============================== end of search =========================
% 1.23/1.49
% 1.23/1.49 THEOREM PROVED
% 1.23/1.49 % SZS status Unsatisfiable
% 1.23/1.49
% 1.23/1.49 Exiting with 1 proof.
% 1.23/1.49
% 1.23/1.49 Process 8485 exit (max_proofs) Mon Jul 4 02:42:39 2022
% 1.23/1.49 Prover9 interrupted
%------------------------------------------------------------------------------