TSTP Solution File: LCL223-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL223-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:08 EDT 2022
% Result : Unsatisfiable 1.98s 2.28s
% Output : Refutation 1.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL223-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n026.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 : Sun Jul 3 11:03:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/1.00 ============================== Prover9 ===============================
% 0.72/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.00 Process 9381 was started by sandbox on n026.cluster.edu,
% 0.72/1.00 Sun Jul 3 11:03:51 2022
% 0.72/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9227_n026.cluster.edu".
% 0.72/1.00 ============================== end of head ===========================
% 0.72/1.00
% 0.72/1.00 ============================== INPUT =================================
% 0.72/1.00
% 0.72/1.00 % Reading from file /tmp/Prover9_9227_n026.cluster.edu
% 0.72/1.00
% 0.72/1.00 set(prolog_style_variables).
% 0.72/1.00 set(auto2).
% 0.72/1.00 % set(auto2) -> set(auto).
% 0.72/1.00 % set(auto) -> set(auto_inference).
% 0.72/1.00 % set(auto) -> set(auto_setup).
% 0.72/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.00 % set(auto) -> set(auto_limits).
% 0.72/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.00 % set(auto) -> set(auto_denials).
% 0.72/1.00 % set(auto) -> set(auto_process).
% 0.72/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.00 % set(auto2) -> assign(stats, some).
% 0.72/1.00 % set(auto2) -> clear(echo_input).
% 0.72/1.00 % set(auto2) -> set(quiet).
% 0.72/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.00 % set(auto2) -> clear(print_given).
% 0.72/1.00 assign(lrs_ticks,-1).
% 0.72/1.00 assign(sos_limit,10000).
% 0.72/1.00 assign(order,kbo).
% 0.72/1.00 set(lex_order_vars).
% 0.72/1.00 clear(print_given).
% 0.72/1.00
% 0.72/1.00 % formulas(sos). % not echoed (9 formulas)
% 0.72/1.00
% 0.72/1.00 ============================== end of input ==========================
% 0.72/1.00
% 0.72/1.00 % From the command line: assign(max_seconds, 300).
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.00
% 0.72/1.00 % Formulas that are not ordinary clauses:
% 0.72/1.00
% 0.72/1.00 ============================== end of process non-clausal formulas ===
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.00
% 0.72/1.00 ============================== PREDICATE ELIMINATION =================
% 0.72/1.00 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 0.72/1.00 2 axiom(or(not(or(A,A)),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 0.72/1.00 3 axiom(or(not(A),or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 0.72/1.00 4 axiom(or(not(or(A,B)),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 0.72/1.00 5 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 0.72/1.00 6 axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 0.72/1.00 Derived: theorem(or(not(or(A,A)),A)). [resolve(1,b,2,a)].
% 0.72/1.00 Derived: theorem(or(not(A),or(B,A))). [resolve(1,b,3,a)].
% 0.72/1.00 Derived: theorem(or(not(or(A,B)),or(B,A))). [resolve(1,b,4,a)].
% 0.72/1.00 Derived: theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 0.72/1.00 Derived: theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))). [resolve(1,b,6,a)].
% 0.72/1.00 7 theorem(A) | -axiom(or(not(B),A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 0.72/1.00 Derived: theorem(A) | -theorem(or(A,A)). [resolve(7,b,2,a)].
% 0.72/1.00 Derived: theorem(or(A,B)) | -theorem(B). [resolve(7,b,3,a)].
% 0.72/1.00 Derived: theorem(or(A,B)) | -theorem(or(B,A)). [resolve(7,b,4,a)].
% 0.72/1.00 Derived: theorem(or(A,or(B,C))) | -theorem(or(B,or(A,C))). [resolve(7,b,5,a)].
% 0.72/1.00 Derived: theorem(or(not(or(A,B)),or(A,C))) | -theorem(or(not(B),C)). [resolve(7,b,6,a)].
% 0.72/1.00 8 theorem(or(not(A),B)) | -axiom(or(not(A),C)) | -theorem(or(not(C),B)) # label(rule_3) # label(axiom). [assumption].
% 0.72/1.00 Derived: theorem(or(not(or(A,A)),B)) | -theorem(or(not(A),B)). [resolve(8,b,2,a)].
% 0.72/1.00 Derived: theorem(or(not(A),B)) | -theorem(or(not(or(C,A)),B)). [resolve(8,b,3,a)].
% 0.72/1.00 Derived: theorem(or(not(or(A,B)),C)) | -theorem(or(not(or(B,A)),C)). [resolve(8,b,4,a)].
% 0.72/1.00 Derived: theorem(or(not(or(A,or(B,C))),D)) | -theorem(or(not(or(B,or(A,C))),D)). [resolve(8,b,5,a)].
% 1.98/2.28 Derived: theorem(or(not(or(not(A),B)),C)) | -theorem(or(not(or(not(or(D,A)),or(D,B))),C)). [resolve(8,b,6,a)].
% 1.98/2.28
% 1.98/2.28 ============================== end predicate elimination =============
% 1.98/2.28
% 1.98/2.28 Auto_denials:
% 1.98/2.28 % copying label prove_this to answer in negative clause
% 1.98/2.28
% 1.98/2.28 Term ordering decisions:
% 1.98/2.28
% 1.98/2.28 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 1.98/2.28 Function symbol KB weights: p=1. q=1. r=1. or=1. not=0.
% 1.98/2.28
% 1.98/2.28 ============================== end of process initial clauses ========
% 1.98/2.28
% 1.98/2.28 ============================== CLAUSES FOR SEARCH ====================
% 1.98/2.28
% 1.98/2.28 ============================== end of clauses for search =============
% 1.98/2.28
% 1.98/2.28 ============================== SEARCH ================================
% 1.98/2.28
% 1.98/2.28 % Starting search at 0.01 seconds.
% 1.98/2.28
% 1.98/2.28 Low Water (keep): wt=39.000, iters=3409
% 1.98/2.28
% 1.98/2.28 Low Water (keep): wt=31.000, iters=3357
% 1.98/2.28
% 1.98/2.28 Low Water (keep): wt=25.000, iters=3335
% 1.98/2.28
% 1.98/2.28 Low Water (keep): wt=23.000, iters=3382
% 1.98/2.28
% 1.98/2.28 Low Water (keep): wt=22.000, iters=3351
% 1.98/2.28
% 1.98/2.28 Low Water (keep): wt=21.000, iters=3335
% 1.98/2.28
% 1.98/2.28 Low Water (keep): wt=20.000, iters=3343
% 1.98/2.28
% 1.98/2.28 Low Water (keep): wt=19.000, iters=3336
% 1.98/2.28
% 1.98/2.28 ============================== PROOF =================================
% 1.98/2.28 % SZS status Unsatisfiable
% 1.98/2.28 % SZS output start Refutation
% 1.98/2.28
% 1.98/2.28 % Proof 1 at 1.27 (+ 0.02) seconds: prove_this.
% 1.98/2.28 % Length of proof is 32.
% 1.98/2.28 % Level of proof is 11.
% 1.98/2.28 % Maximum clause weight is 21.000.
% 1.98/2.28 % Given clauses 3389.
% 1.98/2.28
% 1.98/2.28 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.98/2.28 2 axiom(or(not(or(A,A)),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.98/2.28 3 axiom(or(not(A),or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.98/2.28 4 axiom(or(not(or(A,B)),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.98/2.28 5 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.98/2.28 6 axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.98/2.28 7 theorem(A) | -axiom(or(not(B),A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 1.98/2.28 8 theorem(or(not(A),B)) | -axiom(or(not(A),C)) | -theorem(or(not(C),B)) # label(rule_3) # label(axiom). [assumption].
% 1.98/2.28 9 -theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r)))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.98/2.28 12 theorem(or(not(or(A,B)),or(B,A))). [resolve(1,b,4,a)].
% 1.98/2.28 15 theorem(A) | -theorem(or(A,A)). [resolve(7,b,2,a)].
% 1.98/2.28 16 theorem(or(A,B)) | -theorem(B). [resolve(7,b,3,a)].
% 1.98/2.28 17 theorem(or(A,B)) | -theorem(or(B,A)). [resolve(7,b,4,a)].
% 1.98/2.28 18 theorem(or(A,or(B,C))) | -theorem(or(B,or(A,C))). [resolve(7,b,5,a)].
% 1.98/2.28 19 theorem(or(not(or(A,B)),or(A,C))) | -theorem(or(not(B),C)). [resolve(7,b,6,a)].
% 1.98/2.28 21 theorem(or(not(A),B)) | -theorem(or(not(or(C,A)),B)). [resolve(8,b,3,a)].
% 1.98/2.28 22 theorem(or(not(or(A,B)),C)) | -theorem(or(not(or(B,A)),C)). [resolve(8,b,4,a)].
% 1.98/2.28 23 theorem(or(not(or(A,or(B,C))),D)) | -theorem(or(not(or(B,or(A,C))),D)). [resolve(8,b,5,a)].
% 1.98/2.28 24 theorem(or(not(or(not(A),B)),C)) | -theorem(or(not(or(not(or(D,A)),or(D,B))),C)). [resolve(8,b,6,a)].
% 1.98/2.28 38 -theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))) # answer(prove_this). [resolve(18,a,9,a)].
% 1.98/2.29 56 theorem(or(not(A),or(A,B))). [ur(21,b,12,a)].
% 1.98/2.29 123 theorem(or(not(or(A,B)),or(A,or(B,C)))). [ur(19,b,56,a)].
% 1.98/2.29 279 -theorem(or(not(or(not(q),or(p,r))),or(not(or(p,q)),or(p,r)))) # answer(prove_this). [resolve(38,a,23,a)].
% 1.98/2.29 747 theorem(or(A,or(not(or(A,B)),or(B,C)))). [ur(18,b,123,a)].
% 1.98/2.29 1652 theorem(or(or(not(or(A,B)),or(B,C)),A)). [ur(17,b,747,a)].
% 1.98/2.29 2602 theorem(or(A,or(or(not(or(B,C)),or(C,D)),B))). [ur(16,b,1652,a)].
% 1.98/2.29 3148 -theorem(or(not(or(not(or(A,q)),or(A,or(p,r)))),or(not(or(p,q)),or(p,r)))) # answer(prove_this). [resolve(279,a,24,a)].
% 1.98/2.29 6292 theorem(or(or(not(or(A,B)),or(B,C)),or(D,A))). [ur(18,b,2602,a)].
% 1.98/2.29 10032 theorem(or(not(or(or(A,B),A)),or(A,B))). [ur(15,b,6292,a)].
% 1.98/2.29 10042 theorem(or(not(or(A,or(A,B))),or(A,B))). [ur(22,b,10032,a)].
% 1.98/2.29 10049 theorem(or(not(or(A,or(B,or(B,C)))),or(A,or(B,C)))). [ur(19,b,10042,a)].
% 1.98/2.29 10050 $F # answer(prove_this). [resolve(10049,a,3148,a)].
% 1.98/2.29
% 1.98/2.29 % SZS output end Refutation
% 1.98/2.29 ============================== end of proof ==========================
% 1.98/2.29
% 1.98/2.29 ============================== STATISTICS ============================
% 1.98/2.29
% 1.98/2.29 Given=3389. Generated=26407. Kept=10041. proofs=1.
% 1.98/2.29 Usable=3383. Sos=5961. Demods=0. Limbo=1, Disabled=719. Hints=0.
% 1.98/2.29 Megabytes=8.20.
% 1.98/2.29 User_CPU=1.27, System_CPU=0.02, Wall_clock=2.
% 1.98/2.29
% 1.98/2.29 ============================== end of statistics =====================
% 1.98/2.29
% 1.98/2.29 ============================== end of search =========================
% 1.98/2.29
% 1.98/2.29 THEOREM PROVED
% 1.98/2.29 % SZS status Unsatisfiable
% 1.98/2.29
% 1.98/2.29 Exiting with 1 proof.
% 1.98/2.29
% 1.98/2.29 Process 9381 exit (max_proofs) Sun Jul 3 11:03:53 2022
% 1.98/2.29 Prover9 interrupted
%------------------------------------------------------------------------------