TSTP Solution File: LCL239-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL239-10 : TPTP v8.1.0. Released v7.5.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:20 EDT 2022
% Result : Unsatisfiable 0.50s 1.16s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : LCL239-10 : TPTP v8.1.0. Released v7.5.0.
% 0.09/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 4 15:32:07 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.50/1.16 ============================== Prover9 ===============================
% 0.50/1.16 Prover9 (32) version 2009-11A, November 2009.
% 0.50/1.16 Process 3666 was started by sandbox on n026.cluster.edu,
% 0.50/1.16 Mon Jul 4 15:32:07 2022
% 0.50/1.16 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3511_n026.cluster.edu".
% 0.50/1.16 ============================== end of head ===========================
% 0.50/1.16
% 0.50/1.16 ============================== INPUT =================================
% 0.50/1.16
% 0.50/1.16 % Reading from file /tmp/Prover9_3511_n026.cluster.edu
% 0.50/1.16
% 0.50/1.16 set(prolog_style_variables).
% 0.50/1.16 set(auto2).
% 0.50/1.16 % set(auto2) -> set(auto).
% 0.50/1.16 % set(auto) -> set(auto_inference).
% 0.50/1.16 % set(auto) -> set(auto_setup).
% 0.50/1.16 % set(auto_setup) -> set(predicate_elim).
% 0.50/1.16 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/1.16 % set(auto) -> set(auto_limits).
% 0.50/1.16 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/1.16 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/1.16 % set(auto) -> set(auto_denials).
% 0.50/1.16 % set(auto) -> set(auto_process).
% 0.50/1.16 % set(auto2) -> assign(new_constants, 1).
% 0.50/1.16 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/1.16 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/1.16 % set(auto2) -> assign(max_hours, 1).
% 0.50/1.16 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/1.16 % set(auto2) -> assign(max_seconds, 0).
% 0.50/1.16 % set(auto2) -> assign(max_minutes, 5).
% 0.50/1.16 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/1.16 % set(auto2) -> set(sort_initial_sos).
% 0.50/1.16 % set(auto2) -> assign(sos_limit, -1).
% 0.50/1.16 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/1.16 % set(auto2) -> assign(max_megs, 400).
% 0.50/1.16 % set(auto2) -> assign(stats, some).
% 0.50/1.16 % set(auto2) -> clear(echo_input).
% 0.50/1.16 % set(auto2) -> set(quiet).
% 0.50/1.16 % set(auto2) -> clear(print_initial_clauses).
% 0.50/1.16 % set(auto2) -> clear(print_given).
% 0.50/1.16 assign(lrs_ticks,-1).
% 0.50/1.16 assign(sos_limit,10000).
% 0.50/1.16 assign(order,kbo).
% 0.50/1.16 set(lex_order_vars).
% 0.50/1.16 clear(print_given).
% 0.50/1.16
% 0.50/1.16 % formulas(sos). % not echoed (11 formulas)
% 0.50/1.16
% 0.50/1.16 ============================== end of input ==========================
% 0.50/1.16
% 0.50/1.16 % From the command line: assign(max_seconds, 300).
% 0.50/1.16
% 0.50/1.16 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/1.16
% 0.50/1.16 % Formulas that are not ordinary clauses:
% 0.50/1.16
% 0.50/1.16 ============================== end of process non-clausal formulas ===
% 0.50/1.16
% 0.50/1.16 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/1.16
% 0.50/1.16 ============================== PREDICATE ELIMINATION =================
% 0.50/1.16
% 0.50/1.16 ============================== end predicate elimination =============
% 0.50/1.16
% 0.50/1.16 Auto_denials:
% 0.50/1.16 % copying label prove_this to answer in negative clause
% 0.50/1.16
% 0.50/1.16 Term ordering decisions:
% 0.50/1.16 Function symbol KB weights: true=1. p=1. or=1. implies=1. and=1. axiom=1. not=1. theorem=1. ifeq=1.
% 0.50/1.16
% 0.50/1.16 ============================== end of process initial clauses ========
% 0.50/1.16
% 0.50/1.16 ============================== CLAUSES FOR SEARCH ====================
% 0.50/1.16
% 0.50/1.16 ============================== end of clauses for search =============
% 0.50/1.16
% 0.50/1.16 ============================== SEARCH ================================
% 0.50/1.16
% 0.50/1.16 % Starting search at 0.01 seconds.
% 0.50/1.16
% 0.50/1.16 ============================== PROOF =================================
% 0.50/1.16 % SZS status Unsatisfiable
% 0.50/1.16 % SZS output start Refutation
% 0.50/1.16
% 0.50/1.16 % Proof 1 at 0.03 (+ 0.00) seconds: prove_this.
% 0.50/1.16 % Length of proof is 29.
% 0.50/1.16 % Level of proof is 9.
% 0.50/1.16 % Maximum clause weight is 17.000.
% 0.50/1.16 % Given clauses 51.
% 0.50/1.16
% 0.50/1.16 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 0.50/1.16 2 axiom(implies(or(A,A),A)) = true # label(axiom_1_2) # label(axiom). [assumption].
% 0.50/1.16 3 axiom(implies(A,or(B,A))) = true # label(axiom_1_3) # label(axiom). [assumption].
% 0.50/1.16 4 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 0.50/1.16 5 ifeq(axiom(A),true,theorem(A),true) = true # label(rule_1) # label(axiom). [assumption].
% 0.50/1.16 6 axiom(implies(or(A,B),or(B,A))) = true # label(axiom_1_4) # label(axiom). [assumption].
% 0.50/1.16 7 axiom(or(not(or(A,B)),or(B,A))) = true. [copy(6),rewrite([4(3)])].
% 0.50/1.16 8 and(A,B) = not(or(not(A),not(B))) # label(and_defn) # label(axiom). [assumption].
% 0.50/1.16 9 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true # label(axiom_1_5) # label(axiom). [assumption].
% 0.50/1.16 10 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true. [copy(9),rewrite([4(5)])].
% 0.50/1.16 13 ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true # label(rule_2) # label(axiom). [assumption].
% 0.50/1.16 14 ifeq(theorem(or(not(A),B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true. [copy(13),rewrite([4(1)])].
% 0.50/1.16 15 theorem(not(and(p,not(p)))) != true # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 0.50/1.16 16 theorem(not(not(or(not(p),not(not(p)))))) != true # answer(prove_this). [copy(15),rewrite([8(4)])].
% 0.50/1.16 17 axiom(or(not(A),or(B,A))) = true. [back_rewrite(3),rewrite([4(2)])].
% 0.50/1.16 18 axiom(or(not(or(A,A)),A)) = true. [back_rewrite(2),rewrite([4(2)])].
% 0.50/1.16 19 theorem(or(not(or(A,B)),or(B,A))) = true. [para(7(a,1),5(a,1,1)),rewrite([1(9)])].
% 0.50/1.16 20 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true. [para(10(a,1),5(a,1,1)),rewrite([1(11)])].
% 0.50/1.16 22 theorem(or(not(A),or(B,A))) = true. [para(17(a,1),5(a,1,1)),rewrite([1(8)])].
% 0.50/1.16 23 theorem(or(not(or(A,A)),A)) = true. [para(18(a,1),5(a,1,1)),rewrite([1(8)])].
% 0.50/1.16 24 ifeq(theorem(or(A,B)),true,theorem(or(B,A)),true) = true. [para(19(a,1),14(a,1,1)),rewrite([1(11)])].
% 0.50/1.16 28 ifeq(theorem(or(not(or(not(A),or(B,A))),C)),true,theorem(C),true) = true. [para(22(a,1),14(a,1,3,1)),rewrite([1(12)])].
% 0.50/1.16 30 ifeq(theorem(or(A,A)),true,theorem(A),true) = true. [para(23(a,1),14(a,1,1)),rewrite([1(10)])].
% 0.50/1.16 90 theorem(or(A,or(not(B),B))) = true. [para(20(a,1),28(a,1,1)),rewrite([1(8)])].
% 0.50/1.16 98 theorem(or(not(A),A)) = true. [para(90(a,1),30(a,1,1)),rewrite([1(7)])].
% 0.50/1.16 103 theorem(or(A,not(A))) = true. [para(98(a,1),24(a,1,1)),rewrite([1(7)])].
% 0.50/1.16 105 ifeq(theorem(A),true,theorem(not(not(A))),true) = true. [para(103(a,1),14(a,1,1)),rewrite([1(11)])].
% 0.50/1.16 178 theorem(not(not(or(A,not(A))))) = true. [para(103(a,1),105(a,1,1)),rewrite([1(9)])].
% 0.50/1.16 179 $F # answer(prove_this). [resolve(178,a,16,a)].
% 0.50/1.16
% 0.50/1.16 % SZS output end Refutation
% 0.50/1.16 ============================== end of proof ==========================
% 0.50/1.16
% 0.50/1.16 ============================== STATISTICS ============================
% 0.50/1.16
% 0.50/1.16 Given=51. Generated=796. Kept=173. proofs=1.
% 0.50/1.16 Usable=51. Sos=100. Demods=164. Limbo=14, Disabled=18. Hints=0.
% 0.50/1.16 Megabytes=0.23.
% 0.50/1.16 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.50/1.16
% 0.50/1.16 ============================== end of statistics =====================
% 0.50/1.16
% 0.50/1.16 ============================== end of search =========================
% 0.50/1.16
% 0.50/1.16 THEOREM PROVED
% 0.50/1.16 % SZS status Unsatisfiable
% 0.50/1.16
% 0.50/1.16 Exiting with 1 proof.
% 0.50/1.16
% 0.50/1.16 Process 3666 exit (max_proofs) Mon Jul 4 15:32:07 2022
% 0.50/1.16 Prover9 interrupted
%------------------------------------------------------------------------------