TSTP Solution File: LCL006-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL006-1 : TPTP v8.1.0. Released v1.0.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:43:21 EDT 2022
% Result : Unsatisfiable 1.38s 1.65s
% Output : Refutation 1.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.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 : Sun Jul 3 22:25:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.38/1.65 ============================== Prover9 ===============================
% 1.38/1.65 Prover9 (32) version 2009-11A, November 2009.
% 1.38/1.65 Process 25883 was started by sandbox2 on n026.cluster.edu,
% 1.38/1.65 Sun Jul 3 22:25:37 2022
% 1.38/1.65 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25601_n026.cluster.edu".
% 1.38/1.65 ============================== end of head ===========================
% 1.38/1.65
% 1.38/1.65 ============================== INPUT =================================
% 1.38/1.65
% 1.38/1.65 % Reading from file /tmp/Prover9_25601_n026.cluster.edu
% 1.38/1.65
% 1.38/1.65 set(prolog_style_variables).
% 1.38/1.65 set(auto2).
% 1.38/1.65 % set(auto2) -> set(auto).
% 1.38/1.65 % set(auto) -> set(auto_inference).
% 1.38/1.65 % set(auto) -> set(auto_setup).
% 1.38/1.65 % set(auto_setup) -> set(predicate_elim).
% 1.38/1.65 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.38/1.65 % set(auto) -> set(auto_limits).
% 1.38/1.65 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.38/1.65 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.38/1.65 % set(auto) -> set(auto_denials).
% 1.38/1.65 % set(auto) -> set(auto_process).
% 1.38/1.65 % set(auto2) -> assign(new_constants, 1).
% 1.38/1.65 % set(auto2) -> assign(fold_denial_max, 3).
% 1.38/1.65 % set(auto2) -> assign(max_weight, "200.000").
% 1.38/1.65 % set(auto2) -> assign(max_hours, 1).
% 1.38/1.65 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.38/1.65 % set(auto2) -> assign(max_seconds, 0).
% 1.38/1.65 % set(auto2) -> assign(max_minutes, 5).
% 1.38/1.65 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.38/1.65 % set(auto2) -> set(sort_initial_sos).
% 1.38/1.65 % set(auto2) -> assign(sos_limit, -1).
% 1.38/1.65 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.38/1.65 % set(auto2) -> assign(max_megs, 400).
% 1.38/1.65 % set(auto2) -> assign(stats, some).
% 1.38/1.65 % set(auto2) -> clear(echo_input).
% 1.38/1.65 % set(auto2) -> set(quiet).
% 1.38/1.65 % set(auto2) -> clear(print_initial_clauses).
% 1.38/1.65 % set(auto2) -> clear(print_given).
% 1.38/1.65 assign(lrs_ticks,-1).
% 1.38/1.65 assign(sos_limit,10000).
% 1.38/1.65 assign(order,kbo).
% 1.38/1.65 set(lex_order_vars).
% 1.38/1.65 clear(print_given).
% 1.38/1.65
% 1.38/1.65 % formulas(sos). % not echoed (4 formulas)
% 1.38/1.65
% 1.38/1.65 ============================== end of input ==========================
% 1.38/1.65
% 1.38/1.65 % From the command line: assign(max_seconds, 300).
% 1.38/1.65
% 1.38/1.65 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.38/1.65
% 1.38/1.65 % Formulas that are not ordinary clauses:
% 1.38/1.65
% 1.38/1.65 ============================== end of process non-clausal formulas ===
% 1.38/1.65
% 1.38/1.65 ============================== PROCESS INITIAL CLAUSES ===============
% 1.38/1.65
% 1.38/1.65 ============================== PREDICATE ELIMINATION =================
% 1.38/1.65
% 1.38/1.65 ============================== end predicate elimination =============
% 1.38/1.65
% 1.38/1.65 Auto_denials:
% 1.38/1.65 % copying label prove_ec_1 to answer in negative clause
% 1.38/1.65
% 1.38/1.65 Term ordering decisions:
% 1.38/1.65 Function symbol KB weights: a=1. b=1. c=1. equivalent=1.
% 1.38/1.65
% 1.38/1.65 ============================== end of process initial clauses ========
% 1.38/1.65
% 1.38/1.65 ============================== CLAUSES FOR SEARCH ====================
% 1.38/1.65
% 1.38/1.65 ============================== end of clauses for search =============
% 1.38/1.65
% 1.38/1.65 ============================== SEARCH ================================
% 1.38/1.65
% 1.38/1.65 % Starting search at 0.01 seconds.
% 1.38/1.65
% 1.38/1.65 Low Water (keep): wt=28.000, iters=3387
% 1.38/1.65
% 1.38/1.65 Low Water (keep): wt=24.000, iters=3429
% 1.38/1.65
% 1.38/1.65 Low Water (keep): wt=20.000, iters=3397
% 1.38/1.65
% 1.38/1.65 ============================== PROOF =================================
% 1.38/1.65 % SZS status Unsatisfiable
% 1.38/1.65 % SZS output start Refutation
% 1.38/1.65
% 1.38/1.65 % Proof 1 at 0.57 (+ 0.01) seconds: prove_ec_1.
% 1.38/1.65 % Length of proof is 11.
% 1.38/1.65 % Level of proof is 5.
% 1.38/1.65 % Maximum clause weight is 16.000.
% 1.38/1.65 % Given clauses 140.
% 1.38/1.65
% 1.38/1.65 1 is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))) # label(ec_4) # label(axiom). [assumption].
% 1.38/1.65 2 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(A,equivalent(B,C)))) # label(ec_5) # label(axiom). [assumption].
% 1.38/1.65 3 -is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))) # label(prove_ec_1) # label(negated_conjecture) # answer(prove_ec_1). [assumption].
% 1.38/1.65 4 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 1.38/1.65 5 is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(A,equivalent(B,C))))). [hyper(4,a,2,a,b,2,a)].
% 1.38/1.65 7 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,B),C))). [hyper(4,a,1,a,b,2,a)].
% 1.38/1.65 8 is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(D,equivalent(B,equivalent(C,D))),A)))). [hyper(4,a,5,a,b,5,a)].
% 1.38/1.65 40 is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),equivalent(equivalent(equivalent(B,C),D),A)))). [hyper(4,a,5,a,b,7,a)].
% 1.38/1.65 96 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,equivalent(A,equivalent(B,C))),D)),D)). [hyper(4,a,1,a,b,8,a)].
% 1.38/1.65 7281 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,A)),equivalent(B,C))). [hyper(4,a,96,a,b,40,a)].
% 1.38/1.65 7282 $F # answer(prove_ec_1). [resolve(7281,a,3,a)].
% 1.38/1.65
% 1.38/1.65 % SZS output end Refutation
% 1.38/1.65 ============================== end of proof ==========================
% 1.38/1.65
% 1.38/1.65 ============================== STATISTICS ============================
% 1.38/1.65
% 1.38/1.65 Given=140. Generated=12929. Kept=7281. proofs=1.
% 1.38/1.65 Usable=140. Sos=7137. Demods=0. Limbo=3, Disabled=4. Hints=0.
% 1.38/1.65 Megabytes=5.93.
% 1.38/1.65 User_CPU=0.57, System_CPU=0.01, Wall_clock=1.
% 1.38/1.65
% 1.38/1.65 ============================== end of statistics =====================
% 1.38/1.65
% 1.38/1.65 ============================== end of search =========================
% 1.38/1.65
% 1.38/1.65 THEOREM PROVED
% 1.38/1.65 % SZS status Unsatisfiable
% 1.38/1.65
% 1.38/1.65 Exiting with 1 proof.
% 1.38/1.65
% 1.38/1.65 Process 25883 exit (max_proofs) Sun Jul 3 22:25:38 2022
% 1.38/1.65 Prover9 interrupted
%------------------------------------------------------------------------------