TSTP Solution File: LCL225-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL225-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:10 EDT 2022
% Result : Unsatisfiable 2.05s 2.39s
% Output : Refutation 2.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL225-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n007.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 : Sat Jul 2 18:18:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 19264 was started by sandbox2 on n007.cluster.edu,
% 0.45/1.01 Sat Jul 2 18:18:56 2022
% 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19109_n007.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_19109_n007.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (9 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/1.01
% 0.45/1.01 ============================== end of process non-clausal formulas ===
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.01
% 0.45/1.01 ============================== PREDICATE ELIMINATION =================
% 0.45/1.01 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 0.45/1.01 2 axiom(or(not(or(A,A)),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 0.45/1.01 3 axiom(or(not(A),or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 0.45/1.01 4 axiom(or(not(or(A,B)),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 0.45/1.01 5 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 0.45/1.01 6 axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 0.45/1.01 Derived: theorem(or(not(or(A,A)),A)). [resolve(1,b,2,a)].
% 0.45/1.01 Derived: theorem(or(not(A),or(B,A))). [resolve(1,b,3,a)].
% 0.45/1.01 Derived: theorem(or(not(or(A,B)),or(B,A))). [resolve(1,b,4,a)].
% 0.45/1.01 Derived: theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 0.45/1.01 Derived: theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))). [resolve(1,b,6,a)].
% 0.45/1.01 7 theorem(A) | -axiom(or(not(B),A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 0.45/1.01 Derived: theorem(A) | -theorem(or(A,A)). [resolve(7,b,2,a)].
% 0.45/1.01 Derived: theorem(or(A,B)) | -theorem(B). [resolve(7,b,3,a)].
% 0.45/1.01 Derived: theorem(or(A,B)) | -theorem(or(B,A)). [resolve(7,b,4,a)].
% 0.45/1.01 Derived: theorem(or(A,or(B,C))) | -theorem(or(B,or(A,C))). [resolve(7,b,5,a)].
% 0.45/1.01 Derived: theorem(or(not(or(A,B)),or(A,C))) | -theorem(or(not(B),C)). [resolve(7,b,6,a)].
% 0.45/1.01 8 theorem(or(not(A),B)) | -axiom(or(not(A),C)) | -theorem(or(not(C),B)) # label(rule_3) # label(axiom). [assumption].
% 0.45/1.01 Derived: theorem(or(not(or(A,A)),B)) | -theorem(or(not(A),B)). [resolve(8,b,2,a)].
% 0.45/1.01 Derived: theorem(or(not(A),B)) | -theorem(or(not(or(C,A)),B)). [resolve(8,b,3,a)].
% 0.45/1.01 Derived: theorem(or(not(or(A,B)),C)) | -theorem(or(not(or(B,A)),C)). [resolve(8,b,4,a)].
% 0.45/1.01 Derived: theorem(or(not(or(A,or(B,C))),D)) | -theorem(or(not(or(B,or(A,C))),D)). [resolve(8,b,5,a)].
% 2.05/2.39 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)].
% 2.05/2.39
% 2.05/2.39 ============================== end predicate elimination =============
% 2.05/2.39
% 2.05/2.39 Auto_denials:
% 2.05/2.39 % copying label prove_this to answer in negative clause
% 2.05/2.39
% 2.05/2.39 Term ordering decisions:
% 2.05/2.39
% 2.05/2.39 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 2.05/2.39 Function symbol KB weights: p=1. q=1. r=1. or=1. not=0.
% 2.05/2.39
% 2.05/2.39 ============================== end of process initial clauses ========
% 2.05/2.39
% 2.05/2.39 ============================== CLAUSES FOR SEARCH ====================
% 2.05/2.39
% 2.05/2.39 ============================== end of clauses for search =============
% 2.05/2.39
% 2.05/2.39 ============================== SEARCH ================================
% 2.05/2.39
% 2.05/2.39 % Starting search at 0.01 seconds.
% 2.05/2.39
% 2.05/2.39 Low Water (keep): wt=37.000, iters=3348
% 2.05/2.39
% 2.05/2.39 Low Water (keep): wt=31.000, iters=3363
% 2.05/2.39
% 2.05/2.39 Low Water (keep): wt=25.000, iters=3348
% 2.05/2.39
% 2.05/2.39 Low Water (keep): wt=23.000, iters=3386
% 2.05/2.39
% 2.05/2.39 Low Water (keep): wt=22.000, iters=3351
% 2.05/2.39
% 2.05/2.39 Low Water (keep): wt=21.000, iters=3333
% 2.05/2.39
% 2.05/2.39 Low Water (keep): wt=20.000, iters=3352
% 2.05/2.39
% 2.05/2.39 Low Water (keep): wt=19.000, iters=3339
% 2.05/2.39
% 2.05/2.39 ============================== PROOF =================================
% 2.05/2.39 % SZS status Unsatisfiable
% 2.05/2.39 % SZS output start Refutation
% 2.05/2.39
% 2.05/2.39 % Proof 1 at 1.36 (+ 0.02) seconds: prove_this.
% 2.05/2.39 % Length of proof is 31.
% 2.05/2.39 % Level of proof is 10.
% 2.05/2.39 % Maximum clause weight is 24.000.
% 2.05/2.39 % Given clauses 3390.
% 2.05/2.39
% 2.05/2.39 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 2.05/2.39 2 axiom(or(not(or(A,A)),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 2.05/2.39 3 axiom(or(not(A),or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 2.05/2.39 4 axiom(or(not(or(A,B)),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 2.05/2.39 5 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 2.05/2.39 6 axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 2.05/2.39 7 theorem(A) | -axiom(or(not(B),A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 2.05/2.39 8 theorem(or(not(A),B)) | -axiom(or(not(A),C)) | -theorem(or(not(C),B)) # label(rule_3) # label(axiom). [assumption].
% 2.05/2.39 9 -theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 2.05/2.39 12 theorem(or(not(or(A,B)),or(B,A))). [resolve(1,b,4,a)].
% 2.05/2.39 15 theorem(A) | -theorem(or(A,A)). [resolve(7,b,2,a)].
% 2.05/2.39 16 theorem(or(A,B)) | -theorem(B). [resolve(7,b,3,a)].
% 2.05/2.39 17 theorem(or(A,B)) | -theorem(or(B,A)). [resolve(7,b,4,a)].
% 2.05/2.39 18 theorem(or(A,or(B,C))) | -theorem(or(B,or(A,C))). [resolve(7,b,5,a)].
% 2.05/2.39 19 theorem(or(not(or(A,B)),or(A,C))) | -theorem(or(not(B),C)). [resolve(7,b,6,a)].
% 2.05/2.39 21 theorem(or(not(A),B)) | -theorem(or(not(or(C,A)),B)). [resolve(8,b,3,a)].
% 2.05/2.39 22 theorem(or(not(or(A,B)),C)) | -theorem(or(not(or(B,A)),C)). [resolve(8,b,4,a)].
% 2.05/2.39 23 theorem(or(not(or(A,or(B,C))),D)) | -theorem(or(not(or(B,or(A,C))),D)). [resolve(8,b,5,a)].
% 2.05/2.39 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)].
% 2.05/2.39 56 theorem(or(not(A),or(A,B))). [ur(21,b,12,a)].
% 2.05/2.39 63 -theorem(or(not(or(not(q),or(not(p),r))),or(not(or(not(p),q)),or(not(p),r)))) # answer(prove_this). [resolve(23,a,9,a)].
% 2.05/2.39 125 theorem(or(not(or(A,B)),or(A,or(B,C)))). [ur(19,b,56,a)].
% 2.05/2.39 763 theorem(or(A,or(not(or(A,B)),or(B,C)))). [ur(18,b,125,a)].
% 2.05/2.39 822 -theorem(or(not(or(not(or(A,q)),or(A,or(not(p),r)))),or(not(or(not(p),q)),or(not(p),r)))) # answer(prove_this). [resolve(63,a,24,a)].
% 2.05/2.39 1709 theorem(or(or(not(or(A,B)),or(B,C)),A)). [ur(17,b,763,a)].
% 2.05/2.39 2657 theorem(or(A,or(or(not(or(B,C)),or(C,D)),B))). [ur(16,b,1709,a)].
% 2.05/2.39 6304 theorem(or(or(not(or(A,B)),or(B,C)),or(D,A))). [ur(18,b,2657,a)].
% 2.05/2.39 9471 -theorem(or(not(or(not(p),or(not(p),r))),or(not(p),r))) # answer(prove_this). [resolve(822,a,19,a)].
% 2.05/2.39 10350 theorem(or(not(or(or(A,B),A)),or(A,B))). [ur(15,b,6304,a)].
% 2.05/2.39 10352 theorem(or(not(or(A,or(A,B))),or(A,B))). [ur(22,b,10350,a)].
% 2.05/2.39 10353 $F # answer(prove_this). [resolve(10352,a,9471,a)].
% 2.05/2.39
% 2.05/2.39 % SZS output end Refutation
% 2.05/2.39 ============================== end of proof ==========================
% 2.05/2.39
% 2.05/2.39 ============================== STATISTICS ============================
% 2.05/2.39
% 2.05/2.39 Given=3390. Generated=27806. Kept=10344. proofs=1.
% 2.05/2.39 Usable=3375. Sos=6156. Demods=0. Limbo=1, Disabled=835. Hints=0.
% 2.05/2.39 Megabytes=8.37.
% 2.05/2.39 User_CPU=1.36, System_CPU=0.02, Wall_clock=1.
% 2.05/2.39
% 2.05/2.39 ============================== end of statistics =====================
% 2.05/2.39
% 2.05/2.39 ============================== end of search =========================
% 2.05/2.39
% 2.05/2.39 THEOREM PROVED
% 2.05/2.39 % SZS status Unsatisfiable
% 2.05/2.39
% 2.05/2.39 Exiting with 1 proof.
% 2.05/2.39
% 2.05/2.39 Process 19264 exit (max_proofs) Sat Jul 2 18:18:57 2022
% 2.05/2.39 Prover9 interrupted
%------------------------------------------------------------------------------