TSTP Solution File: LCL218-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL218-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:04 EDT 2022
% Result : Unsatisfiable 3.05s 3.34s
% Output : Refutation 3.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL218-10 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 4 18:13:56 EDT 2022
% 0.14/0.34 % CPUTime :
% 3.05/3.34 ============================== Prover9 ===============================
% 3.05/3.34 Prover9 (32) version 2009-11A, November 2009.
% 3.05/3.34 Process 16171 was started by sandbox on n025.cluster.edu,
% 3.05/3.34 Mon Jul 4 18:13:57 2022
% 3.05/3.34 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16018_n025.cluster.edu".
% 3.05/3.34 ============================== end of head ===========================
% 3.05/3.34
% 3.05/3.34 ============================== INPUT =================================
% 3.05/3.34
% 3.05/3.34 % Reading from file /tmp/Prover9_16018_n025.cluster.edu
% 3.05/3.34
% 3.05/3.34 set(prolog_style_variables).
% 3.05/3.34 set(auto2).
% 3.05/3.34 % set(auto2) -> set(auto).
% 3.05/3.34 % set(auto) -> set(auto_inference).
% 3.05/3.34 % set(auto) -> set(auto_setup).
% 3.05/3.34 % set(auto_setup) -> set(predicate_elim).
% 3.05/3.34 % set(auto_setup) -> assign(eq_defs, unfold).
% 3.05/3.34 % set(auto) -> set(auto_limits).
% 3.05/3.34 % set(auto_limits) -> assign(max_weight, "100.000").
% 3.05/3.34 % set(auto_limits) -> assign(sos_limit, 20000).
% 3.05/3.34 % set(auto) -> set(auto_denials).
% 3.05/3.34 % set(auto) -> set(auto_process).
% 3.05/3.34 % set(auto2) -> assign(new_constants, 1).
% 3.05/3.34 % set(auto2) -> assign(fold_denial_max, 3).
% 3.05/3.34 % set(auto2) -> assign(max_weight, "200.000").
% 3.05/3.34 % set(auto2) -> assign(max_hours, 1).
% 3.05/3.34 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 3.05/3.34 % set(auto2) -> assign(max_seconds, 0).
% 3.05/3.34 % set(auto2) -> assign(max_minutes, 5).
% 3.05/3.34 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 3.05/3.34 % set(auto2) -> set(sort_initial_sos).
% 3.05/3.34 % set(auto2) -> assign(sos_limit, -1).
% 3.05/3.34 % set(auto2) -> assign(lrs_ticks, 3000).
% 3.05/3.34 % set(auto2) -> assign(max_megs, 400).
% 3.05/3.34 % set(auto2) -> assign(stats, some).
% 3.05/3.34 % set(auto2) -> clear(echo_input).
% 3.05/3.34 % set(auto2) -> set(quiet).
% 3.05/3.34 % set(auto2) -> clear(print_initial_clauses).
% 3.05/3.34 % set(auto2) -> clear(print_given).
% 3.05/3.34 assign(lrs_ticks,-1).
% 3.05/3.34 assign(sos_limit,10000).
% 3.05/3.34 assign(order,kbo).
% 3.05/3.34 set(lex_order_vars).
% 3.05/3.34 clear(print_given).
% 3.05/3.34
% 3.05/3.34 % formulas(sos). % not echoed (10 formulas)
% 3.05/3.34
% 3.05/3.34 ============================== end of input ==========================
% 3.05/3.34
% 3.05/3.34 % From the command line: assign(max_seconds, 300).
% 3.05/3.34
% 3.05/3.34 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 3.05/3.34
% 3.05/3.34 % Formulas that are not ordinary clauses:
% 3.05/3.34
% 3.05/3.34 ============================== end of process non-clausal formulas ===
% 3.05/3.34
% 3.05/3.34 ============================== PROCESS INITIAL CLAUSES ===============
% 3.05/3.34
% 3.05/3.34 ============================== PREDICATE ELIMINATION =================
% 3.05/3.34
% 3.05/3.34 ============================== end predicate elimination =============
% 3.05/3.34
% 3.05/3.34 Auto_denials:
% 3.05/3.34 % copying label prove_this to answer in negative clause
% 3.05/3.34
% 3.05/3.34 Term ordering decisions:
% 3.05/3.34 Function symbol KB weights: true=1. p=1. q=1. or=1. not=1. axiom=1. theorem=1. ifeq=1.
% 3.05/3.34
% 3.05/3.34 ============================== end of process initial clauses ========
% 3.05/3.34
% 3.05/3.34 ============================== CLAUSES FOR SEARCH ====================
% 3.05/3.34
% 3.05/3.34 ============================== end of clauses for search =============
% 3.05/3.34
% 3.05/3.34 ============================== SEARCH ================================
% 3.05/3.34
% 3.05/3.34 % Starting search at 0.01 seconds.
% 3.05/3.34
% 3.05/3.34 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 759 (0.00 of 0.52 sec).
% 3.05/3.34
% 3.05/3.34 ============================== PROOF =================================
% 3.05/3.34 % SZS status Unsatisfiable
% 3.05/3.34 % SZS output start Refutation
% 3.05/3.34
% 3.05/3.34 % Proof 1 at 2.10 (+ 0.18) seconds: prove_this.
% 3.05/3.34 % Length of proof is 21.
% 3.05/3.34 % Level of proof is 8.
% 3.05/3.34 % Maximum clause weight is 23.000.
% 3.05/3.34 % Given clauses 1243.
% 3.05/3.34
% 3.05/3.34 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 3.05/3.34 2 axiom(or(not(or(A,A)),A)) = true # label(axiom_1_2) # label(axiom). [assumption].
% 3.05/3.34 3 axiom(or(not(A),or(B,A))) = true # label(axiom_1_3) # label(axiom). [assumption].
% 3.05/3.34 4 ifeq(axiom(A),true,theorem(A),true) = true # label(rule_1) # label(axiom). [assumption].
% 3.05/3.34 5 axiom(or(not(or(A,B)),or(B,A))) = true # label(axiom_1_4) # label(axiom). [assumption].
% 3.05/3.34 6 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true # label(axiom_1_5) # label(axiom). [assumption].
% 3.05/3.34 8 ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true # label(rule_2) # label(axiom). [assumption].
% 3.05/3.34 9 ifeq(theorem(or(not(A),B)),true,ifeq(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true) = true # label(rule_3) # label(axiom). [assumption].
% 3.05/3.34 10 theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 3.05/3.34 12 theorem(or(not(A),or(B,A))) = true. [para(3(a,1),4(a,1,1)),rewrite([1(8)])].
% 3.05/3.34 16 ifeq(theorem(or(A,A)),true,theorem(A),true) = true. [para(2(a,1),8(a,1,3,1)),rewrite([1(8)])].
% 3.05/3.34 19 ifeq(theorem(or(A,or(B,C))),true,theorem(or(B,or(A,C))),true) = true. [para(6(a,1),8(a,1,3,1)),rewrite([1(11)])].
% 3.05/3.34 22 ifeq(theorem(or(not(or(A,B)),C)),true,theorem(or(not(B),C)),true) = true. [para(3(a,1),9(a,1,3,1)),rewrite([1(12)])].
% 3.05/3.34 24 ifeq(theorem(or(not(or(A,B)),C)),true,theorem(or(not(or(B,A)),C)),true) = true. [para(5(a,1),9(a,1,3,1)),rewrite([1(13)])].
% 3.05/3.34 80 theorem(or(A,or(not(B),B))) = true. [para(12(a,1),19(a,1,1)),rewrite([1(8)])].
% 3.05/3.34 88 theorem(or(not(A),A)) = true. [para(80(a,1),16(a,1,1)),rewrite([1(7)])].
% 3.05/3.34 93 theorem(or(A,or(not(or(A,B)),B))) = true. [para(88(a,1),19(a,1,1)),rewrite([1(9)])].
% 3.05/3.34 231 theorem(or(not(or(A,B)),or(not(or(not(or(B,A)),C)),C))) = true. [para(93(a,1),24(a,1,1)),rewrite([1(13)])].
% 3.05/3.34 2697 theorem(or(not(A),or(not(or(not(or(A,B)),C)),C))) = true. [para(231(a,1),22(a,1,1)),rewrite([1(12)])].
% 3.05/3.34 5844 theorem(or(not(or(not(or(A,B)),C)),or(not(A),C))) = true. [para(2697(a,1),19(a,1,1)),rewrite([1(12)])].
% 3.05/3.34 5845 $F # answer(prove_this). [resolve(5844,a,10,a)].
% 3.05/3.34
% 3.05/3.34 % SZS output end Refutation
% 3.05/3.34 ============================== end of proof ==========================
% 3.05/3.34
% 3.05/3.34 ============================== STATISTICS ============================
% 3.05/3.34
% 3.05/3.34 Given=1243. Generated=358388. Kept=5844. proofs=1.
% 3.05/3.34 Usable=1243. Sos=4583. Demods=5829. Limbo=4, Disabled=23. Hints=0.
% 3.05/3.34 Megabytes=6.33.
% 3.05/3.34 User_CPU=2.10, System_CPU=0.18, Wall_clock=2.
% 3.05/3.34
% 3.05/3.34 ============================== end of statistics =====================
% 3.05/3.34
% 3.05/3.34 ============================== end of search =========================
% 3.05/3.34
% 3.05/3.34 THEOREM PROVED
% 3.05/3.34 % SZS status Unsatisfiable
% 3.05/3.34
% 3.05/3.34 Exiting with 1 proof.
% 3.05/3.34
% 3.05/3.34 Process 16171 exit (max_proofs) Mon Jul 4 18:13:59 2022
% 3.05/3.34 Prover9 interrupted
%------------------------------------------------------------------------------